Skip to main content
SpringerLink
Log in

A Bridging Model for Multi-core Computing

  • Conference paper
Algorithms - ESA 2008 (ESA 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5193))

Included in the following conference series:

Abstract

We propose a bridging model aimed at capturing the most basic resource parameters of multi-core architectures. We suggest that the considerable intellectual effort needed for designing efficient algorithms for such architectures may be most fruitfully pursued as an effort in designing portable algorithms for such a bridging model. Portable algorithms would contain efficient designs for all reasonable ranges of the basic resource parameters and input sizes, and would form the basis for implementation or compilation for particular machines.

This work was supported in part by NSF-CCF-04-27129.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 189.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aggarwal, A., Alpern, B., Chandra, A., Snir, M.: A model for hierarchical memory. In: Proc. of the 19th ACM Symp. on Theory of Computing, pp. 305–314 (1987)

    Google Scholar 

  2. Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Communications of the ACM 31(9), 1116–1127 (1988)

    Article  MathSciNet  Google Scholar 

  3. Alpern, B., Carter, L., Feig, E., Selker, T.: A uniform memory hierarchy model of computation. Algorithmica 12, 72–109 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  4. Arge, L., Goodrich, M., Nelson, M., Sitchinava, N.: Fundamental parallel algorithms for private-cache chip multiprocessor. In: Proc. 20th Symp. on Parallelism in Algorithms and Architectures, pp. 197–206 (2008)

    Google Scholar 

  5. Bilardi, G., Fantozzi, C., Pietracaprina, A., Pucci, G.: On the Effectiveness of D-BSP as a Bridging Model of Parallel Computation. In: International Conference on Computational Science 2001, pp. 579–588 (2001)

    Google Scholar 

  6. Bilardi, G., Pietracaprina, A., Pucci, G., Silvestri, F.: Network-oblivious algorithms. In: Proc. 21st International Parallel and Distributed Processing Symposium, IPDPS, pp. 1–10 (2007)

    Google Scholar 

  7. Blelloch, G., Chowdhury, R., Gibbons, P., Ramachandran, V., Chen, S., Kozuch, M.: Provably good multicore cache performance for divide and conquer algorithms. In: Proc. ACM-SIAM Symposium on Discrete Algorithms, pp. 501–510 (2008)

    Google Scholar 

  8. Chowdhury, R., Ramachandran, V.: Cache-efficient dynamic programming algorithms for multicores. In: Proc. 20th Symp. on Parallelism in Algorithms and Architectures, pp. 207–216 (2008)

    Google Scholar 

  9. de la Torre, P., Kruskal, C.P.: Submachine Locality in the Bulk Synchronous Setting (Extended Abstract). In: Euro-Par, vol. II, pp. 352–358 (1996)

    Google Scholar 

  10. Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.: Cache-Oblivious Algorithms. In: Proc. 40th IEEE Symp. on Foundations of Computer Science, pp. 285–298 (1999)

    Google Scholar 

  11. Fortune, S., Wyllie, C.: Parallelism in Random Access Machines. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, pp. 114–118 (1978)

    Google Scholar 

  12. Gerbessiotis, A.V., Siniolakis, C.J.: Efficient Deterministic Sorting on the BSP Model. Parallel Processing Letters 9(1), 69–79 (1999)

    Article  MathSciNet  Google Scholar 

  13. Gerbessiotis, A.V., Valiant, L.G.: Direct Bulk-Synchronous Parallel Algorithms. Journal of Parallel and Distributed Computing 22, 251–267 (1994)

    Article  Google Scholar 

  14. Goudreau, M., Lang, K., Rao, S., Suel, T., Tsantilas, T.: Towards Efficiency and Portability: Programming with the BSP Model. In: Proc. 8th ACM Symposium on Parallel Algorithms and Architectures (SPAA 1996), pp. 1–12 (1996)

    Google Scholar 

  15. Goudreau, M.W., Lang, K., Narlikar, G., Rao, S.B.: Boss is Boss: A Case for Bulk-Synchronous Object Systems. In: Proceedings of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 1999), pp. 115–125 (1999)

    Google Scholar 

  16. Hill, M.D., Marty, M.R.: Amdahl’s Law in the Multicore Era. IEEE Computer (July 2008)

    Google Scholar 

  17. Hong, J., Kung, H.: I/O-complexity: The red-blue pebble game. In: Proceedings of ACM Symposium on Theory of Computing, pp. 326–333 (1981)

    Google Scholar 

  18. Irony, D., Toledo, S., Tiskin, A.: Communication lower bounds for distributed-memory matrix multiplication. Journal of Parallel and Distributed Computing 64(9), 1017–1026 (2004)

    Article  MATH  Google Scholar 

  19. Juurlink, B.H.H., Wijshoff, H.A.G.: The parallel hierarchical memory model. In: Schmidt, E.M., Skyum, S. (eds.) SWAT 1994. LNCS, vol. 824, pp. 240–251. Springer, Heidelberg (1994)

    Google Scholar 

  20. Karp, R.M., Ramachandran, V.: Parallel algorithms for shared memory machines. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, pp. 869–941. Elsevier Science Publishers B. V, Amsterdam (1990)

    Google Scholar 

  21. Kumar, R., Tullsen, D., Jouppi, N., Ranganathan, P.: Heterogeneous Chip Multiprocessors. IEEE Computer, 32–38 (November 2005)

    Google Scholar 

  22. McColl, W.F., Tiskin, A.: Memory-efficient matrix computations in the BSP model. Algorithmica 24(3–4), 287–297 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  23. Nodine, M.H., Vitter, J.S.: Optimal deterministic sorting on parallel processors and parallel memory hierarchies (manuscript, 1993); Deterministic distribution sort in shared and distributed memory multiprocessors. In: Proc. ACM Symp. on Parallel Algorithms and Architectures, pp. 120–129 (1993)

    Google Scholar 

  24. Savage, J.E.: Extending the Hong-Kung Model to Memory Hierarchies. In: Du, D.-Z., Li, M. (eds.) Computing and Combinatorics, pp. 270–281. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  25. Sen, S., Chatterjee, S., Dumir, N.: Towards a Theory of Cache-Efficient Algorithms. J. ACM 49(6), 828–858 (2002)

    Article  MathSciNet  Google Scholar 

  26. Shi, H., Schaeffer, J.: Parallel sorting by regular sampling. J. of Parallel and Distributed Computing 14, 362–372 (1992)

    Article  Google Scholar 

  27. Tiskin, A.: The bulk-synchronous parallel random access machine. Theoretical Computer Science 196(1–2), 109–130 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  28. Valiant, L.G.: A Bridging Model for Parallel Computation. Communications of the ACM 33(8), 103–111 (1990)

    Article  Google Scholar 

  29. Vitter, J.S.: External Memory Algorithms and Data Structures: Dealing with Massive Data. ACM Computing Surveys 33(2), 209–271 (2001)

    Article  Google Scholar 

  30. Vitter, J.S., Shriver, E.A.M.: Algorithms for parallel memory II: Hierarchical multilevel memories. Algorithmica 12(2/3), 148–169 (1994)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Engineering and Applied Sciences, Harvard University,  

    Leslie G. Valiant

Authors
  1. Leslie G. Valiant
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Dan Halperin Kurt Mehlhorn

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Valiant, L.G. (2008). A Bridging Model for Multi-core Computing. In: Halperin, D., Mehlhorn, K. (eds) Algorithms - ESA 2008. ESA 2008. Lecture Notes in Computer Science, vol 5193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87744-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87744-8_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87743-1

  • Online ISBN: 978-3-540-87744-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation