Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -最新文献

筛选
英文 中文
A new distribution format for reshaped arrays in High Performance Fortran 高性能Fortran中重构数组的新分布格式
Hyun-Gyoo Yook, Mi-Soon Koo, Myong-Soon Park
{"title":"A new distribution format for reshaped arrays in High Performance Fortran","authors":"Hyun-Gyoo Yook, Mi-Soon Koo, Myong-Soon Park","doi":"10.1109/EMPDP.1998.647199","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647199","url":null,"abstract":"Data parallel languages designed for distributed memory computing environments provide a single global address space to the programmer. The mapping from this global address space to the distributed local address space is performed by a compiler, which does this mapping based on the array distribution format. Thus, each array in a data parallel language program has its own distribution format. The Reshape function changes the array distribution format as well as the array shape. However, the changed distribution format cannot be represented by any distribution format supported in current languages. Because there is no suitable distribution format, it is necessary to change the reshaped distribution format to an existing distribution format, with heavy overhead due to the redistribution function. To eliminate the redistribution step in Reshape function, we have proposed a new distribution format, HIER-CYCLIC, which can represent the reshaped distribution format. We have also proposed a language syntax to use HIER-CYCLIC and a compiling mechanism. Finally, we performed an experiment on an IBM-SP2 machine using a shift function.","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":"116649590","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}
引用次数: 0
Performance of the pipelined hash-join algorithm in a heterogeneous distributed environment 异构分布式环境下管道散列连接算法的性能
Z. S. Khan
{"title":"Performance of the pipelined hash-join algorithm in a heterogeneous distributed environment","authors":"Z. S. Khan","doi":"10.1109/EMPDP.1998.647237","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647237","url":null,"abstract":"A pipelined distributed parallel hash-join algorithm is executed in a distributed heterogeneous supercomputing environment which consists of the Connection Machine CM2, and the Cray C90. This algorithm implements the computationally intensive join operation of relational databases. The hash and join phases of the algorithm are executed on the architectures determined to be best suited for them. The hash phase of the algorithm is implemented on the Cray C90. The hashed data sets of the first join relation are transmitted from the Cray to the CM2. A pipeline is established between the two machines as the Cray continues to hash each page of the second join relation and transmits it to the CM2 where the join is performed. Limited improvements in performance of the pipelined algorithm for different combinations of data sizes, data distributions, and join sizes is analyzed and the limitations of the distributed environment are discussed.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"18 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":"125366180","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}
引用次数: 0
Parallel test generation using circuit partitioning and spectral techniques 并行测试生成使用电路划分和频谱技术
C. Gil, J. Ortega
{"title":"Parallel test generation using circuit partitioning and spectral techniques","authors":"C. Gil, J. Ortega","doi":"10.1109/EMPDP.1998.647208","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647208","url":null,"abstract":"The problem of testing digital circuits is becoming much more difficult as these circuits increase in size and complexity. Thus, the development of parallel procedures for test pattern generation is currently a field of important research activity. A new parallel procedure to determine the set of patterns to test a circuit is presented. It stems from a circuit partitioning scheme based on a mixed simulated annealing and tabu search technique which allows the load to be distributed among the processors in such a way that similar sized parts of the circuit are assigned to each processor while communications between processors are minimised. The method applied by each processor to obtain the test pattern uses an algorithm based on the Reed-Muller spectrum to determine the equation, thus being different from other procedures previously reported. The experimental results obtained by applying the procedure to the usual benchmark circuits in this field (ISCAS set) show good efficiencies which are maintained when the number of processors increases.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"30 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":"114625075","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}
引用次数: 11
Scheduling tasks in DAG to heterogeneous processor system 将DAG中的任务调度到异构处理器系统
Wai-Yip Chan, Chi-Kwong Li
{"title":"Scheduling tasks in DAG to heterogeneous processor system","authors":"Wai-Yip Chan, Chi-Kwong Li","doi":"10.1109/EMPDP.1998.647175","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647175","url":null,"abstract":"Heterogeneous processors configuration in parallel and distributed becomes a practical solution in modern parallel and distributed system. In order to execute tasks in such system with better performance, scheduling algorithms which support the configuration are needed. This paper starts with studying a technique called Heterogeneous List Scheduling Heuristic (HLS) for designing scheduling algorithm to schedule tasks into heterogeneous systems. With this, an experience of designing scheduling algorithm for scheduling task into heterogeneous system is described. This is done by modifying an algorithm called Relative Mobility, which is proposed by Chan and Li [2][3] for scheduling task into homogeneous system, to propose an algorithm called Heterogeneous Relative Mobility Scheduling algorithm (HRMS). Finally, an experiment is conducted to show some important properties as scheduling tasks into different configurations of processors.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"13 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":"131136481","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}
引用次数: 15
ParC++: a simple extension of C++ to parallel systems c++的一个简单的并行系统扩展
J. Sobral, A. Proença
{"title":"ParC++: a simple extension of C++ to parallel systems","authors":"J. Sobral, A. Proença","doi":"10.1109/EMPDP.1998.647233","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647233","url":null,"abstract":"The ParC++ system is an object oriented programming and execution environment, based on a programming model that aims the development of portable, efficient and scalable parallel applications. The paper presents the main components in the ParC++ system: a pre-processor-that supports a parallel extension to C++ objects and extracts parallelism from standard C++ code-and a run-time system-that dynamically adapts the grain size of parallel activities, according to the computing and communication system load.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"145 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":"133212665","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}
引用次数: 5
Scalable matrix multiplication algorithm for IRAM architecture machine IRAM架构机的可伸缩矩阵乘法算法
György Vesztergombi, G. Ódor, F. Rohrbach, G. Varga
{"title":"Scalable matrix multiplication algorithm for IRAM architecture machine","authors":"György Vesztergombi, G. Ódor, F. Rohrbach, G. Varga","doi":"10.1109/EMPDP.1998.647221","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647221","url":null,"abstract":"A scalable bit matrix machine model was proposed by us previously (G. Vesztergombi et al., 1997). Now we extend this IRAM type model for numerical calculations. The k digit numbers are represented in a bit parallel way, thus the number of rows in the memory is scaled up correspondingly, which means that the number of 1 bit CPUs is also increased proportionally. Still relying on the simple string communication interprocessor network, we prove that loading and multiplication of n/spl times/n matrices are executable in O(n) time. Speed estimates are calculated using emulation on the 8192 processor CERN-ASTRA machine.","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":"133714210","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}
引用次数: 1
Proposals toward an integrated design environment for complex embedded systems 关于复杂嵌入式系统综合设计环境的建议
J. Bass
{"title":"Proposals toward an integrated design environment for complex embedded systems","authors":"J. Bass","doi":"10.1109/EMPDP.1998.647209","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647209","url":null,"abstract":"Proposals for an integrated design environment to ease the design of complex embedded systems are presented. Complex embedded systems are distributed, typically to achieve demanding performance or dependability requirements, and must operate within hard real time constraints. Considerable effort is required to select optimal design solutions and ensure adherence to specified requirements. The proposed environment seeks to combine iterative and search/optimisation approaches to the design problem. Graphical modelling techniques are used for detailed analysis and to establish feasible design solutions. Integration of disparate detailed models, through co simulation, is desirable to enable the resolution of conflicting trade-offs.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"15 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":"129416727","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}
引用次数: 10
Theory and tool for estimating global time in parallel and distributed systems 估计并行和分布式系统中全局时间的理论和工具
R. Hofmann, Ursula Hilgers
{"title":"Theory and tool for estimating global time in parallel and distributed systems","authors":"R. Hofmann, Ursula Hilgers","doi":"10.1109/EMPDP.1998.647195","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647195","url":null,"abstract":"This article presents a method and a tool for estimating a global time base from local event traces. These event traces result from monitoring parallel and distributed systems of arbitrary topology, where the processors are working on a common application. The method relies on stability properties of physical clocks and on the causality relationships of cooperating processes. The tool copes with arbitrary communication structures, event trace formats, and any number of different clocks.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"15 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":"133460525","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}
引用次数: 20
Automatic performance evaluation of parallel programs 并行程序的自动性能评估
Antonio Espinosa, T. Margalef, E. Luque
{"title":"Automatic performance evaluation of parallel programs","authors":"Antonio Espinosa, T. Margalef, E. Luque","doi":"10.1109/EMPDP.1998.647178","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647178","url":null,"abstract":"Traditional parallel programming forces the programmer, apart from designing the application, to analyse the performance of this recently built application. This difficult task of testing the behaviour of the program can be avoided with the use of an automatic performance analysis tool. Users are released from having to understand the enormous amount of performance information obtained from the execution of a program. The automatic analysis bases its work on the use of a predefined list of logical rules of production of performance problems. These rules form the \"knowledge base\" of the tool. When the tool analyses an application, it looks for the occurrence of an element in the list of performance problems recorded in the \"knowledge base\". When one of the problems is found (a \"match\" in the list), the tool analyses the cause of the performance problem and builds a recommendation to the user to direct the possible modifications the code of the application.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"211 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114018104","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}
引用次数: 45
Taking the distributed nature of cooperative work seriously 重视协作工作的分布式特性
C. Simone, K. Schmidt
{"title":"Taking the distributed nature of cooperative work seriously","authors":"C. Simone, K. Schmidt","doi":"10.1109/EMPDP.1998.647212","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647212","url":null,"abstract":"For CSCW facilities to be effective and viable, the inherently distributed nature of cooperative work must matched by a radically distributed environment. On the basis of a scenario derived from field studies, the paper describes a CSCW environment which supports the distributed construction and use of malleable and linkable coordination mechanisms.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"72 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":"114399222","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}
引用次数: 21
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书