IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v35y2018i03ns0217595918500136.html
   My bibliography  Save this article

An Optimal Preemptive Algorithm for Online MapReduce Scheduling on Two Parallel Machines

Author

Listed:
  • Yiwei Jiang

    (School of Management and E-Business, Contemporary Business and Trade Research Center, Zhejiang Gongshang University, Hangzhou 310018, P. R. China)

  • Wei Zhou

    (Department of Mathematics, Zhejiang Sci-Tech University, Hangzhou 310018, P. R. China)

  • Ping Zhou

    (College of Humanities, Zhejiang Business College, Hangzhou 310053, P. R. China)

Abstract

In this paper, we study an online scheduling on two parallel machines in MapReduce-like system where each job contains two kinds of tasks: map tasks and reduce tasks. A job’s reduce tasks can only be processed after all its map tasks are finished. We assume that the map tasks are fractional and the reduce tasks are preemptive. Our objective is to minimize makespan. We show that the lower bound for this MapReduce scheduling problem is 2. We then present an online algorithm with competitive ratio of 2 and thus it is optimal.

Suggested Citation

  • Yiwei Jiang & Wei Zhou & Ping Zhou, 2018. "An Optimal Preemptive Algorithm for Online MapReduce Scheduling on Two Parallel Machines," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(03), pages 1-11, June.
    • Handle: RePEc:wsi:apjorx:v:35:y:2018:i:03:n:s0217595918500136
    DOI: 10.1142/S0217595918500136
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595918500136
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595918500136?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Cong Chen & Yinfeng Xu & Yuqing Zhu & Chengyu Sun, 2017. "Online MapReduce scheduling problem of minimizing the makespan," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 590-608, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yiwei Jiang & Ping Zhou & Wei Zhou, 2019. "MapReduce machine covering problem on a small number of machines," Journal of Combinatorial Optimization, Springer, vol. 38(4), pages 1066-1076, November.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yiwei Jiang & Ping Zhou & Wei Zhou, 2019. "MapReduce machine covering problem on a small number of machines," Journal of Combinatorial Optimization, Springer, vol. 38(4), pages 1066-1076, November.
    2. Jidan Huang & Feifeng Zheng & Yinfeng Xu & Ming Liu, 2018. "Online MapReduce processing on two identical parallel machines," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 216-223, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:apjorx:v:35:y:2018:i:03:n:s0217595918500136. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.