Sciweavers

289 search results - page 6 / 58
» Simple COMA Node Implementations
Sort
View
POPL
1996
ACM
13 years 11 months ago
A Provably Time-Efficient Parallel Implementation of Full Speculation
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
John Greiner, Guy E. Blelloch
HSNMC
2004
Springer
125views Multimedia» more  HSNMC 2004»
14 years 29 days ago
Design and Implementation of a Semantic Peer-to-Peer Network
Decentralized and unstructured peer-to-peer (P2P) networks such as Gnutella are attractive for large-scale information retrieval and search systems due to scalability, fault-tolera...
Kiyohide Nakauchi, Hiroyuki Morikawa, Tomonori Aoy...
ADHOC
2007
73views more  ADHOC 2007»
13 years 7 months ago
A survey on real-world implementations of mobile ad-hoc networks
Simulation and emulation are valuable techniques for the evaluation of algorithms and protocols used in mobile ad-hoc networks. However, these techniques always require the simpli...
Wolfgang Kieß, Martin Mauve
FPL
2000
Springer
116views Hardware» more  FPL 2000»
13 years 11 months ago
FPGA Implementation of a Prototype WDM On-Line Scheduler
Message sequencing and channel assignment are two important aspects to consider in optimizing the performance of Wavelength Division Multiplexing (WDM) networks. A scheduling techn...
Winnie W. Cheng, Steven J. E. Wilton, Babak Hamidz...
ISSADS
2005
Springer
14 years 1 months ago
Implementing Distributed Mutual Exclusion on Multithreaded Environments: The Alien-Threads Approach
We present a simple implementation of a token-based distributed mutual exclusion algorithm for multithreaded systems. Several per-node requests could be issued by threads running ...
Federico Meza, Jorge Pérez R., Yadran Etero...