Paper Info
Title
Distributed Scheduler of Workflows with Deadlines in a P2P Desktop Grid
Abstract
Scheduling large amounts of tasks in distributed computing platforms composed of millions of nodes is a challenging goal, even more in a fully decentralized way and with low overhead. Thus, we propose a new scalable scheduler for task workflows with deadlines following a completely decentralized architecture. It's built upon a tree-based P2P overlay that supports efficient and fast aggregation of resource availability information. Constraints for deadlines and the correct timing of tasks in workflows are guaranteed with a suitable distributed management of availability time intervals of resources. A local scheduler in each node provides its available time intervals to the distributed global scheduler, which summarizes them in the aggregation process. A two phase reservation protocol looks for suitable resources that comply with workflow structure and deadline. Experimental results, from simulations of a system composed of one million nodes, show scalable fast scheduling with low overhead that can allow a high dynamic usage of computational resources.
Year
DOI
Venue
2010
10.1109/PDP.2010.41
Parallel, Distributed and Network-Based Processing
Keywords
Field
DocType
grid computing,peer-to-peer computing,processor scheduling,P2P desktop grid deadlines,decentralized architecture,distributed computing,distributed global scheduler,distributed management,distributed task workflow scheduler,resource availability information,scalable scheduler,tree-based P2P overlay,two phase reservation protocol,Distributed computing,Large-scale systems,Scheduling
Reservation,Resource management,Grid computing,Computer science,Scheduling (computing),Parallel computing,Workflow,Grid,Distributed management,Distributed computing,Scalability
Conference
ISSN
ISBN
Citations 
1066-6192 E-ISBN : 978-1-4244-5673-4
978-1-4244-5673-4
3
PageRank 
References 
Authors
0.39
8
2
Name
Order
Citations
PageRank
Javier Celaya1363.03
Unai Arronategui2356.92