Результаты (
русский) 1:
[копия]Скопировано!
3.12 Figure 3.6 illustrates a pipeline with n processes 1 through n. Streams of tasks are sent to the pipeline through the entry point. Each process completes 1/n fraction of a total task and passes it on to the next process. The finished task exits the pipeline at the exit point. Process i accepts an item for processing, when (1) it has completed its own part, (2) it sends an ack to its predecessor (i − 1), and (3) the predecessor (i − 1) delivers the item to it. Initially, processes 2 through n have sent acks to their predecessors. Write a program for process i (1 < i < n) using the state-reading model of interprocess communication.
переводится, пожалуйста, подождите..