Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

34

PE
2007
Springer

favoriteEmaildiscussreport

112views Optimization» more PE 2007»

Scheduling in polling systems

13 years 10 months ago

Scheduling in polling systems

Download www.cs.caltech.edu

We present a simple mean value analysis (MVA) framework for analyzing the eﬀect of scheduling within queues in classical asymmetric polling systems with gated or exhaustive service. Scheduling in polling systems ﬁnds many applications in computer and communication systems. Our framework leads not only to uniﬁcation but also to extension of the literature studying scheduling in polling systems. It illustrates that a large class of scheduling policies behaves similarly in the exhaustive polling model and the standard M/GI/1 model, whereas scheduling policies in the

Adam Wierman, Erik M. M. Winands, Onno J. Boxma

Real-time Traffic

Classical Asymmetric Polling | Optimization | PE 2007 | Polling Systems | Simple Mean Value |

claim paper

Related Content

» Joint garbage collection and hard realtime scheduling

» Fair and timely scheduling via cooperative polling

» On polling systems with large setups

» CommunicationIntensive Parallel Applications and Nondedicated Clusters of Workstations

» SchedulingBased Coordination Function SCF in WLANs for High Throughput

» Mgated Scheduling in Wireless Networks Performance and Crosslayer Design

» System F with WidthSubtyping and Record Updating

» Differentiated Priority Scheduling and Adaptive Segmentation for Bluetooth Piconets

» Providing Delay Guarantees in Bluetooth

Post Info
More Details (n/a)

Added	27 Dec 2010
Updated	27 Dec 2010
Type	Journal
Year	2007
Where	PE
Authors	Adam Wierman, Erik M. M. Winands, Onno J. Boxma

Comments (0)