Corpus ID: 17139089

Enhanced Red-Black-Tree Data Structure for Facilitating the Scheduling of Reservations

  title={Enhanced Red-Black-Tree Data Structure for Facilitating the Scheduling of Reservations},
  author={Marcos Dias de Assunç{\~a}o},
  • Marcos Dias de Assunção
  • Published 2015
  • Computer Science
  • ArXiv
  • This paper details a data structure for managing and scheduling requests for computing resources of clusters and virtualised infrastructure such as private clouds. The data structure uses a red-black tree whose nodes represent the start times and/or completion times of requests. The tree is enhanced by a double-linked list that facilitates the iteration of nodes once the start time of a request is determined by using the tree. We describe the data structure main features, provide an example of… CONTINUE READING

    Figures and Topics from this paper.


    Publications referenced by this paper.
    Above the Clouds: A Berkeley View of Cloud Computing
    • 6,707
    • PDF
    GarQ: An efficient scheduling data structure for advance reservations of grid resources
    • 28
    • PDF
    Analysis of data structures for admission control of advance reservation requests
    • 43
    • PDF
    Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling
    • 664
    • Highly Influential
    • PDF
    Evaluating the cost-benefit of using cloud computing to extend the capacity of clusters
    • 371
    • PDF
    Core Algorithms of the Maui Scheduler
    • 409
    Multiple-Queue Backfilling Scheduling with Priorities and Reservations for Parallel Systems
    • 77
    • PDF
    The ANL/IBM SP Scheduling System
    • 538
    • PDF