Sciweavers

1691 search results - page 116 / 339
» The Delayed k-Server Problem
Sort
View
IPPS
2000
IEEE
14 years 2 months ago
Gang Scheduling with Memory Considerations
A major problem with time slicing on parallel machines is memory pressure, as the resulting paging activity damages the synchronism among a job’s processes. An alternative is to...
Anat Batat, Dror G. Feitelson
APPINF
2003
13 years 11 months ago
Enhance Features and Performance of a Linux-based Content Switch
In this paper we discuss the problems encountered in the development of a Linux LVS-based content switch and present their solutions. A pre-allocate server scheme is proposed to i...
C. Edward Chow, Chandra Prakash
CN
2000
71views more  CN 2000»
13 years 10 months ago
A reservation protocol for broadcast WDM networks and stability analysis
We consider the problem of coordinating access to the various channels of a single-hop wavelength division multiplexing (WDM) network. We present a high performance reservation (H...
Vijay Sivaraman, George N. Rouskas
ASPDAC
2004
ACM
97views Hardware» more  ASPDAC 2004»
14 years 3 months ago
Interconnect design methods for memory design
- This paper presents a solution to the problem of designing interconnects for memory devices. More precisely, it solves the automatic routing problem of memory peripheral circuits...
Chanseok Hwang, Massoud Pedram
SODA
2004
ACM
91views Algorithms» more  SODA 2004»
13 years 11 months ago
Competitive analysis of organization networks or multicast acknowledgement: how much to wait?
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...
Carlos Brito, Elias Koutsoupias, Shailesh Vaya