Gang scheduling performance benefits for fine-grain synchronization

DOI10.1016/0743-7315(92)90014-EzbMath0786.68012MaRDI QIDQ1208579

Larry Rudolph, Dror G. Feitelson

Publication date: 16 May 1993

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

zbMATH Keywords

schedulingfine-grain parallel programsmultiprogrammed multiprocessors

Mathematics Subject Classification ID

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

Related Items (5)

Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors ⋮ Distributed processing of divisible jobs with communication startup costs ⋮ Scheduling multiprocessor tasks -- An overview ⋮ Analysis techniques for supporting hard real-time sporadic gang task systems ⋮ EFFICIENT PARALLEL JOB SCHEDULING USING GANG SERVICE

This page was built for publication: Gang scheduling performance benefits for fine-grain synchronization