IDEAS home Printed from https://ideas.repec.org/a/wly/intnem/v26y2016i3p224-244.html
   My bibliography  Save this article

ROUTE: run‐time robust reducer workload estimation for MapReduce

Author

Listed:
  • Zhihong Liu
  • Qi Zhang
  • Raouf Boutaba
  • Yaping Liu
  • Zhenghu Gong

Abstract

MapReduce has become a popular model for large‐scale data processing in recent years. Many works on MapReduce scheduling (e.g., load balancing and deadline‐aware scheduling) have emphasized the importance of predicting workload received by individual reducers. However, because the input characteristics and user‐specified map function of a given job are unknown to the MapReduce framework before the job starts, accurately predicting workload of reducers can be a difficult challenge. To address this challenge, we present ROUTE, a run‐time robust reducer workload estimation technique for MapReduce. ROUTE progressively samples the partition size of the early completed mappers, allowing ROUTE to perform estimation at run time yet fulfilling the accuracy requirement specified by users. Moreover, by using robust estimation and bootstrapping resampling techniques, ROUTE can achieve high applicability to a wide variety of applications. Through experiments using both real and synthetic data on an 11‐node Hadoop cluster, we show ROUTE can achieve high accuracy with error rate no more than 10.92% and an improvement of 40.6% in terms of error rate while compared with the state‐of‐the‐art solution. Besides, through simulations using synthetic data, we show that ROUTE is robust to a variety of skewed distributions. Finally, we apply ROUTE to existing load balancing and deadline‐aware scheduling frameworks and show ROUTE significantly improves the performance of these frameworks. Copyright © 2016 John Wiley & Sons, Ltd.

Suggested Citation

  • Zhihong Liu & Qi Zhang & Raouf Boutaba & Yaping Liu & Zhenghu Gong, 2016. "ROUTE: run‐time robust reducer workload estimation for MapReduce," International Journal of Network Management, John Wiley & Sons, vol. 26(3), pages 224-244, May.
  • Handle: RePEc:wly:intnem:v:26:y:2016:i:3:p:224-244
    DOI: 10.1002/nem.1928
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nem.1928
    Download Restriction: no

    File URL: https://libkey.io/10.1002/nem.1928?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
    ---><---

    References listed on IDEAS

    as
    1. Hall, Peter & Padmanabhan, A. R., 1992. "On the bootstrap and the trimmed mean," Journal of Multivariate Analysis, Elsevier, vol. 41(1), pages 132-153, April.
    Full references (including those not matched with items on IDEAS)

    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. Rand Wilcox, 2001. "Pairwise comparisons of trimmed means for two or more groups," Psychometrika, Springer;The Psychometric Society, vol. 66(3), pages 343-356, September.
    2. Zhiqiang Chen & Evarist Giné, 2004. "Another approach to asymptotics and bootstrap of randomly trimmed means," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 56(4), pages 771-790, December.

    More about this item

    Statistics

    Access and download statistics

    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:wly:intnem:v:26:y:2016:i:3:p:224-244. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1099-1190 .

    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.