{"title":"Experiences on implementing PARMACS macros to run the SPLASH-2 suite on multiprocessors","authors":"E. Artiaga, X. Martorell, Y. Becerra, N. Navarro","doi":"10.1109/EMPDP.1998.647181","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647181","url":null,"abstract":"In order to evaluate the goodness of parallel systems, it is necessary to know how parallel programs behave. The SPLASH-2 applications provide us with a realistic workload for such systems. So, we have made different implementations of the PARMACS macros used by SPLASH-2 applications, based on several execution and synchronization models, from classical Unix processes to multithreaded systems. Results have been tested in two different multiprocessor systems (Digital and Silicon Graphics). As parallel constructs in the SPLASH-2 applications are limited to those provided by PARMACS, we can easily study the overhead introduced by synchronization and parallelism management.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115508573","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Gerbessiotis, David Lecomber, Constantinos J. Siniolakis, K. R. Sujithan
{"title":"PRAM programming: theory vs. practice","authors":"A. Gerbessiotis, David Lecomber, Constantinos J. Siniolakis, K. R. Sujithan","doi":"10.1109/EMPDP.1998.647194","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647194","url":null,"abstract":"We investigate the practical viability of PRAM programming within the BSP framework. We argue that there is a necessity for PRAM computations in situations where the problem exhibits poor data locality. We introduce a C++ PRAM simulator that is built on top of the Oxford BSP Toolset, BSPlib, and provide a succinct PRAM language. Our approach achieves simplicity of programming over direct-mode BSP programming for reasonable overhead cost. We objectively compare optimized BSP algorithms with PRAM algorithms implemented with our library and provide encouraging experimental results for the latter style of programming.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116944847","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Implementation of parallel thinning algorithms on multicomputers: analysis of the work load balance","authors":"M. G. Montoya, I. García","doi":"10.1109/EMPDP.1998.647207","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647207","url":null,"abstract":"Practical implementation of two parallel thinning algorithms on a multicomputer system is described. The solution has been conceived for a multiprocessor using the SPMD (single program multiple data) programming model and executions has been carried out on a transputer based system. The main goal is to describe the authors' experiences on data partition/distribution among processors for parallel thinning algorithms as a representative type of algorithms where communications take place between neighbor processors and the work load for each processor depends on the input data. It is shown how the efficiency of the parallel implementation can be optimized through the application of a preprocess.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127176041","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Lam Wai-Kin, L. San-li, Cheuk Wai-Kong, Li Chi-Kwong
{"title":"The contractors-an alternative paradigm for worldwide virtual computing","authors":"Lam Wai-Kin, L. San-li, Cheuk Wai-Kong, Li Chi-Kwong","doi":"10.1109/EMPDP.1998.647203","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647203","url":null,"abstract":"Existing technology has made it possible that the entire range of machines, from personal computers to very high performance parallel supercomputers, be interconnected to become an integrated computational environment for users and programmers. However, efficient management of the huge amount of computation resources thus available remains as the greatest challenge to the designers of such metasystems. In this paper, we propose to have \"a layer of contractors\" as an alternative paradigm to the implementation of a single worldwide virtual computer. Our experience showed that the scope of a contractor can be extended easily to embrace machines beyond existing LAN boundaries.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125027710","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Method execution on a distributed image processing back-end","authors":"F. Niederl, A. Goller","doi":"10.1109/EMPDP.1998.647205","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647205","url":null,"abstract":"The rapid grow of both, the size of remote sensing data and the number of users in this field requires systems which are easy to use, platform independent and mighty. Currently, many users are not able to process or even access data the way they would like to. Utilizing upcoming technologies like WWW, Java and CORBA, we propose a distributed system that connects users, data bases and method bases. Latter ones help users to find an appropriate sequence of methods for processing, and incorporating a broker they schedule execution onto fast remote processing units (backends). We discuss design considerations concerning the interaction of the back-end with other system components, and strategies for effective job distribution.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114351749","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Providing nested parallelism and load balancing on message passing libraries","authors":"C. Rodríguez, F. D. Sande, C. León, L. García","doi":"10.1109/EMPDP.1998.647226","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647226","url":null,"abstract":"A programming methodology and its corresponding tool are presented. The tool expands the message passing library model (PVM, InmosC, MPI, ...), providing nested parallelism, the capacity to mix parallelism and recursion, processor virtualization, load balancing and support for collective operations among other features. Furthermore, as it is a valuable tool for the presentation and teaching of parallel algorithms, the computational results show an efficiency similar to that obtained using the native language.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132051816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Virtual cut-through implementation of the HB packet switching routing algorithm","authors":"P. Palazzari, M. Coli","doi":"10.1109/EMPDP.1998.647228","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647228","url":null,"abstract":"In the last years, since the early 80's, wormhole and virtual cut through routing modalities have replaced packet switching and circuit switching schemes. We give the theoretical bases to implement hole based (HB) routing algorithm (M. Coli and P. Palazzari, 1995) by using the virtual cut through modality. After reviewing the theory of HB routing, we demonstrate some theorems which allow us to use such a theory, developed for the packet switching case, also for the virtual cut through modality (HB-VCT routing algorithm). The main features of HB-VCT are its full adaptivity, the high fault tolerance capabilities and the low HW requirement. Furthermore, low latencies and high bandwidths are achievable because the use of virtual channels can be avoided. Some simulated results are presented in order to show the good traffic balance capabilities and the fault tolerant behavior of HB-VCT. Simulation is also used to show the influence on throughput of traffic intensity and of a HB-VCT control parameter (the timeout).","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130824536","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Jacobi-based algorithm for computing symmetric eigenvalues and eigenvectors in a two-dimensional mesh","authors":"D. Royo, M. Valero-García, Antonio González","doi":"10.1109/EMPDP.1998.647234","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647234","url":null,"abstract":"The paper proposes an algorithm for computing symmetric eigenvalues and eigenvectors that uses a one-sided Jacobi approach and is targeted to a multicomputer in which nodes can be arranged as a two-dimensional mesh with an arbitrary number of rows and columns. The algorithm is analysed through simple analytical models of execution time, which show that an adequate choice of the mesh configuration (number of rows and columns) can improve performance significantly, with respect to a one-dimensional configuration, which is the most frequently considered scenario in current proposals. This improvement is especially noticeable in large systems.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131177001","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Deadlock avoidance and adaptive routing in interconnection networks","authors":"J. Duato","doi":"10.1109/EMPDP.1998.647220","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647220","url":null,"abstract":"Networks of workstations are rapidly emerging as a cost effective alternative to parallel computers. Switch based interconnects with irregular topologies allow the wiring flexibility, scalability and incremental expansion capability required in this environment. The irregularity also makes routing and deadlock avoidance on such systems quite complicated. Current proposals avoid deadlock by removing cyclic dependencies between channels. As a consequence, many messages are routed following non minimal paths, therefore increasing latency and wasting resources. We describe a methodology for the design of adaptive routing algorithms for networks with irregular topology. The resulting algorithms allow messages to follow minimal paths in most cases, reducing message latency and balancing channel utilization. The proposed routing algorithms can be implemented simply by changing the routing tables and adding some links in parallel with existing links, taking advantage of spare switch ports. Alternatively, routing algorithms can be implemented by designing new switches that support virtual channels. Evaluation results show that the new routing algorithms are able to increase throughput by a factor of more than four for random traffic, also reducing latency.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123955321","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Effective scheduling in a mixed parallel and sequential computing environment","authors":"B. Zhou, X. Qu, R. Brent","doi":"10.1109/EMPDP.1998.647176","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647176","url":null,"abstract":"We describe a two-level scheduling scheme for mixed parallel and sequential workloads on scalable parallel machines. The design of this scheduling system is based on two principles, that is, parallel programs should be scheduled in a coordinated manner so that they will not severely interfere with each other and the performance for parallel compacting becomes predictable, and parallel programs may time-share resources with sequential programs so that the efficiency of processor utilisation can greatly be enhanced and good response to interactive clients can be maintained. We also discuss the organisation of a registration office through which the two-level scheduling is realised.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127402898","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}