This paper evaluates the performance of online scheduling for the objective of minimizing the flow time plus energy usage under dynamic speed scaling model and using arbitrary power function in data centers. An algorithm (Jyoti Algorithm) JAlg(sRPT, P∼∗((3Aj/ 2) + (1/ 8)2A)) is proposed which uses Shortest Remaining Processing Time (SRPT) for scheduling jobs and processes jobs at speed such that the consumed power depends on the queue length (i.e. number of active jobs), rather than the remaining work of active jobs. It is applicable in both the settings: clairvoyant and nonclairvoyant. The amortized potential function analysis is used to calculate the competitive ratio of JAlg. The competitive ratio of JAlg is (41/16) against an optimal offline adversary.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Processing jobs using speed-scaling function to minimize flow-time plus energy in data centers


    Contributors:


    Publication date :

    2017-04-01


    Size :

    268752 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Scheduling Equal Processing Time Jobs to Minimize the Weighted Number of Late Jobs

    Brucker, P. / Kravchenko, S. A. | British Library Online Contents | 2006




    Predictive Flow Control to Minimize Convective Time Delays

    Fagley, Casey P. / Porter, Christopher O. / McLaughlin, Thomas E. | AIAA | 2013


    Special trucks speed patch jobs

    Burt, E.A. | Engineering Index Backfile | 1949