A scalable scheduling scheme for functional parallelism on distributed memory multiprocessor systems

We attempt a new variant of the scheduling problem by investigating the scalability of the schedule length with the required number of processors, by performing scheduling partially at compile time and partially at run time. Assuming infinite number of processors, the compile time schedule is found...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on parallel and distributed systems Ročník 6; číslo 4; s. 388 - 399
Hlavní autori:	Pande, S., Agrawal, D.P., Mauney, J.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Los Alamitos, CA IEEE 01.04.1995 IEEE Computer Society
Predmet:	Applied sciences Computer science; control theory; systems Computer systems and distributed systems. User interface Costs Delay effects Dynamic scheduling Exact sciences and technology Multiprocessing systems Optimal scheduling Parallel processing Processor scheduling Runtime Scalability Scheduling algorithm Software Software engineering Multiprocessor Distributed memory multiprocessor system Graph Parallelism Scheduling Distributed system Data flow
ISSN:	1045-9219
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!