adaptive matchmaking in distributed computing

1
Adaptive Matchmaking in Distributed Computing Koen Bertels, Kamana Sigdel, Behnaz Pour Ebrahimi, Stamatis Vassiliadis,Email:{koen,kamana,behnaz, stamatis}@ce.tudelft.nl Motivation Motivation Computer Engineering Mekelweg 4 (15th floor) 2628 CD Delft The Netherlands Phone: (+31) 15 2783644 Fax : (+31) 15 2784898 http://ce.et.tudelft.nl Associated Problems Associated Problems Meta View of the System Meta View of the System Adaptive Approach Adaptive Approach Consumer attributes => { resource request, job manager, job queue } Producer attributes => { resource report , resource manager, resource context } Matchmaker attributes => { resource list, job list, matchmaking function machmaker list, load balancer } Designing an adaptive and robust mechanism that enables the network to change its internal matchmaking approach from peer to peer to a more centralized form or vice versa whenever it is required. Centralized matchmaking: Low scalability: efficient only in a certain range of population size • Low robustness: - when matchmaker leaves the network/ goes down due to connection failure or overloaded with information Peer to peer: • Low throughput: when there is no interaction between nodes’ neighborhoods Faculty of Electrical Engineering, Mathematics and Computer Science Delft University of Technology Adaptation Issues Adaptation Issues • how, when and who decides to reconfigure the system? • how an individual node becomes a matchmaker? • how to partition the system into segments to balance between jobs and resources? For instance, • when population size of the system grows beyond the capacity of single matchmaker, then adapt to more localized model i.e. partition the system into segment each segment having its own matchmaker when population size of the system adapt to more centralized model i.e. combine the segments to reduce the number of matchmakers Node Attributes Node Attributes Matchmaker Job Leaving/joining system Resource Legends TCP/IP R eq u e s t M a n a g e r R e s o urc e Ma na g er Job M anager O ffer M anager TCP/IP TCP/IP R equ est M a n a g e r Produce r Matchmaker Consumer System Model System Model Adaptation Model Adaptation Model System Level: more matchmakers – when system grows • less matchmakers – when system shrinks Node Level: • producer/consumer => matchmaker • matchmaker => producer/consumer 1 2 3 N-1 N

Upload: findlay-gavin

Post on 02-Jan-2016

25 views

Category:

Documents


1 download

DESCRIPTION

System Model. TCP/IP. Producer. Consumer. TCP/IP. TCP/IP. Matchmaker. mputer Engineering. C. Adaptive Matchmaking in Distributed Computing Koen Bertels, Kamana Sigdel, Behnaz Pour Ebrahimi, Stamatis Vassiliadis, Email: {koen,kamana,behnaz, stamatis}@ce.tudelft.nl. Associated Problems. - PowerPoint PPT Presentation

TRANSCRIPT

Page 1: Adaptive Matchmaking in Distributed Computing

Adaptive Matchmaking in Distributed ComputingKoen Bertels, Kamana Sigdel, Behnaz Pour Ebrahimi, Stamatis Vassiliadis,Email:

{koen,kamana,behnaz, stamatis}@ce.tudelft.nl

MotivationMotivation

Computer Engineering Mekelweg 4 (15th floor)2628 CD Delft The Netherlands Phone: (+31) 15 2783644 Fax : (+31) 15 2784898http://ce.et.tudelft.nl

Associated ProblemsAssociated Problems

Meta View of the SystemMeta View of the System

Adaptive ApproachAdaptive Approach

Consumer attributes => { resource request, job manager, job queue } Producer attributes => { resource report , resource manager, resource context }Matchmaker attributes => { resource list, job list, matchmaking

function machmaker list, load balancer }

Designing an adaptive and robust mechanism that enables the network to change its internal matchmaking approach from peer to peer to a more centralized form or vice versa whenever it is required.

Centralized matchmaking:• Low scalability: efficient only in a certain range of population size• Low robustness: - when matchmaker leaves the network/ goes down due to connection failure or overloaded with information

Peer to peer:• Low throughput: when there is no interaction between nodes’ neighborhoods

Faculty of Electrical Engineering, Mathematics and Computer ScienceDelft University of Technology

Adaptation IssuesAdaptation Issues

• how, when and who decides to reconfigure the system?• how an individual node becomes a matchmaker?• how to partition the system into segments to balance between jobs and resources?

For instance, • when population size of the system grows beyond the capacity of single matchmaker, then adapt to more localized model i.e. partition the system into segment each segment having its own matchmaker

• when population size of the system shrinks, then adapt to more centralized model i.e. combine the segments to reduce the number of matchmakers

Node AttributesNode Attributes

Matchmaker Job

Leaving/joiningsystem

Resource

Legends

TCP/IP

Req

uest

Man

ager

Resou

rce

Man

ager

Job Manager

Offer

Manager

TCP/IP

TCP/IP

Request

Manager

Producer

Matchmaker

Consumer

System ModelSystem Model

Adaptation ModelAdaptation Model

System Level:• more matchmakers – when system grows• less matchmakers – when system shrinks

Node Level:• producer/consumer => matchmaker • matchmaker => producer/consumer

1 2 3 N-1 N…