Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Multiprocessor Scheduling in Processorbased Router Platforms: Issues and Ideas #
 

Summary: Multiprocessor Scheduling in Processor­based Router
Platforms: Issues and Ideas #
Anand Srinivasan, Philip Holman, James Anderson, Sanjoy Baruah, and Jasleen Kaur
Department of Computer Science, University of North Carolina at Chapel Hill
E­mail: {anands,holman,anderson,baruah,jasleen}@cs.unc.edu
Abstract
Two important trends are expected to guide the de­
sign of next­generation networks. First, with the com­
mercialization of the Internet, providers will use value­
added services to di#erentiate their service o#erings
from other providers; many services require the use
of sophisticated resource scheduling mechanisms in
routers. Second, to enable extensibility and the deploy­
ment of new services in a rapid and cost­e#ective man­
ner, routers will be instantiated using programmable
network processors. Our research objective is to de­
velop sophisticated multiprocessor scheduling mecha­
nisms that would enable networks that deploy such
router platforms to provide service guarantees to ap­
plications. In this paper, we make two contributions.

  

Source: Anderson, James - Department of Computer Science, University of North Carolina at Chapel Hill

 

Collections: Computer Technologies and Information Sciences