Sciweavers

11 search results - page 1 / 3
» OPT versus LOAD in dynamic storage allocation
Sort
View
STOC
2003
ACM
72views Algorithms» more  STOC 2003»
14 years 5 months ago
OPT versus LOAD in dynamic storage allocation
Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyo...
FGCS
2006
121views more  FGCS 2006»
13 years 4 months ago
Real-time multi-scale brain data acquisition, assembly, and analysis using an end-to-end OptIPuter
At iGrid 2005 we demonstrated the transparent operation of a biology experiment on a test-bed of globally distributed visualization, storage, computational, and network resources....
Rajvikram Singh, Nicholas Schwarz, Nut Taesombut, ...
ACMMSP
2005
ACM
129views Hardware» more  ACMMSP 2005»
13 years 10 months ago
A locality-improving dynamic memory allocator
In general-purpose applications, most data is dynamically allocated. The memory manager therefore plays a crucial role in application performance by determining the spatial locali...
Yi Feng, Emery D. Berger
IEEEPACT
2009
IEEE
13 years 11 months ago
Interprocedural Load Elimination for Dynamic Optimization of Parallel Programs
Abstract—Load elimination is a classical compiler transformation that is increasing in importance for multi-core and many-core architectures. The effect of the transformation is ...
Rajkishore Barik, Vivek Sarkar
CLOUD
2010
ACM
13 years 10 months ago
A self-organized, fault-tolerant and scalable replication scheme for cloud storage
Failures of any type are common in current datacenters, partly due to the higher scales of the data stored. As data scales up, its availability becomes more complex, while differe...
Nicolas Bonvin, Thanasis G. Papaioannou, Karl Aber...