Sciweavers

1376 search results - page 230 / 276
» The Localization Hypothesis and Machines
Sort
View
WISE
2002
Springer
15 years 11 months ago
An MDP-based Peer-to-Peer Search Server Network
A distributed search system consists of a large number of autonomous search servers logically connected in a peerto-peer network. Each search server maintains a local index of a c...
Yipeng Shen, Dik Lun Lee
GPC
2009
Springer
15 years 10 months ago
Achieving Co-allocation through Virtualization in Grid Environment
A typical grid application requires several processors for execution that may not be fulfilled by single cluster at times. Co-allocation is the concept of aggregating computing res...
Thamarai Selvi Somasundaram, Balachandar R. Amarna...
CC
2001
Springer
121views System Software» more  CC 2001»
15 years 10 months ago
Constant-Time Root Scanning for Deterministic Garbage Collection
Root scanning is the task of identifying references to heap objects that are stored outside of the heap itself, in global and local variables and on the execution stack. Root scann...
Fridtjof Siebert
ISCA
1999
IEEE
87views Hardware» more  ISCA 1999»
15 years 10 months ago
Memory Forwarding: Enabling Aggressive Layout Optimizations by Guaranteeing the Safety of Data Relocation
By optimizing data layout at run-time, we can potentially enhance the performance of caches by actively creating spatial locality, facilitating prefetching, and avoiding cache con...
Chi-Keung Luk, Todd C. Mowry
FM
1999
Springer
109views Formal Methods» more  FM 1999»
15 years 10 months ago
Compositional Symmetric Sharing in B
Sharing between B constructs is limited, both on the specification and the implementation level. The limitations stem from the single writer/multiple readers paradigm, restricted ...
Martin Büchi, Ralph-Johan Back