Work-competitive scheduling on task dependency graphs

DOI10.1142/S0129626415500012zbMATH Open1376.68031OpenAlexW2266945376MaRDI QIDQ4598901FDOQ4598901

Authors: Chadi Kari, Alexander Russell, Narasimha Shashidhar 

Publication date: 15 December 2017

Published in: Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129626415500012

Recommendations

• Work-competitive scheduling for cooperative computing with dynamic groups
• Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups
• A robust randomized algorithm to perform independent tasks
• Optimal on-line scheduling of parallel jobs with dependencies
• Optimal parallel processing of random task graphs

zbMATH Keywords

online algorithmsdistributed computingrandomized algorithmscompetitive analysispartitionable networks

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Randomized algorithms (68W20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)

Cited In (5)

• Scheduling of independent jobs in star graph networks
• Toward maximizing the quality of results of dependent tasks computed unreliably
• Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups
• Work-competitive scheduling for cooperative computing with dynamic groups
• Title not available (Why is that?)

This page was built for publication: Work-competitive scheduling on task dependency graphs

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