Scheduling mixed-parallel applications with advance reservations

Aida, Kô; Casanova, Henri

doi:10.1145/1383422.1383432

Cited by 38 publications

(15 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The selected workload is one of the commonly used workloads by researchers, e.g. in Aida andCasanova (2009), Feitelson (2008), or Iosup et al (2008). Then, in Sect.…”

Section: Resultsmentioning

confidence: 99%

Hierarchical scheduling strategies for parallel tasks and advance reservations in grids

Kurowski

Oleksiak

Piątek

et al. 2011

J Sched

View full text Add to dashboard Cite

Recently, the advance reservation functionality gained high importance in grids due to increasing popularity of modern applications that require interactive tasks, co-allocation of multiple resources, and performance guarantees. However, simultaneous scheduling, both advance reservations and batch tasks affects the performance. Advance reservations significantly deteriorate flow time of batch tasks and the overall resource utilization, especially in hierarchical scheduling structures. This is a consequence of unknown batch task processing times and the lack of possibility of altering allocations of advance reservations. To address these issues we present a common model for scheduling both computational batch tasks and tasks with advance reservation requests. We propose simple on-line scheduling policies and generic advices that reduce negative impact of advance reservations on a schedule quality. We also propose novel data structures and algorithms for efficient scheduling of advance reservations. A comprehensive experimental analysis is presented to show the influence of advance reservations on resource utilization, mean flow time, and mean tardiness-the criteria significant for administrators, users submitting batch tasks, and users requesting advance reservations, respectively. All experiments were performed with a well-known real workload using the GSSIM simulator.

show abstract

“…The selected workload is one of the commonly used workloads by researchers, e.g. in Aida andCasanova (2009), Feitelson (2008), or Iosup et al (2008). Then, in Sect.…”

Section: Resultsmentioning

confidence: 99%

Hierarchical scheduling strategies for parallel tasks and advance reservations in grids

Kurowski

Oleksiak

Piątek

et al. 2011

J Sched

View full text Add to dashboard Cite

show abstract

“…The synthetic workload was generated with Feitelson's workload generator for batch systems [20]. The advance reservation aspects were added like discussed by Aida and Casanova [21] which based their analysis on the Grid Workloads Archive 4 and the traces of the French Grid5000 test bed 5 . This workload was then processed using time-exclusive lists and slotted time.…”

Section: Discussionmentioning

confidence: 99%

Efficiently Managing Advance Reservations Using Lists of Free Blocks

Schneider

Linnert

2011

2011 23rd International Symposium on Computer Architecture and High Performance Computing

View full text Add to dashboard Cite

Advance reservation was identified as a key technology to enable guaranteed Quality of Service and co-allocation in the Grid. Nonetheless, most Grid and local resource management systems still use the queuing approach because of the additional complexity introduced by advance reservation. A planning based resource management system has to keep track of the reservations in the future and needs a good overview on the available capacity during the negotiation of incoming reservations. For advance reservation, the resource management problem becomes a two dimensional problem. In this paper different data structures are investigated and discussed in order to fit to planning based resource management. As a result the benefits of using lists of resource allocation or free blocks are exposed. This general idea widely used to manage continuous resources is extended to cover not only the resource dimension but also the time dimension. The list of blocks approach is evaluated in a Grid level and a resource level resource management system. The extensive simulations showed a better runtime and higher reservation success rate compared with the currently favored approach of a slotted time.

show abstract

“…Kento Aida et al [14] have investigated the scheduling of mixedparallel applications, which exhibit task and data parallelism, in advance reservations settings. They have defined two scheduling problems, RESSCHED and RESSCHEDDL, depending on whether the goal is to minimize application turn around-time or to meet a deadline, respectively.…”

Section: Related Workmentioning

confidence: 99%

Performance Enhancement of Distributed System through Load Balancing and Task Scheduling

Abhijit¹,

Sulabha²

2018

IJCA

View full text Add to dashboard Cite

Task scheduling & load balancing in distributed network are the most challenging research area in computer science. In distributed systems, scheduling mechanism has more issues as there is no centralized authority to allocate the workload among multiple processors. Further, handling both load balancing and scheduling at hand is a daunting task. In this paper, we propose a fuzzy based load balancing and task scheduling technique to optimize the performance of distributed system. Initially, clusters are formed and node with larger buffer availability and high CPU speed is elected as cluster head. Tasks are prioritized into flexible and non-flexible using task prioritizing strategy. Non-Flexible tasks are prioritized over flexible tasks. For non-flexible tasks, essential information of nodes such as CPU speed, work load and distance from cluster head are made pass through the fuzzy system. Node state is obtained as output. Based on states of node, non-flexible tasks are allocated. Our technique dynamically handles scheduling and load balancing at hand. We use simulation results to prove efficiency of our technique.

show abstract

Scheduling mixed-parallel applications with advance reservations

Cited by 38 publications

References 41 publications

Hierarchical scheduling strategies for parallel tasks and advance reservations in grids

Hierarchical scheduling strategies for parallel tasks and advance reservations in grids

Efficiently Managing Advance Reservations Using Lists of Free Blocks

Performance Enhancement of Distributed System through Load Balancing and Task Scheduling

Contact Info

Product

Resources

About