Sciweavers

286 search results - page 41 / 58
» Highly Concurrent Shared Storage
Sort
View
ECTEL
2006
Springer
15 years 1 months ago
Interoperability for Peer-to-Peer Networks: Opening P2P to the Rest of the World
Due to the information growth, distributed environments are offered as a feasible and scalable solution where Peerto-Peer networks have become more relevant. They bring many advan...
Ingo Brunkhorst, Daniel Olmedilla
JTRES
2009
ACM
15 years 4 months ago
Replicating real-time garbage collector for Java
Real-time Java is becoming a viable platform for real-time applications, bringing new challenges to a garbage collector. A real-time collector has to be incremental as not to caus...
Tomás Kalibera
NSF
2001
Springer
197views Computer Vision» more  NSF 2001»
15 years 2 months ago
A Collaborative Infrastructure for Mobile and Wireless Systems
Today‘s use of mobile phones is mostly for coordination purposes. It seems reasonable to assume that 3G and 4G high bandwidth systems will be used in a similar way. This paper th...
Lutz Michael Wegner, Morad Ahmad, Stefan Fröh...
DATE
1999
IEEE
147views Hardware» more  DATE 1999»
15 years 1 months ago
Efficient BIST Hardware Insertion with Low Test Application Time for Synthesized Data Paths
In this paper, new and efficient BIST methodology and BIST hardware insertion algorithms are presented for RTL data paths obtained from high level synthesis. The methodology is ba...
Nicola Nicolici, Bashir M. Al-Hashimi
ISCA
1993
IEEE
137views Hardware» more  ISCA 1993»
15 years 1 months ago
Transactional Memory: Architectural Support for Lock-Free Data Structures
A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be pr...
Maurice Herlihy, J. Eliot B. Moss