|
Experimental isoefficiency curves for RP for different efficiencies
|
səhifə | 18/23 | tarix | 26.12.2016 | ölçüsü | 0,99 Mb. | | #3369 |
|
Experimental isoefficiency curves for RP for different efficiencies.
How do you know when everyone's done? A number of algorithms have been proposed.
Assume that all processors are organized in a logical ring. Assume, for now that work transfers can only happen from Pi to Pj if j > i. Processor P0 initiates a token on the ring when it goes idle. Each intermediate processor receives this token and forwards it when it becomes idle.
Now, let us do away with the restriction on work transfers.
Dostları ilə paylaş:
|
|
|