About | Contact Us | Register | Login
ProceedingsSeriesJournalsSearchEAI
9th EAI International Conference on Performance Evaluation Methodologies and Tools

Research Article

Analysis of Rate-Based Pull and Push Strategies with Limited Migration Rates in Large Distributed Networks

Cite
BibTeX Plain Text
  • @INPROCEEDINGS{10.4108/eai.14-12-2015.2262564,
        author={Wouter Minnebo and Benny Van Houdt},
        title={Analysis of Rate-Based Pull and Push Strategies with Limited Migration Rates in Large Distributed Networks},
        proceedings={9th EAI International Conference on Performance Evaluation Methodologies and Tools},
        publisher={ACM},
        proceedings_a={VALUETOOLS},
        year={2016},
        month={1},
        keywords={distributed computing performance analysis processor scheduling},
        doi={10.4108/eai.14-12-2015.2262564}
    }
    
  • Wouter Minnebo
    Benny Van Houdt
    Year: 2016
    Analysis of Rate-Based Pull and Push Strategies with Limited Migration Rates in Large Distributed Networks
    VALUETOOLS
    ICST
    DOI: 10.4108/eai.14-12-2015.2262564
Wouter Minnebo1, Benny Van Houdt1,*
  • 1: University of Antwerp
*Contact email: benny.vanhoudt@uantwerpen.be

Abstract

In this paper we analyze the performance of pull and push strategies in large homogeneous distributed systems where the number of job transfers per time unit is limited. Job transfer strategies which rely on lightly-loaded servers to attract jobs from heavily-loaded servers are known as pull strategies, whereas for push strategies the heavily loaded servers initiate the job transfers to lightly loaded servers. To this end, servers transmit probe messages to discover other servers that are able to take part in a job transfer. Previous work on rate-based pull and push strategies focused on the impact of the probe rate on the mean job response time. In this paper we also limit the overall migration rate and show that any predefined migration rate can be matched by both the rate-based pull and push strategies. We present closed form formulas for the mean response time (as a function of the allowed probe and migration rate) and validate their accuracy by simulation. We also introduce and analyze a new pull strategy and show that under high loads it is superior to the push strategies considered, while the push strategies offer only a very limited gain for medium to low load scenarios.

Keywords
distributed computing performance analysis processor scheduling
Published
2016-01-04
Publisher
ACM
http://dx.doi.org/10.4108/eai.14-12-2015.2262564
Copyright © 2015–2025 ICST
EBSCOProQuestDBLPDOAJPortico
EAI Logo

About EAI

  • Who We Are
  • Leadership
  • Research Areas
  • Partners
  • Media Center

Community

  • Membership
  • Conference
  • Recognition
  • Sponsor Us

Publish with EAI

  • Publishing
  • Journals
  • Proceedings
  • Books
  • EUDL