Sciweavers

294 search results - page 31 / 59
» Concurrency and the Principle of Data Locality
Sort
View
CONCURRENCY
2000
123views more  CONCURRENCY 2000»
15 years 5 months ago
A mobile agent based push methodology for global parallel computing
The 1990s are seeing the explosive growth of the Internet and Web-based information sharing and dissemination systems. The Internet is also showing a potential of forming of a sup...
Cheng-Zhong Xu, Brian Wims
AMAST
2004
Springer
15 years 11 months ago
A Science of Software Design
concerns, abstraction (particularly hierarchical abstraction), simplicity, and restricted visibility (locality of information). The overall goal behind these principles was stated ...
Don S. Batory
DEXAW
2006
IEEE
140views Database» more  DEXAW 2006»
16 years 4 days ago
String-Matching and Update through Algebraic Signatures in Scalable Distributed Data Structures
: Scalable Distributed Data Structures (SDDSs) store large scalable files over a distributed RAM of nodes in a grid or a P2P network. The files scale transparently for the applicat...
Riad Mokadem, Witold Litwin
ISLPED
2005
ACM
98views Hardware» more  ISLPED 2005»
15 years 11 months ago
Synonymous address compaction for energy reduction in data TLB
Modern processors can issue and execute multiple instructions per cycle, often performing multiple memory operations simultaneously. To reduce stalls due to resource conflicts, m...
Chinnakrishnan S. Ballapuram, Hsien-Hsin S. Lee, M...
IPPS
2006
IEEE
16 years 3 days ago
An approach to locality-conscious load balancing and transparent memory hierarchy management with a global-address-space paralle
The development of efficient parallel out-of-core applications is often tedious, because of the need to explicitly manage the movement of data between files and data structures ...
Sriram Krishnamoorthy, Ümit V. Çataly&...