Results 1 - 10 of 76,088

Reducing Data Communication Overhead for

by Doacross Loop Nests, Peiyi Tang, John N. Zigman - In 1994 International Conference on Supercomputing Conference Proceedings , 1994
"... : If the iterations of a loop nest cannot be partitioned into independent tasks, data communication for data dependence is inevitable in order to execute them on parallel machines. This kind of loop nest is referred to as a Doacross loop nest. This paper is concerned with compiler algorithms for pa ..."
Abstract - Add to MetaCart
overhead and high speedup for Doacross loop nests on multicomputers can be achieved by tuning these techniques. 1 Introduction If the iterations of a loop nest cannot be partitioned into independent tasks, data communication for data dependence is inevitable in order to execute the loop nest on parallel

The importance of non-data-communication overheads in mpi

by Pavan Balaji, Anthony Chan, Rajeev Thakur, Ewing Lusk - Int’l Journal of High Performance Computing Applications , 2010
"... With processor speeds no longer doubling every 18–24 months owing to the exponential increase in power con-sumption and heat dissipation, modern high-end comput-ing systems tend to rely less on the performance of single processing units and instead rely on achieving high per-formance by using the pa ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
of serialization within the communication stack that were acceptable on small/medium systems can be brutal on massively parallel systems. Thus, in this paper, we study the different non-data-communication overheads within the MPI implementation on the IBM Blue Gene/P system. Specifically, we analyze various

Reducing Data Communication Overhead for DOACROSS Loop Nests

by Peiyi Tang, Peiyi Tang, John N. Zigman, John N. Zigman - In 1994 International Conference on Supercomputing Conference Proceedings , 1993
"... If the loop iterations of a loop nest cannot be partitioned into independent sets, the data communication for data dependences are inevitable in order to execute them on parallel machines. This kind of loop nests are referred to as Doacross loop nests. This paper is concerned with compiler algorith ..."
Abstract - Cited by 22 (5 self) - Add to MetaCart
If the loop iterations of a loop nest cannot be partitioned into independent sets, the data communication for data dependences are inevitable in order to execute them on parallel machines. This kind of loop nests are referred to as Doacross loop nests. This paper is concerned with compiler

Non-Data-Communication Overheads in MPI: Analysis on Blue Gene/P

by P. Balaji, A. Chan, R. Thakur, E. Lusk
"... high-performance by using the parallelism of a massive number of low-frequency/low-power processing cores. This means that the local preand post-communication processing required by the MPI stack might not be very fast, owing to the slow processing cores. Similarly, small amounts of serialization wi ..."
Abstract - Cited by 6 (1 self) - Add to MetaCart
within the MPI stack that were acceptable on small/medium systems can be brutal on massively parallel systems. In this paper, we study different non-data-communication overheads within the MPI implementation on the IBM Blue Gene/P system. 1

Password Authentication with Insecure Communication

by Leslie Lamport , 1981
"... A method of user password authentication is de-scribed which is secure even if an intruder can read the system's data, and can tamper with or eavesdrop on the communication between the user and the system. The method assumes a secure one-way encryption function and can be implemented with a mi ..."
Abstract - Cited by 548 (0 self) - Add to MetaCart
A method of user password authentication is de-scribed which is secure even if an intruder can read the system's data, and can tamper with or eavesdrop on the communication between the user and the system. The method assumes a secure one-way encryption function and can be implemented with a

Active Messages: a Mechanism for Integrated Communication and Computation

by Thorsten Von Eicken, David E. Culler, Seth Copen Goldstein, Klaus Erik Schauser , 1992
"... The design challenge for large-scale multiprocessors is (1) to minimize communication overhead, (2) allow communication to overlap computation, and (3) coordinate the two without sacrificing processor cost/performance. We show that existing message passing multiprocessors have unnecessarily high com ..."
Abstract - Cited by 1054 (75 self) - Add to MetaCart
The design challenge for large-scale multiprocessors is (1) to minimize communication overhead, (2) allow communication to overlap computation, and (3) coordinate the two without sacrificing processor cost/performance. We show that existing message passing multiprocessors have unnecessarily high

Synchronous data flow

by Edward A. Lee, et al. , 1987
"... Data flow is a natural paradigm for describing DSP applications for concurrent implementation on parallel hardware. Data flow programs for signal processing are directed graphs where each node represents a function and each arc represents a signal path. Synchronous data flow (SDF) is a special case ..."
Abstract - Cited by 622 (45 self) - Add to MetaCart
of data flow (either atomic or large grain) in which the number of data samples produced or consumed by each node on each invocation is specified a priori. Nodes can be scheduled statically (at compile time) onto single or parallel programmable processors so the run-time overhead usually associated

Space-time codes for high data rate wireless communication: Performance criterion and code construction

by Vahid Tarokh, Nambi Seshadri, A. R. Calderbank - IEEE TRANS. INFORM. THEORY , 1998
"... We consider the design of channel codes for improving the data rate and/or the reliability of communications over fading channels using multiple transmit antennas. Data is encoded by a channel code and the encoded data is split into n streams that are simultaneously transmitted using n transmit ant ..."
Abstract - Cited by 1782 (28 self) - Add to MetaCart
We consider the design of channel codes for improving the data rate and/or the reliability of communications over fading channels using multiple transmit antennas. Data is encoded by a channel code and the encoded data is split into n streams that are simultaneously transmitted using n transmit

Data Streams: Algorithms and Applications

by S. Muthukrishnan , 2005
"... In the data stream scenario, input arrives very rapidly and there is limited memory to store the input. Algorithms have to work with one or few passes over the data, space less than linear in the input size or time significantly less than the input size. In the past few years, a new theory has emerg ..."
Abstract - Cited by 533 (22 self) - Add to MetaCart
In the data stream scenario, input arrives very rapidly and there is limited memory to store the input. Algorithms have to work with one or few passes over the data, space less than linear in the input size or time significantly less than the input size. In the past few years, a new theory has

Energy-efficient communication protocol for wireless microsensor networks

by Wendi Rabiner Heinzelman, Anantha Chandrakasan, Hari Balakrishnan , 2000
"... Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have significant impact on the overall energy dissipation of these networks. Based on our f ..."
Abstract - Cited by 2103 (10 self) - Add to MetaCart
Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have significant impact on the overall energy dissipation of these networks. Based on our
Results 1 - 10 of 76,088