Bounds and algorithms for a practical task allocation model (extended abstract)

DOI10.1007/BFB0009516MaRDI QIDQ6487459zbMATH OpenFDO

Authors Tsan-sheng Hsu, Dian Rae Lopez

Publication date 25 January 2023

Full work available at URL https://doi.org/10.1007/BFB0009516

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Approximation algorithms (68W25)

Recommendations

• Scheduling problems in a practical allocation model
• Scheduling independent multiprocessor tasks
• Approximation algorithms for general parallel task scheduling
• Probabilistic analysis of scheduling precedence constrained parallel tasks on multicomputers with contiguous processor allocation
• Placement Des Taches D’Un Programme A Structure Arborescente Sur Un Reseau De Processeurs: Synthese De Resultats Recents

Cites work

• A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints
• A state-of-the-art review of parallel-machine scheduling research
• C.P.M. Scheduling with Small Communication Delays and Task Duplication
• scientific article; zbMATH DE number 1003297 (Why is no real title available?)
• scientific article; zbMATH DE number 1016640 (Why is no real title available?)
• scientific article; zbMATH DE number 1142307 (Why is no real title available?)
• Multiprocessor Scheduling with the Aid of Network Flow Algorithms
• Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
• Task scheduling with interprocessor communication delays
• Towards an Architecture-Independent Analysis of Parallel Algorithms
• Tree scheduling with communication delays

Cited in

(9)

• Bounds and approximation for clocked interprocessor communication
• Random allocation of jobs with weights and precedence
• Scheduling problems in a practical allocation model
• Toward an analytical solution to task allocation, processor assignment, and performance evaluation of network processors
• Placement Des Taches D’Un Programme A Structure Arborescente Sur Un Reseau De Processeurs: Synthese De Resultats Recents
• scientific article; zbMATH DE number 1543054 (Why is no real title available?)
• scientific article; zbMATH DE number 2087829 (Why is no real title available?)
• The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders
• Branch-and-bound task allocation with task clustering-based pruning

This page was built for publication: Bounds and algorithms for a practical task allocation model (extended abstract)

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