• DocumentCode
    2788460
  • Title

    Competitive Analysis of Partitioned Scheduling on Uniform Multiprocessors

  • Author

    Andersson, Björn ; Tovar, Eduardo

  • Author_Institution
    IPP Hurray Res Group, Polytech. Inst. of Porto
  • fYear
    2007
  • fDate
    26-30 March 2007
  • Firstpage
    1
  • Lastpage
    8
  • Abstract
    Consider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed Sp. Tasks can be preempted but they cannot migrate between processors. We propose an algorithm which can schedule all task sets that any other possible algorithm can schedule assuming that our algorithm is given processors that are three times faster.
  • Keywords
    multiprocessing systems; processor scheduling; competitive analysis; partitioned scheduling; uniform multiprocessor; Algorithm design and analysis; Costs; Job design; Measurement; Multiprocessing systems; Partitioning algorithms; Processor scheduling; Resumes; Runtime; Scheduling algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel and Distributed Processing Symposium, 2007. IPDPS 2007. IEEE International
  • Conference_Location
    Long Beach, CA
  • Print_ISBN
    1-4244-0910-1
  • Electronic_ISBN
    1-4244-0910-1
  • Type

    conf

  • DOI
    10.1109/IPDPS.2007.370337
  • Filename
    4228065
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2788460