Sciweavers

932 search results - page 140 / 187
» Capturing, sharing, and using local place information
Sort
View
WDAG
2007
Springer
82views Algorithms» more  WDAG 2007»
14 years 2 months ago
The Space Complexity of Unbounded Timestamps
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...
Faith Ellen, Panagiota Fatourou, Eric Ruppert
JPDC
2006
106views more  JPDC 2006»
13 years 8 months ago
Performance characteristics of the multi-zone NAS parallel benchmarks
We describe a new suite of computational benchmarks that models applications featuring multiple levels of parallelism. Such parallelism is often available in realistic flow comput...
Haoqiang Jin, Rob F. Van der Wijngaart
BMCBI
2007
176views more  BMCBI 2007»
13 years 8 months ago
The Firegoose: two-way integration of diverse data from different bioinformatics web resources with desktop applications
Background: Information resources on the World Wide Web play an indispensable role in modern biology. But integrating data from multiple sources is often encumbered by the need to...
J. Christopher Bare, Paul T. Shannon, Amy K. Schmi...
PDP
2011
IEEE
12 years 11 months ago
Quantifying Thread Vulnerability for Multicore Architectures
Abstract—Continuously reducing transistor sizes and aggressive low power operating modes employed by modern architectures tend to increase transient error rates. Concurrently, mu...
Isil Oz, Haluk Rahmi Topcuoglu, Mahmut T. Kandemir...
DCOSS
2005
Springer
14 years 1 months ago
Distributed Proximity Maintenance in Ad Hoc Mobile Networks
We present an efficient distributed data structure, called the D-SPANNER, for maintaining proximity information among communicating mobile nodes. The D-SPANNER is a kinetic sparse...
Jie Gao, Leonidas J. Guibas, An Nguyen