Resource scheduling for parallel database and scientific applications

Soumen Chakrabarti, S. Muthukrishnan

    Research output: Contribution to conferencePaper

    Abstract

    Scheduling problems that are critical and prevalent in practical parallel computing are computed. A polynomial time makespan algorithm that produces a schedule of length O(V+Φ log T), which is therefore an O(log T) approximation is presented to solve these problems. The makespan algorithm can be extended to minimize the weighted average completion time over all the jobs to the same approximation factor of O(log T).

    Original languageEnglish (US)
    Pages329-335
    Number of pages7
    DOIs
    StatePublished - 1996
    EventProceedings of the 1996 8th Annual ACM Symposium on Parallel Algorithms and Architectures - Padua, Italy
    Duration: Jun 24 1996Jun 26 1996

    Other

    OtherProceedings of the 1996 8th Annual ACM Symposium on Parallel Algorithms and Architectures
    CityPadua, Italy
    Period6/24/966/26/96

    ASJC Scopus subject areas

    • Software
    • Safety, Risk, Reliability and Quality

    Fingerprint Dive into the research topics of 'Resource scheduling for parallel database and scientific applications'. Together they form a unique fingerprint.

  • Cite this

    Chakrabarti, S., & Muthukrishnan, S. (1996). Resource scheduling for parallel database and scientific applications. 329-335. Paper presented at Proceedings of the 1996 8th Annual ACM Symposium on Parallel Algorithms and Architectures, Padua, Italy, . https://doi.org/10.1145/237502.237577