Sciweavers

1156 search results - page 209 / 232
» Efficient Barriers for Distributed Shared Memory Computers
Sort
View
ICPP
2006
IEEE
14 years 1 months ago
Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...
David A. Bader, Kamesh Madduri
PODC
2011
ACM
12 years 10 months ago
From bounded to unbounded concurrency objects and back
We consider the power of objects in the unbounded concurrency shared memory model, where there is an infinite set of processes and the number of processes active concurrently may...
Yehuda Afek, Adam Morrison, Guy Wertheim
EWSN
2008
Springer
14 years 7 months ago
FiGaRo: Fine-Grained Software Reconfiguration for Wireless Sensor Networks
Wireless Sensor Networks (WSNs) are increasingly being proposed in scenarios whose requirements cannot be fully predicted, or where the system functionality must adapt to changing ...
Luca Mottola, Gian Pietro Picco, Adil Amjad Sheikh
GSEM
2004
Springer
14 years 1 months ago
The Grid-Occam Project
Occam is a parallel processing language designed by a team at INMOS in conjunction with the design of the transputer processor, and based on Sir T. Hoare's ideas of Communica...
Peter Tröger, Martin von Löwis, Andreas ...
CONEXT
2009
ACM
13 years 8 months ago
RFDump: an architecture for monitoring the wireless ether
Networking researchers have been using tools like wireshark and tcpdump to sniff packets on physical links that use different types of datalink protocols, e.g. Ethernet or 802.11,...
Kaushik Lakshminarayanan, Samir Sapra, Srinivasan ...