Enhancing self-scheduling algorithms via synchronization and weighting

DOI10.1016/J.JPDC.2007.07.003zbMATH Open1243.68102OpenAlexW2121188877MaRDI QIDQ436689FDOQ436689

Authors: Florina M. Ciorba, Ioannis Riakiotakis, Theodore Andronikos, George Papakonstantinou, Anthony T. Chronopoulos 

Publication date: 26 July 2012

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

Full work available at URL: https://doi.org/10.1016/j.jpdc.2007.07.003

Recommendations

• Scheduling in synchronous networks and the greedy algorithm
• Coordination mechanisms for selfish scheduling
• Scheduling self-suspending tasks: new and old results
• Synchronized sweep algorithms for scalable scheduling constraints
• On synthesis of scheduling algorithms
• A self-modifiable approach to scheduling and mapping algorithms in multiprocessor systems

zbMATH Keywords

synchronizationweightingdynamic load balancing algorithmsloops with dependenciesnon-dedicated heterogeneous systems

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Queueing network models for load balancing in distributed systems
• Allocating Independent Subtasks on Parallel Processors
• Load sharing with consideration of future task arrivals in heterogeneous distributed real-time systems
• Dynamic scheduling for dependence loops on heterogeneous clusters

Cited In (1)

• Automated Analysis of Impact of Scheduling on Performance of Self-stabilizing Protocols

This page was built for publication: Enhancing self-scheduling algorithms via synchronization and weighting

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