Abstract
The κnuma model is a new model of parallel computation, which should be used to develop and analyse algorithms for clusters of smp-blocks (symmetrical multiprocessing). smp-blocks are parallel computers with shared memory to which the few processors have uniform access (uma). The model implies modern directions like hierarchical interconnection, innernode communication (threads and shared memory) and internode communication (message-passing and remote data access). κnuma is developed on top of the widely accepted bsp (bulk-synchronous parallel) model. In this paper, we present an examplifying analysis of the personalized one-to-all broadcast. It will be shown that if we transfer optimal algorithms based on the bsp model directly, there will be a lack of information and so a loss of performance.
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.
Similar content being viewed by others
References
A. Alexandrov, M. Ionescu, K. Schauser, and C. Scheiman. LogGP: Incorporating long messages into the LogP model — one step closer towards a realistic model for parallel computation. In In Proceedings of the 7th Symposium on Parallel Algorithms and Architectures, Santa Barbara, CA, pages 95–105, Juli 1995.
G. Bilardi, P. Codenotti, G. Del Corso, C. Pinotti, and G. Resta. EURO-PAR 97, volume 1300 of Lecture Notes in Computer Science, chapter Broadcast and Other Primitive Operations on Fat-Trees. Springer, August 1997.
A. Bäumker, W. Dittrich, and F. M. auf der Heide. Truly efficent parallel algorithms: c-optimal multisearch for an extension of the BSP model. In Proceedings of the European Symposium on Algorithms, pages 17–30, 1995.
D. Culler, R. Karp, D. Patterson, A. Sahay, K. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: Towards a realistic model of parallel computation. In Proceedings of the 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 1–12, Mai 1993.
F. Dehne and A. Fabri. Scalable parallel computational geometry for coarse grained multicomputers. In Proceedings of ACM ninth Annual Computational Geometry, pages 298–307, 1993.
P. B. Gibbons, Y. Matias, and V. Ramachandran. Can shared-memory model serve as a bridging model for parallel computation? In ACM Symposium on Parallel Algorithms and Architectures, pages 72–83, 1997.
A. Grbic, S. Brown, S. Caranci, R. Grindley, M. Gusat, G. Lemieux, K. Loveless, N. Manjikian, S. Srbljic, M. Stumm, Z. Vranesic, and Z. Zilic. Design and implementation of the NUMAchine multiprocessor. In Proceedings of the 35th IEEE Design Automation Conference, San Francisco, CA, June 1998.
R. Grindley. The NUMAschine multiprocessor. In Proceedings of the international conference on parallel processing, Toronto Canada, August 2000.
D. B. Gustavson and Q. Li. The scalable coherant interface (SCI). IEEE Communications Magazine, 34(5):52–63, 1996.
S. E. Hambrusch and A. Khokhar. C 3: A parallel model for coarse-grained machines. Journal on Parallel and Distributed Computing, 32(2):139–154, 1996.
H. Hellwagner and A. Reinefeld, editors. SCI-Scalable Coherent Interface, volume 1734 of Lecture Notes in Computer Science. Springer Verlag, 1999.
B. Juurlink and H. Wijshoff. EURO-PAR 96, Parallel Processing, volume 1124 of Lecture Notes in Computer Science, chapter The E-BSP Model: Incorporating Unbalanced Communication and General Locality into the BSP Model, pages 339–347. Springer, August 1996.
K. G. Sevcik and S. Zhou. Performance benefits and limitations of large NUMA multiprocessors. In Performance, pages 183–204, Rome, Italy, September 1993.
Y. Tanaka, M. Matsuda, M. Ando, K. Kazuto, and M. Sato. IPPS Workshop on Personal Computer Based Networks of Workstations, volume 1388 of Lecture Notes in Computer Science, chapter COMPaS: A Pentium Pro PC-based SMP Cluster and its Experience, pages 486–497. 1998.
P. Torre and C. Kruskal. EURO-PAR 96, Parallel Processing, volume 1124 of Lecture Notes in Computer Science, chapter Submachine Locality in the Bulk Synchronous Setting, pages 352–358. Springer, August 1996.
L. G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103–111, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schmollinger, M., Kaufmann, M. (2002). κNUMA: A Model for Clusters of SMP-Machines. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2001. Lecture Notes in Computer Science, vol 2328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48086-2_5
Download citation
DOI: https://doi.org/10.1007/3-540-48086-2_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43792-5
Online ISBN: 978-3-540-48086-0
eBook Packages: Springer Book Archive