Sciweavers

483 search results - page 95 / 97
» Timing Games and Shared Memory
Sort
View
INFOCOM
2006
IEEE
14 years 2 months ago
Routers with Very Small Buffers
Abstract— Internet routers require buffers to hold packets during times of congestion. The buffers need to be fast, and so ideally they should be small enough to use fast memory ...
Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Ni...
CONCUR
2005
Springer
14 years 2 months ago
Concurrent Clustered Programming
d Abstract) Vijay Saraswat1 and Radha Jagadeesan2 1 IBM T.J. Watson Research Lab 2 School of CTI, DePaul University Abstract. We present the concurrency and distribution primitives...
Vijay A. Saraswat, Radha Jagadeesan
MSS
2003
IEEE
151views Hardware» more  MSS 2003»
14 years 1 months ago
Accurate Modeling of Cache Replacement Policies in a Data Grid
Caching techniques have been used to improve the performance gap of storage hierarchies in computing systems. In data intensive applications that access large data files over wid...
Ekow J. Otoo, Arie Shoshani
VISUALIZATION
2000
IEEE
14 years 28 days ago
FastSplats: optimized splatting on rectilinear grids
Splatting is widely applied in many areas, including volume, point-based, and image-based rendering. Improvements to splatting, such as eliminating popping and color bleeding, occ...
Jian Huang, Roger Crawfis, Naeem Shareef, Klaus Mu...
ESA
1999
Springer
105views Algorithms» more  ESA 1999»
14 years 25 days ago
Provably Good and Practical Strategies for Non-Uniform Data Management in Networks
This paper deals with the on-line allocation of shared data objects to the local memory modules of the nodes in a network. We assume that the data is organized in indivisible objec...
Friedhelm Meyer auf der Heide, Berthold Vöcki...