Static and dynamic processor scheduling disciplines in heterogeneous parallel architectures

DOI10.1006/JPDC.1995.1085MaRDI QIDQ1898192zbMATH OpenOpenAlexFDO

Authors Debanjan Saha, Stella C. da Silva Porto, Virgilio A. F. Almeida, Satish K. Tripathi, D. Menasce

Publication date 26 March 1996

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.1995.1085

zbMATH Keywords

largest task first minimum finish time

Mathematics Subject Classification ID

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

Recommendations

• Scheduling jobs on heterogeneous processors
• scientific article; zbMATH DE number 2135240
• Extremal scheduling of parallel processing with and without real-time constraints
• Dynamic scheduling of parallel computations
• Static assignment of stochastic tasks using majorization

Cited in

(9)

• scientific article; zbMATH DE number 2135240 (Why is no real title available?)
• On the price of heterogeneity in parallel systems
• Parallel Processing and Applied Mathematics
• Static assignment of stochastic tasks using majorization
• Static and dynamic processor allocation for higher-order concurrent languages
• Scheduling with task replication on desktop grids: theoretical and experimental analysis
• Within-Die Variation-Aware Scheduling in Superscalar Processors for Improved Throughput
• Static Instruction Scheduling for High Performance on Limited Hardware
• An empirical study of dynamic scheduling on rings of processors

This page was built for publication: Static and dynamic processor scheduling disciplines in heterogeneous parallel architectures

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