Advance reservation is important to guarantee the quality of services of jobs by allowing exclusive access to resources over a defined time interval on resources. It is a challenge for the scheduler to organize available resources efficiently and to allocate them for parallel AR jobs with deadline constraint appropriately. This paper provides a slot-based data structure to organize available resources of multiprocessor systems in a way that enables efficient search and update operations, and formulates a suite of scheduling policies to allocate resources for dynamically arriving AR requests. The performance of the scheduling algorithms were investigated by simulations with different job sizes and durations, system loads and scheduling flexibilities. Simulation results show that job sizes and durations, system load and the flexibility of scheduling will impact the performance metrics of all the scheduling algorithms, and the PE-Worst-Fit algorithm becomes the best algorithm for the scheduler with the highest acceptance rate of AR requests, and the jobs with the First-Fit algorithm experience the lowest average slowdown. The data structure and scheduling policies can be used to organize and allocate resources for parallel AR jobs with deadline constraint in large-scale computing systems.
@cite_30: A new priority queue implementation for the future event set problem is described in this article. The new implementation is shown experimentally to be O(1) in queue size for the priority increment distributions recently considered by Jones in his review article. It displays hold times three times shorter than splay trees for a queue size of 10,000 events. The new implementation, called a calendar queue, is a very simple structure of the multiple list variety using a novel solution to the overflow problem.
@cite_14: 
@cite_22: 
@cite_1: With the fast development of the Internet, more and more distributed applications will require guaranteed quality of service and maintain minimum network resource during their running sessions. Reservation in advance provides a solution for the need of reserving the network resource for future use like we make reservations in advance in our daily business. Routing has a critical effect on the network reservation process. In this paper, we propose a hierarchical data structure, the bandwidth tree, which records the intervals of available link bandwidth instead of unit time slot. The storage space and searching time complexity under this data structure are independent of the size of the time slots. This overcomes the difficulty in previously proposed research in which larger time slot size loses routing accuracy while smaller time slot size significantly increases routing complexity. The new data structure significantly improves the running time complexity for routing procedures under a variety of QoS requirements.
@cite_6: Advance reservations are a useful method to allocate resources of various kinds in many different environments. Among others, a major advantage of this kind of reservation is the improved admission probability for requests that are made sufficiently early. In order to implement reliable admission control for these requests, it is important to store information in data structures about future allocations and to provide fast access to the available information. In this paper, two data structures are examined: a tree specially designed to support advance reservations is compared to arrays. Both structures are examined analytically and by measurements in a realistic network management system capable of advance reservations. It turns out that arrays are far better suited to support the required operations, in particular when large time intervals need to be scanned.
@cite_23: 
@cite_2: Limitations of Grid, such as provisioning the dynamic execution environment are handled by virtualization technology. While delivering virtual resources for executing the applications, the user's Quality of Service requirements must be ensured. This QoS management is instrumented with the help of Service Level Agreements that clearly specify the guaranteed QoS, restrictions on resource usage and the penalties associated with the deviant service behavior. To support those demanding QoS, the grid meta-schedulers must be empowered with the capability to discover the required quality, quantity and usage policy satisfied resources as per the requirements of an application. In this paper, we propose a Service Level Agreement based on-demand resource virtualization framework that provides the support for specifying the usage policies, creates and manages the virtual machines over the SLA negotiated resources that are created using either VMWare or Xen. This proposed architecture is integrated with our grid meta-scheduler, CARE Resource Broker as a value addition component. This SLA enabled broker is evaluated with the help of real-time application execution by varying the number of resources available in the test-bed and the number of policies per resource. The results conclude that the inclusion of SLA affects the resource selection behavior of the broker. In addition, the overall performance of the system is increased in terms of job throughput with an extra minimal overhead in request processing due to usage policy matching, while realizing a controlled grid resource sharing environment. These effects that are presented may be useful, while new designs are proposed to take the advantage of SLAs at the meta-scheduler level.
@cite_25: 
@cite_20: This paper studies a flexible scheduling data structure that is used to manage out-of-order service requests in real-time service-oriented architecture (RT-SOA) applications. We propose a hierarchical TBTree (hTBTree) to record server availability across a hierarchy of time intervals with different degrees of time granularity. Real-time services need to find enough time interval in hTBTree for their requested executions. The structure of hTBTree is designed to record only the availability of a resource during a time interval rather than the specific reserved time-slots for each request. It thus will automatically adjust existing reservations within their service intervals to make room for new reservation requests. Simulations have been conducted to study the acceptance ratio and performance of different tree-based data structures. Results show that by allowing flexibility in reservations, hTBTree can accept more real-time service requests compared with other fixed time-slot reservation scheme such as segment tree and the original TBTree. In this way, it also increases the overall system utilization.
Many data structures and scheduling algorithms have been proposed for advance reservations. Most of them are suitable for AR requests with immediate deadlines, and only few of them were specifically designed for AR requests with general deadlines. For AR request with immediate deadlines, such data structure as array @cite_6 , linked-list @cite_22 , trees @cite_1 @cite_6 @cite_20 and queues @cite_30 @cite_14 have already been widely studied. These data structures are primarily used for admission control and focused on finding out whether it's feasible for the scheduler to accept an AR request to start at a definite time and keep on running for a given period. In @cite_14 the author presents a good summary and comparison of them when they are used for single- or multi-processor AR jobs with immediate deadline constraint. However, they are not specifically designed for AR requests with general deadline constraint. Based on existing scheduling theory and algorithms for jobs with or without deadlines, some variants of scheduling algorithms for jobs with advance reservations have been studied in Grid-like systems @cite_25 @cite_23 @cite_2 @cite_20 and their impact on the users and the systems were investigated in terms of turnaround time, slowdown, or utilization.