Abstract
Trends in parallel computing indicate that heterogeneous parallel computing will be one of the most widespread platforms for computation-intensive applications. A heterogeneous computing environment offers considerably more computational power at a lower cost than a parallel computer. We propose the Heterogeneous Bulk Synchronous Parallel (HBSP) model, which is based on the BSP model of parallel computation, as a framework for dev eloping applications for heterogeneous parallel environments. HBSP enhances the applicability of the BSP model by incorporating parameters that reflect the relative speeds of the heterogeneous computing components. Moreover, we demonstrate the utility of the model by developing parallel algorithms for heterogeneous systems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. H. Bisseling. Sparse matrix computations on bulk synchronous parallel computers. In Proceedings of the International Conference on Industrial and Applied Mathematics, Hamburg, July 1995.
R. H. Bisseling and W. F. McColl. Scientific computing on bulk synchronous parallel architectures. In B. Pehrson and I. Simon, editors, Proceedings of the 13th IFIP World Computer Congress, volume 1, pages 509–514. Elsevier, 1994.
A. V. Gerbessiotis and C. J. Siniolakis. Deterministic sorting and randomized mean finding on the BSP model. In Eighth Annual ACM Symposium on Parallel Algorithms and Architectures, pages 223–232, June 1996.
A. V. Gerbessiotis and L. G. Valiant. Direct bulk-synchronous parallel algorithms. Journal of Parallel and Distributed Computing, 22(2):251–267, August 1994.
M. W. Goudreau, K. Lang, S. Rao, T. Suel, and T. Tsantilas. Towards efficiency and portability: Programming with the BSP model. In Eighth Annual ACM Symposium on Parallel Algorithms and Architectures, pages 1–12, June 1996.
J. M. D. Hill, B. McColl, D. C. Stefanescu, M. W. Goudreau, K. Lang, S. B. Rao, T. Suel, T. Tsantilas, and R. Bisseling. BSPlib: The BSP programming library. Parallel Computing, 24(14):1947–1980, 1998.
J. Huang and Y. Chow. Parallel sorting and data partitioning by sampling. In IEEE Computer Society’s Seventh International Computer Software & Applications Conference (COMPSAC’83), pages 627–631, November 1983.
A. Khokhar, V. Prasanna, M. Shaaban, and C. Wang. Heterogeneous computing: Challenges and opportunities. Computer, 26(6):18–27, June 1993.
B. M. Maggs, L. R. Matheson, and R. E. Tarjan. Models of parallel computation: A survey and synthesis. In Proceedings of the 28th Hawaii International Conference on System Sciences, volume 2, pages 61–70. IEEE Press, January 1995.
P. Morin. Coarse-grained parallel computing on heterogeneous systems. In Proceedings of the 1998 ACM Symposium on Applied Computing, pages 629–634, 1998.
P. Morin. Two topics in applied algorithmics. Master’s thesis, Carleton University, 1998.
H. J. Siegel, H. G. Dietz, and J. K. Antonio. Software support for heterogeneous computing. In A. B. Tucker, editor, The Computer Science and Engineering Handbook, pages 1886–1909. CRC Press, 1997.
D. B. Skillicorn and D. Talia. Models and languages for parallel computation. ACM Computing Surveys, 30(2):123–169, June 1998.
L. Smarr and C. E. Catlett. Metacomputing. Communications of the ACM, 35(6):45–52, June 1992.
L. G. Valiant. Optimally universal parallel computers. Philosophical Transactions of the Royal Society of London, A 326:373–376, 1988.
L. G. Valiant. Bulk-synchronous parallel computers. In M. Reeve and S. E. Zenith, editors, Parallel Processing and Artificial Intelligence, pages 15–22. John Wiley & Sons, Chichester, 1989.
L. G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103–111, 1990.
L. G. Valiant. General purpose parallel architectures. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A: Algorithms and Complexity, chapter 18, pages 943–971. MIT Press, Cambridge, MA, 1990.
L. G. Valiant. Why BSP computers? In Proceedings of the 7th International Parallel Processing Symposium, pages 2–5. IEEE Press, April 1993.
C. C. Weems, G. E. Weaver, and S. G. Dropsho. Linguistic support for heterogeneous parallel processing: A survey and an approach. In Proceedings of the Heterogeneous Computing Workshop, pages 81–88, 1994.
T. L. Williams and M. W. Goudreau. An experimental evaluation of BSP sorting algorithms. In Proceedings of the 10th IASTED International Conference on Parallel and Distributed Computing Systems, pages 115–118, October 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Williams, T.L., Parsons, R.J. (2000). The Heterogeneous Bulk Synchronous Parallel Model. In: Rolim, J. (eds) Parallel and Distributed Processing. IPDPS 2000. Lecture Notes in Computer Science, vol 1800. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45591-4_12
Download citation
DOI: https://doi.org/10.1007/3-540-45591-4_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67442-9
Online ISBN: 978-3-540-45591-2
eBook Packages: Springer Book Archive