Analysis of data structures for admission control of advance reservation requests

Burchard, L.-O.

doi:10.1109/tkde.2005.40

Cited by 33 publications

(16 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, resource providers built on top of existing LRMSs can Most of the approaches (e.g. Burchard 2005;Sulistio et al 2007;Brodnik and Nilsson 2003) limit information about slots to a number of available computing resources (usually processors or computing nodes) skipping the knowledge about concrete identifiers of these resources. In other words, they assume that for a certain task which requires m processors, if in subsequent slots at least m processors are available, then the task can be executed.…”

Section: Dynamic Binding Of Reserved Resourcesmentioning

confidence: 99%

See 1 more Smart Citation

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

Section: Dynamic Binding Of Reserved Resourcesmentioning

confidence: 99%

“…Several approaches to manage ARs were proposed to date (Burchard 2005;Sulistio et al 2008;Brodnik and Nilsson 2003). However, these methods have disadvantages that prevented us from using them directly for our purpose.…”

Section: Data Structure For Storing Arsmentioning

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

“…On the other hand, the total data size increases dramatically especially for a large network with many reservations committed. There have been several studies analyzing data structures for network routing with advance reservation [21], [22], [23]. Further, we need an effective methodology which we can also benefit in calculating static snapshot graphs G(t w ), during maximum bandwidth calculation and time window evaluation.…”

Section: B Examining Time Windowsmentioning

confidence: 99%

A Flexible Reservation Algorithm for Advance Network Provisioning

Balman

Chaniotakisy

Shoshani

et al. 2010

2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis

View full text Add to dashboard Cite

Abstract-Many scientific applications need support from a communication infrastructure that provides predictable performance, which requires effective algorithms for bandwidth reservations. Network reservation systems such as ESnet's OSCARS, establish guaranteed bandwidth of secure virtual circuits for a certain bandwidth and length of time. However, users currently cannot inquire about bandwidth availability, nor have alternative suggestions when reservation requests fail. In general, the number of reservation options is exponential with the number of nodes n, and current reservation commitments. We present a novel approach for path finding in time-dependent networks taking advantage of user-provided parameters of total volume and time constraints, which produces options for earliest completion and shortest duration. The theoretical complexity is only O(n 2 r 2 ) in the worst-case, where r is the number of reservations in the desired time interval. We have implemented our algorithm and developed efficient methodologies for incorporation into network reservation frameworks. Performance measurements confirm the theoretical predictions.

show abstract

“…Therefore, the runtime performance of the algorithm can be easily adjusted with the time slot width ∆t. Furthermore, an array can be used as a ring buffer data structure to manage the time slots [19]. The size of the array depends only on the maximum allowed book-ahead timet book−ahead .…”

Section: Slotted Timementioning

confidence: 99%

“…Burchard [19] compared the approach to manage the free blocks in a tree with the slotted time model and concluded that the slotted time models outperform Figure 5. In the simulated cluster, the list based approach is always better then the best slotted time configuration in respect to the success rate and the runtime.…”

Section: Related Workmentioning

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

Analysis of data structures for admission control of advance reservation requests

Cited by 33 publications

References 16 publications

Hierarchical scheduling strategies for parallel tasks and advance reservations in grids

Hierarchical scheduling strategies for parallel tasks and advance reservations in grids

A Flexible Reservation Algorithm for Advance Network Provisioning

Efficiently Managing Advance Reservations Using Lists of Free Blocks

Contact Info

Product

Resources

About