Location:
Search - semaphore
Search list
Description: Visual.C++程序设计技巧与实例--配套光盘
第4章 进程和线程
本章共有8个实例：
1. Process创建和终止进程
2. WorkerThread创建工作者线程
3. UIThread用户界面线程示例
4. Event使用事件对象来实现线程的同步
5. Thread使用临界区对象来实现线程的同步
6. Mutex使用互斥量对象来实现不同进程间的线程同步
7. Semaphore使用信号量对象实现线程的同步
8. MutiThread多线程任务调度与处理-Visual.C program design techniques and examples-- matching CD Chapter 4 of this chapter thread and process a total of eight examples : 1. Process creation and termination process 2. WorkerThread threads created three workers. U IThread user interface thread Example 4. Event object to the use of the incident to Thread Synchronization 5. Th read using critical areas to achieve the target thread synchronization 6. Mutex mutex used to achieve volume targets different process The thread synchronization 7. Semaphore use semaphore object to Thread Synchronization 8. MutiThr perf multithreaded task scheduling and processing
Platform: |
Size: 377856 |
Author: xixi |
Hits:
Description: μCOS-II下LPC213x的SPI主模式底层驱动中间件
去掉信号量判断，改为查询方式-μCOS-II under the SPI master mode LPC213x underlying middleware driver removed Semaphore judge changed the way inquiries
Platform: |
Size: 2048 |
Author: 赖皮 |
Hits:
Description: In a preemptive priority based RTOS, priority inversion
problem is among the major sources of deadline
violations. Priority inheritance protocol is one of the
approaches to reduce priority inversion. Unfortunately,
RTOS like uC/OS can’t support priority inheritance
protocol since it does not allow kernel to have multiple
tasks at the same priority. Although it has different ways
to avoid priority inversion such as priority ceiling
protocol, developers still have some difficulties in
programming real time applications with it. In this paper,
we redesign the uC/OS kernel to provide the ability to
support round robin scheduling and implement priority
inheritance semaphore on the modified kernel. As result,
we port new kernel with priority inheritance semaphore to
evaluation board, and evaluate the execution time of each
of the kernel service as well as verify the operations of
our implementation.-In a preemptive priority based RTOS, priority inversionproblem is among the major sources of deadlineviolations. Priority inheritance protocol is one of theapproaches to reduce priority inversion. Unfortunately, RTOS like uC/OS can t support priority inheritanceprotocol since it does not allow kernel to have multipletasks at the same priority. Although it has different waysto avoid priority inversion such as priority ceilingprotocol, developers still have some difficulties inprogramming real time applications with it. In this paper, we redesign the uC/OS kernel to provide the ability tosupport round robin scheduling and implement priorityinheritance semaphore on the modified kernel. As result, we port new kernel with priority inheritance semaphore toevaluation board, and evaluate the execution time of eachof the kernel service as well as verify the operations ofour implementation.
Platform: |
Size: 135168 |
Author: 刘天宏 |
Hits:
Description: 操作系统课程信号量机制实验（哲学家吃乳猪），JAVA源码-Operating systems courses semaphore mechanism Experiment (philosopher to eat suckling pig), JAVA source
Platform: |
Size: 5120 |
Author: tutu |
Hits:
Description: vc下的uc/os嵌入式系统，内构建了文件系统。代码中信号量用的特别多-vc under uc/os for embedded systems, within the constructed file system. Semaphore code used in a particularly large number of
Platform: |
Size: 2260992 |
Author: gengpeng |
Hits:
Description: 信号量实现对生产者和消费者的共享内存的控制-Semaphore producers and consumers to achieve the shared memory control
Platform: |
Size: 1024 |
Author: 一飞 |
Hits:
Description: 在Windows2000或Windows XP环境下，创建一个控制台进程，此进程包含n个线程。用这n个线程来表示n个读者或写者。每个线程按相应测试数据文件的要求进行读写操作。用信号量机制分别实现读者优先和写者优先问题。-In Windows2000 or Windows XP environment, the creation of a console process, this process contains n threads. Using this n that n threads to a reader or writer. Each thread in accordance with the corresponding test data files to read and write operation requirements. Semaphore mechanism with the respective priorities and the achievement of the readers who write priority issue.
Platform: |
Size: 2048 |
Author: lifei |
Hits:
Description: 用以演示他提出的信号量机制。本作业要求设计在同一个进程地址空间内执行的两个线程。生产者线程生产物品，然后将物品放置在一个空缓冲区中供消费者线程消费。-For the presentation he made semaphore mechanism. Operational requirements of the design process in the same address space to implement the two threads. Thread the production of goods producers, and then the article should be placed in an empty buffer for consumers thread consumption.
Platform: |
Size: 1024 |
Author: 刘军 |
Hits:
Description: 在编程过程中产生线程作了全面的分析，分析CriticalSection Mutex Semaphore Event在线程中的应用时各自优缺点作详细解说-In the programming process thread comprehensive analysis CriticalSection Mutex Semaphore Event in the thread of the application for a detailed explanation of their respective advantages and disadvantages
Platform: |
Size: 22439936 |
Author: |
Hits:
Description: The main purpose of this project is to add a new scheduling algorithm to GeekOS and to implement a simple synchronization primitive (semaphore). As you might have already noticed, GeekOS uses a simple priority based preemptive Round Robin algorithm. In this project, you will change this to a multilevel feedback scheduling. In addition, you will provide user programs with semaphores, a means to check the system s current time and a mechanism for passing command-line arguments
Platform: |
Size: 588800 |
Author: 向东 |
Hits:
Description: 初学VC++多线程必不可少的资料，内容非常详细。讲到了临界区（CCriticalSection）
事件（CEvent）互斥量（CMutex）信号量（CSemaphore）
-Beginner VC++ Multi-threaded essential information, very detailed. Referred to the critical region (CCriticalSection) events (CEvent) mutex volume (CMutex) Semaphore (CSemaphore)
Platform: |
Size: 22528 |
Author: 小钻风 |
Hits:
Description: VC++进程线程实例：EVENT，MUTEX，MUTITHREAD，PROCESS，SEMAPHORE，THREAD，UITHREAD，WORKERTHREAD-VC++ Process instance thread: EVENT, MUTEX, MUTITHREAD, PROCESS, SEMAPHORE, THREAD, UITHREAD, WORKERTHREAD
Platform: |
Size: 316416 |
Author: 123 |
Hits:
Description: 进程通信与进程同步机制实践
有三个进程R、M、P，分别负责从键盘读入数据、对读入的数据进行处理、将处理后的数据从屏幕输出，三个进程共享同一个缓冲区。试用操作系统提供的进程通信和同步机制，使三个进程能够相互协作，正确的完成数据的读入、处理和输出。 -Process communication and process synchronization mechanism in practice the process has three R, M, P, respectively read from the keyboard data, the data read into the deal, will deal with data from the screen output, the three processes share the same buffer . Trial process of the operating system to provide communication and synchronization mechanism so that the three processes can work together, the correct completion of the read data, process and output.
Platform: |
Size: 101376 |
Author: 陈波 |
Hits:
Description: 通过编程6个哲学家吃饭了解进程(线程)同步与死锁.-Programmed to eat six philosophers to understand the process (thread) synchronization and deadlock.
Platform: |
Size: 632832 |
Author: apolo |
Hits:
Description: Description:
这是一个在inet上的任意两台机(中间没有防火墙的阻隔) 之间进行一对一通话的程序。使用阻塞方式的SOCKET。
Technology Used in This Project:
Winsock, Muti-Thread, Semaphore.
Platform: |
Size: 63488 |
Author: George |
Hits:
Description: UCOS-II FOR STM32F103XX
1 本程序是我自己移植，只使用KEIL进行过软仿真，测试没有发现问题。支持从任何一个中断服务程序里释放信号量。
2 此代码作为参考和学习使用，如果在使用过程中造成损失，本人不负任何责任。
3 此代码作为参考和学习使用，因为里边有UCOS-II，如果要作为商业使用请给UCOS付费。-UCOS-II FOR STM32F103XX 1 This procedure is my own transplant, carried out using only soft KEIL simulation, testing did not find the problem. Support from any one of interrupt service routine release semaphore. 2 of this code as a reference and learning to use, if in the use of the process of loss, I no responsibility. 3 of this code as a reference and learning to use, because inside has UCOS-II, if we as a commercial use, please pay uCOS.
Platform: |
Size: 110592 |
Author: |
Hits:
Description: 介绍linux下使用进程间通信的编程实例。-Introduced the use of linux-process communication programming examples.
Platform: |
Size: 1024 |
Author: 林松建 |
Hits:
Description: ucos-dining-philosopher.rar
ucos下的哲学家就餐问题（dining philosopher problems)，采用信号量机制解决，有截图和感悟。dos界面文字演示（另有图形界面）。-ucos-dining-philosopher.rarucos under the dining philosophers problem (dining philosopher problems), using semaphore mechanism to resolve screenshot and insights. dos interface text presentation (otherwise graphical interface).
Platform: |
Size: 281600 |
Author: xuxi |
Hits:
Description: TC-ucos-philos-详细注释.rar
用TC编译ucos并在图像化界面下演示哲学家就餐问题，采用信号量机制，程序有BUG，不能顺利运行，但是我写了很多注释，有兴趣的朋友可以继续做下去，我的邮箱xuxi009@163.com可与我联系。注意图形界面驱动的路径要和源文件中的相同否则无法显示图形界面，相信用过TC的图形界面的明白，呵呵。-TC-ucos-philos-detailed notes. Rar uCOS compiled by TC and the image of interface presentation dining philosophers problem, using semaphore mechanism, the process by BUG, not a smooth run, but I write a lot of notes, are interested in friends can continue to do so, I can xuxi009@163.com-mail to contact me. Attention-driven graphical interface and the source file path to the same graphical interface or can not be displayed, I believe that TC used to understand graphical interface,呵呵.
Platform: |
Size: 3765248 |
Author: xuxi |
Hits:
Description:
Introduction
In this project, we will design a programming solution to the bounded-buffer problem using the producer and consumer processes . The solution uses three semaphores: empty and full, which count the number of empty and full slots in the buffer, and mutex, which is a binary (or mutual exclusive) semaphore that protects the actual insertion or removal of items in the buffer. For this project, standard counting semaphores will be used for empty and full, and, rather than a binary semaphore, a mutex lock will be used to represent mutex. The producer and consumer – running as separate threads – will move items to and from a buffer that is synchronized with these empty, full, and mutex structures. You are required to use the pthread package to solve this problem in this project.
And there can be several producers/consumers as many as you want.
-Introduction In this project, we will design a programming solution to the bounded-buffer problem using the producer and consumer processes. The solution uses three semaphores: empty and full, which count the number of empty and full slots in the buffer, and mutex, which is a binary (or mutual exclusive) semaphore that protects the actual insertion or removal of items in the buffer. For this project, standard counting semaphores will be used for empty and full, and, rather than a binary semaphore, a mutex lock will be used to represent mutex. The producer and consumer- running as separate threads- will move items to and from a buffer that is synchronized with these empty, full, and mutex structures. You are required to use the pthread package to solve this problem in this project.And there can be several producers/consumers as many as you want.
Platform: |
Size: 96256 |
Author: MidnightD |
Hits:
«
1
23
4
5
6
7
8
9
10
...
28
»