Sciweavers

2186 search results - page 51 / 438
» Considering an Organization's Memory
Sort
View
DAMON
2008
Springer
13 years 10 months ago
Avoiding version redundancy for high performance reads in temporal databases
A major performance bottleneck for database systems is the memory hierarchy. The performance of the memory hierarchy is directly related to how the content of disk pages maps to t...
Khaled Jouini, Geneviève Jomier
WSC
2001
13 years 10 months ago
Use of DaSSF in a scalable multiprocessor wireless simulation architecture
The problem of efficient load distribution and scaling of large-scale wireless communication system simulation on multiprocessor architectures (both shared memory and cluster arra...
Trefor J. Delve, Nathan Smith
JEC
2006
88views more  JEC 2006»
13 years 9 months ago
Joint garbage collection and hard real-time scheduling
We analyze the integration of automatic memory management in a real-time context. We focus on integrating a real-time (copying) garbage collector with hard real-time static-priori...
Maxime Van Assche, Joël Goossens, Raymond R. ...
IPPS
1999
IEEE
14 years 1 months ago
LLB: A Fast and Effective Scheduling Algorithm for Distributed-Memory Systems
This paper presents a new algorithm called List-based Load Balancing (LLB) for compile-time task scheduling on distributed-memory machines. LLB is intended as a cluster-mapping an...
Andrei Radulescu, Arjan J. C. van Gemund, Hai-Xian...
WADS
2009
Springer
223views Algorithms» more  WADS 2009»
14 years 3 months ago
Fault Tolerant External Memory Algorithms
Abstract. Algorithms dealing with massive data sets are usually designed for I/O-efficiency, often captured by the I/O model by Aggarwal and Vitter. Another aspect of dealing with ...
Gerth Stølting Brodal, Allan Grønlun...