Scheduling multiprocessor tasks on hypercubes

zbMATH Open0826.68013MaRDI QIDQ1892273FDOQ1892273

Authors: M. Drozdowski 

Publication date: 3 July 1995

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

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

zbMATH Keywords

scheduling algorithmscheduling multiprocessor tasks

Mathematics Subject Classification ID

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

Cited In (11)

• Title not available (Why is that?)
• Scheduling independent jobs on partitionable hypercubes
• Maximizing the throughput of parallel jobs on hypercubes
• Hierarchical scheduling of dynamical parallel computations on hypercube multicomputers
• Scheduling Multipipeline and Multiprocessor Computers
• An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems
• Scheduling multiprocessor tasks on parallel processors with limited availability.
• Scheduling multiprocessor tasks -- An overview
• Scheduling parallel jobs to minimize the makespan
• Distributed processing of divisible jobs with communication startup costs
• A NOTE ON SCHEDULING PARALLEL UNIT JOBS ON HYPERCUBES

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)