Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
6
search results - page 2 / 2
»
Verifying a Structured Peer-to-Peer Overlay Network: The Sta...
Sort
relevance
views
votes
recent
update
View
thumb
title
18
click to vote
HIPC
2007
Springer
207
views
Distributed And Parallel Com...
»
more
HIPC 2007
»
Accomplishing Approximate FCFS Fairness Without Queues
13 years 8 months ago
Download
sdm.lbl.gov
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
claim paper
Read More »
« Prev
« First
page 2 / 2
Last »
Next »