Sciweavers

10848 search results - page 2022 / 2170
» Programming in Biomolecular Computation
Sort
View
MOBIHOC
2005
ACM
16 years 5 months ago
Toward resilient security in wireless sensor networks
Node compromise poses severe security threats in wireless sensor networks. Unfortunately, existing security designs can address only a small, fixed threshold number of compromised...
Hao Yang, Fan Ye, Yuan Yuan, Songwu Lu, William A....
MOBIHOC
2003
ACM
16 years 5 months ago
SHARP: a hybrid adaptive routing protocol for mobile ad hoc networks
A central challenge in ad hoc networks is the design of routing protocols that can adapt their behavior to frequent and rapid changes in the network. The performance of proactive ...
Venugopalan Ramasubramanian, Zygmunt J. Haas, Emin...
PPOPP
2010
ACM
16 years 3 months ago
Using data structure knowledge for efficient lock generation and strong atomicity
To achieve high-performance on multicore systems, sharedmemory parallel languages must efficiently implement atomic operations. The commonly used and studied paradigms for atomici...
Gautam Upadhyaya, Samuel P. Midkiff, Vijay S. Pai
PPOPP
2010
ACM
16 years 3 months ago
Lazy binary-splitting: a run-time adaptive work-stealing scheduler
We present Lazy Binary Splitting (LBS), a user-level scheduler of nested parallelism for shared-memory multiprocessors that builds on existing Eager Binary Splitting work-stealing...
Alexandros Tzannes, George C. Caragea, Rajeev Baru...
SPAA
2009
ACM
16 years 3 months ago
A randomized, o(log w)-depth 2 smoothing network
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
Marios Mavronicolas, Thomas Sauerwald
« Prev « First page 2022 / 2170 Last » Next »