Online set packing and competitive scheduling of multipart tasks

Yuval Emek; Magnús M. Halldórsson; Yishay Mansour; Boaz Patt-Shamir; Jaikumar Radhakrishnan; D. Rawitz

Online set packing and competitive scheduling of multipart tasks

Yuval Emek, Magnús M. Halldórsson, Yishay Mansour, Boaz Patt-Shamir, Jaikumar Radhakrishnan, D. Rawitz

Bar-Ilan University - The Alexander Kofkin Faculty of Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We consider a scenario where large data frames are broken into a few packets and transmitted over the network. Our focus is on a bottleneck router: the model assumes that in each time step, a set of packets (a burst) arrives, from which only one packet can be served, and all other packets are lost. A data frame is considered useful only if none of its constituent packets is lost, and otherwise it is worthless. We abstract the problem as a new type of online set packing, present a randomized distributed algorithm and a matching lower bound on the competitive ratio for any randomized online algorithm. Our bounds are expressed in terms of the maximal burst size and the maximal number of packets per frame. We also present refined bounds that depend on the uniformity of these parameters.

Original language	American English
Title of host publication	PODC '10 Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Publisher	ACM
State	Published - 2010

Bibliographical note

Place of conference:Switzerland

Cite this

@inproceedings{69574e2d55e34b49b711297cdfba69ca,

title = "Online set packing and competitive scheduling of multipart tasks",

abstract = "We consider a scenario where large data frames are broken into a few packets and transmitted over the network. Our focus is on a bottleneck router: the model assumes that in each time step, a set of packets (a burst) arrives, from which only one packet can be served, and all other packets are lost. A data frame is considered useful only if none of its constituent packets is lost, and otherwise it is worthless. We abstract the problem as a new type of online set packing, present a randomized distributed algorithm and a matching lower bound on the competitive ratio for any randomized online algorithm. Our bounds are expressed in terms of the maximal burst size and the maximal number of packets per frame. We also present refined bounds that depend on the uniformity of these parameters.",

author = "Yuval Emek and Halld{\'o}rsson, {Magn{\'u}s M.} and Yishay Mansour and Boaz Patt-Shamir and Jaikumar Radhakrishnan and D. Rawitz",

note = "Place of conference:Switzerland",

year = "2010",

language = "American English",

booktitle = "PODC '10 Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing",

publisher = "ACM",

}

TY - GEN

T1 - Online set packing and competitive scheduling of multipart tasks

AU - Emek, Yuval

AU - Halldórsson, Magnús M.

AU - Mansour, Yishay

AU - Patt-Shamir, Boaz

AU - Radhakrishnan, Jaikumar

AU - Rawitz, D.

N1 - Place of conference:Switzerland

PY - 2010

Y1 - 2010

N2 - We consider a scenario where large data frames are broken into a few packets and transmitted over the network. Our focus is on a bottleneck router: the model assumes that in each time step, a set of packets (a burst) arrives, from which only one packet can be served, and all other packets are lost. A data frame is considered useful only if none of its constituent packets is lost, and otherwise it is worthless. We abstract the problem as a new type of online set packing, present a randomized distributed algorithm and a matching lower bound on the competitive ratio for any randomized online algorithm. Our bounds are expressed in terms of the maximal burst size and the maximal number of packets per frame. We also present refined bounds that depend on the uniformity of these parameters.

AB - We consider a scenario where large data frames are broken into a few packets and transmitted over the network. Our focus is on a bottleneck router: the model assumes that in each time step, a set of packets (a burst) arrives, from which only one packet can be served, and all other packets are lost. A data frame is considered useful only if none of its constituent packets is lost, and otherwise it is worthless. We abstract the problem as a new type of online set packing, present a randomized distributed algorithm and a matching lower bound on the competitive ratio for any randomized online algorithm. Our bounds are expressed in terms of the maximal burst size and the maximal number of packets per frame. We also present refined bounds that depend on the uniformity of these parameters.

UR - https://scholar.google.co.il/scholar?q=Online+set+packing+and+competitive+scheduling+of+multipart+tasks&btnG=&hl=en&as_sdt=0%2C5

M3 - Conference contribution

BT - PODC '10 Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

PB - ACM

ER -

Online set packing and competitive scheduling of multipart tasks

Abstract

Bibliographical note

Other files and links

Fingerprint

Cite this