Sciweavers

12453 search results - page 104 / 2491
» Concurrent Data Structures
Sort
View
PLDI
2006
ACM
15 years 8 months ago
Optimizing memory transactions
Atomic blocks allow programmers to delimit sections of code as ‘atomic’, leaving the language’s implementation to enforce atomicity. Existing work has shown how to implement...
Timothy L. Harris, Mark Plesko, Avraham Shinnar, D...
IPSN
2009
Springer
15 years 8 months ago
Application-informed radio duty-cycling in a re-taskable multi-user sensing system
As sensor networks mature, there will be an increasing need for re-usable, dynamically taskable software systems that support multiple concurrent applications. In this paper, we c...
Omprakash Gnawali, Jongkeun Na, Ramesh Govindan
WCNC
2008
IEEE
15 years 8 months ago
On Spatial Reuse and Capture in Ad Hoc Networks
—Neighbors of both the transmitter and the receiver must keep quiet in a 802.11 wireless network as it requires bidirectional exchange, i.e., nodes reverse their roles as transmi...
Naveen Santhapuri, Srihari Nelakuditi, Romit Roy C...
SC
2005
ACM
15 years 7 months ago
The Globus Striped GridFTP Framework and Server
The GridFTP extensions to the File Transfer Protocol define a general-purpose mechanism for secure, reliable, high-performance data movement. We report here on the Globus striped ...
William E. Allcock, John Bresnahan, Rajkumar Ketti...
JPDC
2008
129views more  JPDC 2008»
15 years 1 months ago
A framework for scalable greedy coloring on distributed-memory parallel computers
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
Doruk Bozdag, Assefaw Hadish Gebremedhin, Fredrik ...