Scheduling multiprocessor tasks on hypercubes

MaRDI QIDQ1892273zbMATH OpenFDO

Authors M. Drozdowski

Publication date 3 July 1995

Published in Bulletin of the Polish Academy of Sciences. Technical Sciences (Search for Journal in Brave)

zbMATH Keywords

scheduling algorithmscheduling multiprocessor tasks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Information storage and retrieval of data (68P20)

Recommendations

• Scheduling independent multiprocessor tasks on a uniform k-processor system
• On the complexity of multiprocessor task scheduling
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Scheduling independent multiprocessor tasks
• Scheduling independent multiprocessor tasks

Cited in

(13)

• Scheduling independent jobs on partitionable hypercubes
• Scheduling multiprocessor tasks -- An overview
• Optimal task allocation in hyercube multiprocessor ensembles
• Hierarchical scheduling of dynamical parallel computations on hypercube multicomputers
• Distributed processing of divisible jobs with communication startup costs
• Scheduling multiprocessor tasks on parallel processors with limited availability.
• An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems
• Scheduling Multipipeline and Multiprocessor Computers
• A NOTE ON SCHEDULING PARALLEL UNIT JOBS ON HYPERCUBES
• scientific article; zbMATH DE number 559037 (Why is no real title available?)
• scientific article; zbMATH DE number 1424463 (Why is no real title available?)
• Maximizing the throughput of parallel jobs on hypercubes
• Scheduling parallel jobs to minimize the makespan

This page was built for publication: Scheduling multiprocessor tasks on hypercubes

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