{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T23:20:09Z","timestamp":1648596009930},"reference-count":5,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2003,2]]},"abstract":"<jats:p> Clusters of symmetric multiprocessor nodes (SMP clusters) are one of the most important parallel architectures at the moment. The architecture consists of shared-memory nodes with multiple processors and a fast interconnection network between the nodes. New programming models try to exploit this architecture by using threads in the nodes and using message-passing-libraries for inter-node communication. In order to develop efficient algorithms, it is necessary to consider the hybrid nature of the architecture and of the programming models. We present the \u03baNUMA-model and a methodology that build a good base for designing efficient algorithms for SMP clusters. The \u03baNUMA-model is a computational model that extends the bulk-synchronous parallel (BSP) model with the characteristics of SMP clusters and new hybrid programming models. The \u03baNUMA-methodology suggests to develop efficient overall algorithms by developing efficient algorithms for each level in the hierarchy. We use the problem of personalized one-to-all-broadcast and the dense matrix-vector-multiplication for the presentation. The theoretical results of the analysis of the dense matrix-vector-multiplication are verified practically. We show results of experiments, made on a Linux-cluster of dual Pentium-III nodes. <\/jats:p>","DOI":"10.1142\/s0129054103001595","type":"journal-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T00:53:09Z","timestamp":1056502389000},"page":"59-78","source":"Crossref","is-referenced-by-count":0,"title":["DESIGNING PARALLEL ALGORITHMS FOR HIERARCHICAL SMP CLUSTERS"],"prefix":"10.1142","volume":"14","author":[{"given":"MARTIN","family":"SCHMOLLINGER","sequence":"first","affiliation":[{"name":"Wilhelm-Schickard-Institut f\u00fcr Informatik, Universit\u00e4t T\u00fcbingen, Sand 13, 72076 T\u00fcbingen, Germany"}]},{"given":"MICHAEL","family":"KAUFMANN","sequence":"additional","affiliation":[{"name":"Wilhelm-Schickard-Institut f\u00fcr Informatik, Universit\u00e4t T\u00fcbingen, Sand 13, 72076 T\u00fcbingen, Germany"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1999.1541"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"rf17","volume":"23","author":"Helman D. R.","journal-title":"Informatica: An International Journal of Computing and Informatics"},{"key":"rf25","volume-title":"An Introduction to Parallel Algorithms","author":"J\u00e1J\u00e1 J.","year":"1992"},{"key":"rf26","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0015236"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054103001595","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:26:35Z","timestamp":1565191595000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054103001595"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":5,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2003,2]]}},"alternative-id":["10.1142\/S0129054103001595"],"URL":"https:\/\/doi.org\/10.1142\/s0129054103001595","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}