Mark W. Goudreau, Kevin Lang, Satish B. Rao, Torsten Suel, and Thanasis Tsantilas. "Portable and Efficient Parallel Computing Using the BSP Model." IEEE Transactions on Computers, 48(7):670--689, 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....designing applications for good performance on homogeneous parallel machines. Furthermore, experimental results have demonstrated the utility of the model in terms of portability, efficiency, and predictability 1 on diverse parallel platforms for a wide variety of non trivial applications [GLR99, KS99, WG98]. Since the BSP model assumes that all processors have equal computation and communication abilities, it is not appropriate for heterogeneous systems. Instead, it is only suitable for 1 level homogeneous architectures, which consist of some number of identical processors connected by a single ....

....With these applications, we evaluate the utility of BSP in terms of portability, efficiency, and predictability on an SGI Challenge and an Intel Paragon. The claim that both efficiency and portability can be achieved by using the BSP model is supported by both theoretical and experimental results [Val90a, GLR99, KS99, McC93, Val90b, Val93, WG98] . However, other general purpose models, such as LogP [CKP96] make similar claims. LogP models the performance of point to point messages with three parameters representing software overhead, network latency, and communication bandwidth. Under LogP, the programmer is not constrained by a ....

[Article contains additional citation context not shown here]

Mark W. Goudreau, Kevin Lang, Satish B. Rao, Torsten Suel, and Thanasis Tsantilas. "Portable and Efficient Parallel Computing Using the BSP Model." IEEE Transactions on Computers, 48(7):670--689, 1999.

....on designing applications for good performance on homogeneous parallel machines. Furthermore, experimental results have demonstrated the utility of the model in terms of portability, efficiency, and predictability on diverse parallel platforms for a wide variety of non trivial applications [5]. Since the BSP model assumes that all processors have equal computation and communication abilities, it is not appropriate for heterogeneous systems. Instead, it is only suitable for 1 level homogeneous architectures, which consist of a number of identical processors connected by a single ....

....future research are given in Section 6. 2. Related work The Bulk Synchronous Parallel (BSP) 17] model provides the foundation for the HBSP k model. The BSP model provides guidance on designing applications for good performance on homogeneous parallel machines. Support for BSP can be found in [4, 5], which present theoretical results, empirical results, and experimental parameterization of BSP programs. However, BSP only addresses homogeneous platforms with a single communication network. Two models that address 1 level heterogeneous platforms are the Heterogeneous Coarse Grained ....

M. W. Goudreau, K. Lang, S. B. Rao, T. Suel, and T. Tsantilas. Portable and efficient parallel computing using the BSP model. IEEE Transactions on Computers, 48(7):670--689, 1999.

....BSP is to achieve portability of programs. That means there should be an environment on parallel machines that supports the coding of BSP algorithms independent from the underlying machine and that executes the code efficiently. Such BSP environments are the Oxford BSPlib [10] the Green library [9], and the PUB Lib (Paderborn University BSP Library) 5] The PUB Lib is a C Library to support the development and implementation of parallel algorithm designed for the BSP model. It provides the use of block wise communication as suggested by the BSP model, and it provides the use of locality ....

M.W. Goudreau, K. Lang, S.B. Rao, T. Suel, T. Tsantilas. Portable and efficient parallel computing using the BSP model. IEEE Transactions on Computers 48 (1999) 670--689.

....model where computation is organized as a sequence of supersteps separated by barrier synchronizations, and processors operate asynchronously within each superstep. The large body of work this model has generated has demonstrated its suitability for the development of portable software (see e.g. [9]) Although the original BSP is meant to model messagepassing architectures, two BSP variants specifically tailored to shared memory systems have been recently developed, namely, the Queuing Shared Memory (QSM) 8] and the (d; x) BSP [4] which both embody some aspects of memory contention. In ....

M. W. Goudreau, K. Lang, S. B. Rao, T. Suel, and T. Tsantilas. Portable and efficient parallel computing using the bsp model. IEEE Trans. Comput., 48(7):670--689, 1999.

....nature of its communication mechanism, based on batch communication, allows optimized implementations on a large spectrum of parallel architectures, hence fostering efficient portability. However, it has often been noted that the BSP cost function offers only a coarse level of predictability [12, 11]. In fact, such observation has motivated further research into defining more descriptive (hence, less usable) models which embody additional aspects of a machine that impact performance (e.g. message injection overhead [6] or clustering [9] In this paper, we take a different approach. Rather ....

M. Goudreau, K. Lang, S. Rao, et al. Portable and efficient parallel computing using the BSP model. IEEE Trans. on Computers, C-48(7):670--689, July 1999.

....model where computation is organized as a sequence of supersteps separated by barrier synchronizations, and processors operate asynchronously within each superstep. The large body of work this model has generated has demonstrated its suitability for the development of portable software (see e.g. [9]) Although the original BSP is meant to model messagepassing architectures, two BSP variants specifically tailored to shared memory systems have been recently developed. Namely, the Queuing Shared Memory (QSM) 8] and the (d; x) BSP [4] which both embody some aspects of memory contention. In ....

M. W. Goudreau, K. Lang, S. B. Rao, T. Suel, and T. Tsantilas. Portable and efficient parallel computing using the BSP model. IEEE Trans. Comput., 48(7):670--689, 1999.

No context found.

M.W. Goudreau, K. Lang, S.B. Rao, T. Suel, and T. Tsantilas. Portable and efficient parallel computing using the BSP model. IEEE Trans. Comput., c-48(7):670--689, 1999.

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