Results 1 - 10 of 3,403

Fast Barrier Synchronization on Shared Fast Ethernet

by G. Chiola, G. Ciaccio - In Proc. of the 2nd International Workshop on Communication and Architectural Support for Network-Based Parallel Computing (CANPC'98), number 1362 in Lecture Notes in Computer Science , 1998
"... . Shared LAN is presently the most widespread networking technology, due to its extremely low cost and favourable cost/performance ratio. Clusters of Personal Computers (PCs) leveraging shared 100baseT Ethernet may currently offer the best price/performance in parallel processing. Most numerical par ..."
Abstract - Cited by 5 (4 self) - Add to MetaCart
parallel algorithms make heavy use of collective communications and especially barrier synchronization. Hence a critical issue on PC clusters is to offer efficient implementations of such primitives even though using low-cost, non-switched LAN technology. We implemented and studied some simple barrier

Fast Barrier Synchronization for InfiniBand TM

by Torsten Hoefler, Torsten Mehlan, Frank Mietke, Wolfgang Rehm
"... The MPI Barrier() call can be crucial for several applications and has been target of different optimizations since several decades. The best solution to the barrier problem scales with O(log2N) and uses the dissemination principle. A new method using an enhanced dissemination principle and inherent ..."
Abstract - Add to MetaCart
The MPI Barrier() call can be crucial for several applications and has been target of different optimizations since several decades. The best solution to the barrier problem scales with O(log2N) and uses the dissemination principle. A new method using an enhanced dissemination principle

Inter-Block GPU Communication via Fast Barrier Synchronization

by Shucai Xiao, Wu-chun Feng
"... Abstract—While GPGPU stands for general-purpose computation on graphics processing units, the lack of explicit support for inter-block communication on the GPU arguably hampers its broader adoption as a general-purpose computing device. Interblock communication on the GPU occurs via global memory an ..."
Abstract - Cited by 39 (2 self) - Add to MetaCart
and then requires barrier synchronization across the blocks, i.e., inter-block GPU communication via barrier synchronization. Currently, such synchronization is only available via the CPU, which in turn, can incur significant overhead. We propose two approaches for inter-block GPU communication via barrier

Multi-FPGA Implementation of a Network-on-Chip Based Many-core Architecture with Fast Barrier Synchronization Mechanism

by Xiaowen Chen, Shuming Chen, Zhonghai Lu, Axel Jantsch
"... Abstract—In this paper, we propose a fast barrier synchronization mechanism, targeting Network-on-Chip based manycore architectures. Its salient feature is that, once the barrier condition is reached, the “barrier release ” acknowledgement is routed to all processor nodes in a broadcast way in order ..."
Abstract - Add to MetaCart
Abstract—In this paper, we propose a fast barrier synchronization mechanism, targeting Network-on-Chip based manycore architectures. Its salient feature is that, once the barrier condition is reached, the “barrier release ” acknowledgement is routed to all processor nodes in a broadcast way

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

Consensus and cooperation in networked multi-agent systems

by Reza Olfati-Saber , J Alex Fax , Richard M Murray , Reza Olfati-Saber , J Alex Fax , Richard M Murray - Proceedings of the IEEE , 2007
"... Summary. This paper provides a theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, time-delays, and performance guarantees. An ove ..."
Abstract - Cited by 807 (4 self) - Add to MetaCart
in networked dynamic systems and diverse applications including synchronization of coupled oscillators, flocking, formation control, fast consensus in small-world networks, Markov processes and gossip-based algorithms, load balancing in networks, rendezvous in space, distributed sensor fusion in sensor

Eddies: Continuously Adaptive Query Processing

by Ron Avnur, Joseph M. Hellerstein - In SIGMOD , 2000
"... In large federated and shared-nothing databases, resources can exhibit widely fluctuating characteristics. Assumptions made at the time a query is submitted will rarely hold throughout the duration of query processing. As a result, traditional static query optimization and execution techniques are i ..."
Abstract - Cited by 411 (21 self) - Add to MetaCart
are ineffective in these environments. In this paper we introduce a query processing mechanism called an eddy, which continuously reorders operators in a query plan as it runs. We characterize the moments of symmetry during which pipelined joins can be easily reordered, and the synchronization barriers

Efficient authentication and signing of multicast streams over lossy channels

by Adrian Perrig, Ran Canetti, Ibm T. J. Watson - In IEEE Symposium on Security and Privacy , 2000
"... Multicast stream authentication and signing is an important and challenging problem. Applications include the continuous authentication of radio and TV Internet broadcasts, and authenticated data distribution by satellite. The main challenges are fourfold. First, authenticity must be guaranteed even ..."
Abstract - Cited by 334 (8 self) - Add to MetaCart
even when only the sender of the data is trusted. Second, the scheme needs to scale to potentially millions of receivers. Third, streamed media distribution can have high packet loss. Finally, the system needs to be efficient to support fast packet rates. We propose two efficient schemes, TESLA

Dynamics of Sparsely Connected Networks of Excitatory and Inhibitory Spiking Neurons

by Nicolas Brunel , 1999
"... The dynamics of networks of sparsely connected excitatory and inhibitory integrateand -re neurons is studied analytically. The analysis reveals a very rich repertoire of states, including: Synchronous states in which neurons re regularly; Asynchronous states with stationary global activity and very ..."
Abstract - Cited by 306 (16 self) - Add to MetaCart
The dynamics of networks of sparsely connected excitatory and inhibitory integrateand -re neurons is studied analytically. The analysis reveals a very rich repertoire of states, including: Synchronous states in which neurons re regularly; Asynchronous states with stationary global activity and very

Efficient Techniques for Nested and Disjoint Barrier Synchronization

by Isaac D. Scherson, Raghu Subramanian, et a l., Vara Ramakrishnan, Vara Ramakrishnan , 1999
"... Current MIMD computers support the execution of data parallel programs by providing a tree network to perform fast barrier synchronizations. However, there are two major limitations to using tree networks: The first arises due to control nesting in programs, and the second arises when the MIMD co ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
Current MIMD computers support the execution of data parallel programs by providing a tree network to perform fast barrier synchronizations. However, there are two major limitations to using tree networks: The first arises due to control nesting in programs, and the second arises when the MIMD
Results 1 - 10 of 3,403