Performance driven distributed scheduling of parallel hybrid computations

DOI10.1016/J.TCS.2010.11.044MaRDI QIDQ553361zbMATH OpenOpenAlexFDO

Authors Ankur Narang, R. K. Shyamasundar

Publication date 27 July 2011

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2010.11.044

zbMATH Keywords

asymptotic complexitydeadlock free schedulingdistributed schedulingmultithreaded computationonline algorithmwork stealing

Mathematics Subject Classification ID

Distributed systems (68M14) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15) Online algorithms; streaming algorithms (68W27)

Recommendations

• Adaptive scheduling of computations and communications on distributed-memory systems
• Scheduling for parallel processing
• Polynomial scheduling algorithm for parallel applications on hybrid platforms
• A family of scheduling algorithms for hybrid parallel platforms
• Scheduling and optimizing algorithm for parallel tasks in heterogeneous distributed computing systems

Cites work

• Analyses of load stealing models based on families of differential equations
• Scheduling
• Scheduling multithreaded computations by work stealing
• The data locality of work stealing
• Thread scheduling for multiprogrammed multiprocessors

Cited in

(4)

• Hierarchical scheduling of dynamical parallel computations on hypercube multicomputers
• A hybrid scheduler for many task computing in big data systems
• Performance modeling of parallel applications for grid scheduling
• Euro-Par 2004 Parallel Processing

Describes a project that uses

Uses Software

• Fortress
• Chapel

This page was built for publication: Performance driven distributed scheduling of parallel hybrid computations

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