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

Abstract—This paper speculates on a perspective for studying overhead in communication systems that contrasts the traditional viewpoint that overhead is the “non-data ” portion of transmissions. By viewing overhead as the cost of constraints imposed on a system, information-theoretic techniques can

All in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.

Multicasting finds many applications on the Internet. User Datagram Protocol (UDP), used for multicasting does not ensure reliability in data transmission. We suggest that multicast routing protocols should consider reliability of the route as a routing parameter while calculating the optimal path. This minimizes the overall bandwidth consumed by a multicast session, as the data to be retransmitted is less. There exists a tradeoff between the trees constructed using reliability (RPT) and the trees constructed using path length (SPT). We introduce a few methods to find the intermediate trees or set of trees lying in the spectrum of trees with SPT and RPT as ends of the spectrum. The performance of this tree is evaluated using simulations on different networks topologies. The simulations are done using the event-driven Network Simulator (NS-2) on highly densed network topologies. It is observed that these intermediate trees shows 10%-15 % savings in the bandwidth consumption over SPTs and RPTs.

vast number of applications of wireless sensor networks in areas such as environmental monitoring, warfare, education, agriculture to name a few. In the present work, the comparative evaluation of communication overhead due to sink mobility with speed variations, the effect of update time variation

We propose several localized sensor area coverage protocols, for arbitrary ratio of sensing and transmission radii. Sensors are assumed to be time synchronized, and active sensors are determined at the beginning of each round. The approach has a very small communication overhead since prior

that low communication overhead and high speedup for Doacross loop nests on multicomputers can be achieved by tuning these techniques. Keywords: Doacross loop nests, chain-based scheduling, loop tiling, indirect message passing, distributed-memory multicomputers This work was supported in part

In Broadcast Encryption (BE) systems like Pay-TV, AACS, online content sharing and broadcasting, reduc-ing the header length (communication overhead per session) is of practical interest. The Subset Difference (SD) scheme due to Naor-Naor-Lotspiech (NNL) is the most popularly used BE scheme

introduced to estimate communication overhead. The model then is used in a newly proposal iterative method to predict the scaling property of a program automatically. Experimental testing is performed on a Cray T3E and a QSW machine to confirm the methodology. Experimental and analytical results show

One of the primary objectives in the programming of parallel algorithms is to reduce the effects of the overhead introduced when a given problem is parallelized. A key contributor to overhead is communication time. One way to reduce the communication overhead is to minimize the actual time