SIGN IN
SIGN UP
Buffer management for colored packets with deadlines
Full Text:
PDF
Buy this Article
Authors:
Yossi Azar
Microsoft Research and Tel-Aviv University, Tel Aviv, Israel
Uriel Feige
The Weizmann Institute, Rehovot, Israel
Iftah Gamzu
Tel-Aviv University, Tel Aviv, Israel
Thomas Moscibroda
Microsoft Research, Redmond, WA, USA
Prasad Raghavendra
University of Washington, Seattle, WA, USA
2009 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 11
· Downloads (cumulative): 101
· Citation Count: 1
Published in:
· Proceeding
SPAA '09
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Pages 319-327
ACM
New York, NY
, USA
©2009
table of contents
ISBN: 978-1-60558-606-9
doi>
10.1145/1583991.1584068
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SPAA '13
Share:
|
Tags:
algorithms
buffer management
dram scheduling
earliest deadline first
general
online algorithms
packets scheduling
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder