Sciweavers

500 search results - page 55 / 100
» Process Scheduling for the Parallel Desktop
Sort
View
CF
2008
ACM
13 years 11 months ago
Multi-terabit ip lookup using parallel bidirectional pipelines
To meet growing terabit link rates, highly parallel and scalable architectures are needed for IP lookup engines in next generation routers. This paper proposes an SRAM-based multi...
Weirong Jiang, Viktor K. Prasanna
SP
2002
IEEE
147views Security Privacy» more  SP 2002»
13 years 8 months ago
CX: A scalable, robust network for parallel computing
CX, a network-based computational exchange, is presented. The system's design integrates variations of ideas from other researchers, such as work stealing, non-blocking tasks...
Peter R. Cappello, Dimitros Mourloukos
ICPP
1999
IEEE
14 years 1 months ago
Multi-Capacity Bin Packing Algorithms with Applications to Job Scheduling under Multiple Constraints
In past massively parallel processing systems, such as the TMC CM-5 and the CRI T3E, the scheduling problem consisted of allocating a single type of resource among the waiting job...
William Leinberger, George Karypis, Vipin Kumar
MICRO
2003
IEEE
132views Hardware» more  MICRO 2003»
14 years 2 months ago
Checkpoint Processing and Recovery: Towards Scalable Large Instruction Window Processors
Large instruction window processors achieve high performance by exposing large amounts of instruction level parallelism. However, accessing large hardware structures typically req...
Haitham Akkary, Ravi Rajwar, Srikanth T. Srinivasa...
PARELEC
2002
IEEE
14 years 1 months ago
Real-Time Scheduling in Distributed Systems
In this paper, we investigate the worst case performance of Earliest Due Date algorithm when applied to packet scheduling in distributed systems. We assume that the processing ele...
Nguyen Duc Thai