Results 1 - 10 of 1,417

Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors

by John M. Mellor-crummey, Michael L. Scott - ACM Transactions on Computer Systems , 1991
"... Busy-wait techniques are heavily used for mutual exclusion and barrier synchronization in shared-memory parallel programs. Unfortunately, typical implementations of busy-waiting tend to produce large amounts of memory and interconnect contention, introducing performance bottlenecks that become marke ..."
Abstract - Cited by 573 (32 self) - Add to MetaCart
Busy-wait techniques are heavily used for mutual exclusion and barrier synchronization in shared-memory parallel programs. Unfortunately, typical implementations of busy-waiting tend to produce large amounts of memory and interconnect contention, introducing performance bottlenecks that become

Evaluation of Release Consistent Software Distributed Shared Memory on Emerging Network Technology

by Sandhya Dwarkadas, Pete Keleher, Alan L. Cox, Willy Zwaenepoel
"... We evaluate the effect of processor speed, network characteristics, and software overhead on the performance of release-consistent software distributed shared memory. We examine five different protocols for implementing release consistency: eager update, eager invalidate, lazy update, lazy invalidat ..."
Abstract - Cited by 467 (43 self) - Add to MetaCart
such as Cholesky achieve little speedup regardless of the protocol used because of the frequency of synchronization operations and the high latency involved. While the use of relaxed memory models, lazy implementations, and multiple-writer protocols has reduced the impact of false sharing, synchronization latency

An Energy-Efficient MAC Protocol for Wireless Sensor Networks

by Wei Ye, John Heidemann, Deborah Estrin , 2002
"... This paper proposes S-MAC, a medium-access control (MAC) protocol designed for wireless sensor networks. Wireless sensor networks use battery-operated computing and sensing devices. A network of these devices will collaborate for a common application such as environmental monitoring. We expect senso ..."
Abstract - Cited by 1517 (36 self) - Add to MetaCart
wireless MACs such as IEEE 802.11 in almost every way: energy conservation and self-configuration are primary goals, while per-node fairness and latency are less important. S-MAC uses three novel techniques to reduce energy consumption and support self-configuration. To reduce energy consumption

Tor: The secondgeneration onion router,”

by Roger Dingledine - in 13th USENIX Security Symposium. Usenix, , 2004
"... Abstract We present Tor, a circuit-based low-latency anonymous communication service. This second-generation Onion Routing system addresses limitations in the original design by adding perfect forward secrecy, congestion control, directory servers, integrity checking, configurable exit policies, an ..."
Abstract - Cited by 1229 (33 self) - Add to MetaCart
Abstract We present Tor, a circuit-based low-latency anonymous communication service. This second-generation Onion Routing system addresses limitations in the original design by adding perfect forward secrecy, congestion control, directory servers, integrity checking, configurable exit policies

Skyscraper broadcasting: A new broadcasting scheme for metropolitan video-on-demand systems

by Kien A. Hua, Simon Sheu , 1997
"... We investigate a novel multicast technique, called Skyscraper Broadcasting (SB), for video-on-demand applications. We discuss the data fragmentation technique, the broadcasting strategy, and the client design. We also show the correctness of our technique, and derive mathematical equations to analyz ..."
Abstract - Cited by 307 (20 self) - Add to MetaCart
at the receiving end. PPB is able to address these problems. However, this is accomplished at the expense of a larger access latency and more complex synchronization. With SB, we are able to achieve the low latency of PB while using only 20% of the buffer space required by PPB.

Theory of latency-insensitive design

by Luca P. Carloni, Kenneth L. McMillan , Alberto L. Sangiovanni-Vincentelli - IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS , 2001
"... The theory of latency-insensitive design is presented as the foundation of a new correct-by-construction methodology to design complex systems by assembling intellectual property components. Latency-insensitive designs are synchronous distributed systems and are realized by composing functional mod ..."
Abstract - Cited by 138 (17 self) - Add to MetaCart
The theory of latency-insensitive design is presented as the foundation of a new correct-by-construction methodology to design complex systems by assembling intellectual property components. Latency-insensitive designs are synchronous distributed systems and are realized by composing functional

Z-MAC: a Hybrid MAC for Wireless Sensor Networks

by Ajit Warrier, Jeongki Min, Injong Rhee , 2005
"... Z-MAC is a hybrid MAC protocol for wireless sensor networks. It combines the strengths of TDMA and CSMA while offsetting their weaknesses. Nodes are assigned time slots using a distributed implementation of RAND. Unlike TDMA where a node is allowed to transmit only during its own assigned slots, a n ..."
Abstract - Cited by 296 (7 self) - Add to MetaCart
the effect of switching between CSMA and TDMA depending on contention. Z-MAC is robust to topology changes and clock synchronization errors; in the worst case its performance falls back to that of CSMA. We implemented Z-MAC in TinyOS and evaluated its channel utilization, energy, latency and fairness over

APRIL: A Processor Architecture for Multiprocessing

by Anant Agarwal, Beng-Hong Lim, David Kranz, John Kubiatowicz - IN PROCEEDINGS OF THE 17TH ANNUAL INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE , 1990
"... Processors in large-scale multiprocessors must be able to tolerate large communication latencies and synchronization delays. This paper describes the architecture of a rapid-context-switching processor called APRIL with support for fine-grain threads and synchronization. APRIL achieves high single-t ..."
Abstract - Cited by 283 (25 self) - Add to MetaCart
Processors in large-scale multiprocessors must be able to tolerate large communication latencies and synchronization delays. This paper describes the architecture of a rapid-context-switching processor called APRIL with support for fine-grain threads and synchronization. APRIL achieves high single

Low-latency Synchronization of

by Loosely-coupled Sensornet Republishing, Unkyu Park, John Heidemann
"... Today many individual deployments of sensornets are successful, but they will have much greater impact when, rather than standing alone, they share data across deployments so each can build upon the others. We expect data to be shared over the Internet, and as the number of processing and reprocessi ..."
Abstract - Add to MetaCart
and reprocessing steps grows, timely data synchronization is increasingly important. Today, such sharing is often hard-coded or driven by fixed-interval polling. Fixedinterval polling can provide poor worst-case performance (mean latency approaching the data generation period), and best performance requires

Time synchronization for high latency acoustic networks

by Affan A. Syed - In Proc. IEEE InfoCom , 2006
"... Abstract — Distributed time synchronization is an important part of a sensor network where sensing and actuation must be coordinated across multiple nodes. Several time synchronization protocol that maximize accuracy and energy conservation have been developed, including FTSP, TPSN, and RBS. All of ..."
Abstract - Cited by 71 (10 self) - Add to MetaCart
speed is nearly five orders of magnitude slower than RF, assumptions about rapid communication are incorrect and new approaches to time synchronization are required. We present Time Synchronization for High Latency (TSHL), designed assuming such high latency propagation. We show through analysis
Results 1 - 10 of 1,417