On multiprocessor system scheduling

DOI10.1023/A:1009790611712MaRDI QIDQ1383800zbMATH OpenOpenAlexFDO

Authors Xiaotie Deng, P. Dymond

Publication date 1998

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1009790611712

zbMATH Keywords

average completion timedata dependency relation graphs of programs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Scheduling independent multiprocessor tasks
• Scheduling independent multiprocessor tasks
• Scheduling tree dags on parallel architectures
• Task scheduling with and without communication delays: A unified approach

Cited in

(16)

• Using basis dependence distance vectors in the modified Floyd-Warshall algorithm
• Multi-processor scheduling and expanders
• scientific article; zbMATH DE number 3885635 (Why is no real title available?)
• On mapping production systems onto multiprocessors
• Thread scheduling for multiprogrammed multiprocessors
• scientific article; zbMATH DE number 871904 (Why is no real title available?)
• scientific article; zbMATH DE number 2090585 (Why is no real title available?)
• Scheduling multiprocessor tasks on three dedicated processors
• Improved results for scheduling batched parallel jobs by using a generalized analysis framework
• Greedy multiprocessor server scheduling
• Special issue on multiprocessor and mixed-criticality scheduling
• Scheduling in the dark
• Multiprocessor scheduling and combinatorial configurations
• Federated scheduling admits no constant speedup factors for constrained-deadline DAG task systems
• Guest editorial: Multiprocessor scheduling
• Scheduling master-slave multiprocessor systems

This page was built for publication: On multiprocessor system scheduling

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