Sciweavers

362 search results - page 33 / 73
» Using Erasure Codes Efficiently for Storage in a Distributed...
Sort
View
TPDS
1998
135views more  TPDS 1998»
13 years 7 months ago
On Coordinated Checkpointing in Distributed Systems
—Coordinated checkpointing simplifies failure recovery and eliminates domino effects in case of failures by preserving a consistent global checkpoint on stable storage. However, ...
Guohong Cao, Mukesh Singhal
ICS
1992
Tsinghua U.
13 years 11 months ago
The CODE 2.0 graphical parallel programming language
CODE 2.0 is a graphical parallel programming system that targets the three goals of ease of use, portability, and production of efficient parallel code. Ease of use is provided by...
Peter Newton, James C. Browne
IJON
2006
189views more  IJON 2006»
13 years 7 months ago
Storing and restoring visual input with collaborative rank coding and associative memory
Associative memory in cortical circuits has been held as a major mechanism for content-addressable memory. Hebbian synapses implement associative memory efficiently when storing s...
Martin Rehn, Friedrich T. Sommer
IPPS
1996
IEEE
13 years 12 months ago
Dag-Consistent Distributed Shared Memory
We introduce dag consistency, a relaxed consistency model for distributed shared memory which is suitable for multithreaded programming. We have implemented dag consistency in sof...
Robert D. Blumofe, Matteo Frigo, Christopher F. Jo...
TWC
2010
13 years 2 months ago
Dynamic Spectrum Access Using a Network Coded Cognitive Control Channel
In this paper we propose a Dynamic Spectrum Access scheme which allows the users to opportunistically and efficiently access the channels available for communications. It addresses...
Nicola Baldo, Alfred Asterjadhi, Michele Zorzi