On message packaging in task scheduling for distributed memory parallel machines

DOI10.1142/S0129054101000497MaRDI QIDQ5249258zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Task scheduling with and without communication delays: A unified approach
• CLUSTER-BASED TASK SCHEDULING FOR THE LOGP MODEL
• scientific article; zbMATH DE number 2090587
• Task scheduling of parallel programs to optimize communications for cluster of SMPs
• Task scheduling with interprocessor communication delays

Cites work

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

Cited in

(1)

• Parallel Processing and Applied Mathematics

This page was built for publication: On message packaging in task scheduling for distributed memory parallel machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249258)