Instant-access cycle-stealing for parallel applications requiring interactive response

DOI10.1007/3-540-45706-2_122MaRDI QIDQ4813168zbMATH OpenFDO

Authors Paul H. J. Kelly, Susanna Pelagatti, M. H. Rossiter

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2400/24000863.htm

zbMATH Keywords

cycle stealingparallel computingperformance prediction

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Guidelines for data-parallel cycle-stealing in networks of workstations. II: On maximizing guaranteed output
• Effective scheduling of local interactive processes and parallel processes in a non-dedicated cluster environment
• Fault-tolerance mechanisms for a parallel programming system -- a responsiveness perspective
• scientific article; zbMATH DE number 1088302
• Using parallel program characteristics in dynamic processor allocation policies

This page was built for publication: Instant-access cycle-stealing for parallel applications requiring interactive response

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