ON MESSAGE PACKAGING IN TASK SCHEDULING FOR DISTRIBUTED MEMORY PARALLEL MACHINES

DOI10.1142/S0129054101000497zbMath1319.68036OpenAlexW2041407472MaRDI QIDQ5249258

Tomoki Baba, Ken'ichi Hagihara, Noriyuki Fujimoto, Takashi Hashimoto

Publication date: 30 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054101000497

zbMATH Keywords

task schedulingdistributed memoryfine grainbulk synchronous schedulemessage packagingsoftware overhead

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Towards an Architecture-Independent Analysis of Parallel Algorithms
• C.P.M. Scheduling with Small Communication Delays and Task Duplication
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: ON MESSAGE PACKAGING IN TASK SCHEDULING FOR DISTRIBUTED MEMORY PARALLEL MACHINES