Y. Aumann, K. Palem, Z. Kedem, and M. O. Rabin. Highly ecient asynchronous execution of large grained parallel programs. In Proceedings of the 34th Annual Symposium on the Foundations of Computer Science (FOCS), pages 271-280, November 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....could o er programmers illusion that their programs run on a parallel system that is synchronous, while in fact the programs would be simulated on an asynchronous system. Simulations of a parallel system that is synchronous on a system that is asynchronous have been studied for over a decade now [3, 4, 5, 6, 10, 13, 14, 17, 19, 20, 21, 22, 28, 30, 35, 36]. Simplifying considerably, simulations assume that there is a system with p asynchronous processors, and the system is to simulate a program written for n synchronous processors. The simulations use three main ideas: idempotence, load balancing, and synchronization. Speci cally, the execution of ....

....stage, so as to ensure that the simulated program proceeds in lock step. One challenge in realizing the simulations is the problem of late writers i.e. when a slow processor clobbers the memory of a simulation with a value from an old phase. This problem has been addressed in various ways [4, 5, 20, 28, 29]. Another challenge is the development of ecient load balancing and synchronization algorithms. This challenge is abstracted as the Certi ed WriteAll (CWA) problem. In this problem, introduced in a slightly di erent form by Kanellakis and Shvartsman [17] there are p processors, an array w with n ....

Aumann, Y., Kedem, Z.M., Palem, K.V., Rabin, M.O.: Highly Ecient Asynchronous Execution of Large-Grained Parallel Programs. 34th IEEE Symposium on Foundations of Computer Science FOCS'93, (1993) 271-280

.... automated tool, e.g. a compiler, the latter requires sophisticated solutions because of the diculty of (re)using the auxiliary memory due to late writers (i.e. processors that are slow and that unknowingly write stale values to memory) Examples of solutions addressing these problems include [2, 3, 22]. The Write All problem has been substantially studied for synchronous failure prone processors [20] and a number of ecient randomized algorithms have been developed for the asynchronous setting, e.g. 2, 3, 7, 13, 22, 29, 28, 31] However there is a dearth of deterministic asynchronous ....

.... stale values to memory) Examples of solutions addressing these problems include [2, 3, 22] The Write All problem has been substantially studied for synchronous failure prone processors [20] and a number of ecient randomized algorithms have been developed for the asynchronous setting, e.g. [2, 3, 7, 13, 22, 29, 28, 31]. However there is a dearth of deterministic asynchronous algorithms. We measure the eciency of algorithms in terms of work that accounts for all machine instructions executed by the n processors during the computation (this generalizes the processortime product measure of synchronous parallel ....

Aumann, Y., Kedem, Z.M., Palem, K.V., Rabin, M.O.: Highly Ecient Asynchronous Execution of Large-Grained Parallel Programs. Proc. of the 34th IEEE Symp. on Foundations of Computer Science (1993) 271-280

.... tool, e.g. a compiler, the latter requires sophisticated solutions because of the diculty of (re)using the auxiliary memory due to late writers (i.e. processors that are slow and that unknowingly write stale values to memory) Examples of randomized solutions addressing these problems include [2, 1, 21]. Another important aspect of algorithm simulations is the use of on optimistic approach, where the computation may proceed for several steps assuming that all tasks assigned to active processors are successfully completed. For example, a series of potentially incorrect tentative steps can be ....

Aumann, Y., Kedem, Z.M., Palem, K.V., Rabin, M.O., \Highly Ecient Asynchronous Execution of Large-Grained Parallel Programs", in Proc. of the 34th IEEE Symp. on Foundations of Computer Science, pp. 271-280, 1993.

.... be retrieved from the information available to the processors that are active in the simulation by applying the method of information dispersal (cf. 26] This method was also used in a context when memory cell values could be unreachable in unreliable PRAMs, by Aumann, Kedem, Palem, and Rabin in [2]. Overview of the simulation. The simulation is in three phases: 1) preprocessing, which is followed by (2) retrieving the input by the processors active in the simulation, and nally by (3) the proper part of the simulation, which is performed in a step by step fashion. Preprocessing: n) ....

Y. Aumann, Z. Kedem, K. Palem, and M. Rabin, Highly Ecient Asynchronous Execution of Large-Grained Parallel Programs, in Proc. 34th Symp. on the Foundations of Computer Science, 1993, (IEEE Comp. Soc. Press, Los Alamitos, Calif., 1993), pp. 271-280.

....powerful. We further describe why it is useful to bridge these elds and then proceed to the main results in this paper. 1. 1 Asynchronous Parallel Computation Executing parallel programs on heterogeneous processors is studied intensely in the area of asynchronous parallel computation [20, 19, 34, 32, 28, 5, 3, 2]. In this eld, the goal is to run a parallel program that is written assuming synchronization barriers, on a collection of asynchronous processors that do not have a synchronization primitive. In some special cases, such as numerical algorithms, the structure of the parallel program may be ....

Y. Aumann, K. Palem, Z. Kedem, and M. O. Rabin. Highly ecient asynchronous execution of large grained parallel programs. In Proceedings of the 34th Annual Symposium on the Foundations of Computer Science (FOCS), pages 271-280, November 1993.

....and those of scheduling theory. We further describe these elds and then proceed to describe the main results in this paper. 1. 1 Asynchronous Parallel Computation Executing parallel programs on heterogeneous processors is studied intensely in the area of asynchronous parallel computation [16, 15, 29, 28, 24, 5, 3, 2]. In this eld, the goal is to run a parallel program written assuming synchronization barriers, on a collection of asynchronous processors that do not have a synchronization primitive. Processors are assumed to be arbitrarily erratic. That is, a processor may initially run so slowly that it is ....

Y. Aumann, K. Palem, Z. Kedem, and M. O. Rabin. Highly ecient asynchronous execution of large grained parallel programs. In Proceedings of the 34th Annual Symposium on the Foundations of Computer Science, pages 271-280, November 1993.

No context found.

Aumann, Y., Kedem, Z.M., Palem, K.V., Rabin, M.O.: Highly Ecient Asynchronous Execution of Large-Grained Parallel Programs. Proc. of the 34th IEEE Symp. on Foundations of Computer Science (1993) 271-280

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC