发布求助
文献互助 智能选刊 最新文献

Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing最新文献

筛选
英文 中文
Parallel coding of moving images using fractals 使用分形的运动图像并行编码
Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing Pub Date : 1995-04-19 DOI: 10.1109/ICAPP.1995.472287
S. Andonova, D. Popovic, M. Kowalzik, M. Behrmann, J. Janneck
{"title":"Parallel coding of moving images using fractals","authors":"S. Andonova, D. Popovic, M. Kowalzik, M. Behrmann, J. Janneck","doi":"10.1109/ICAPP.1995.472287","DOIUrl":"https://doi.org/10.1109/ICAPP.1995.472287","url":null,"abstract":"A parallel fractal-based algorithm for predictive coding of a sequence of images is presented. The first frame in the sequence is fractal coded and transmitted. Each next frame is obtained as a motion compensated prediction by geometrically transforming the previous frame. The difference between the actual new frame and its prediction is fractal coded and transmitted to the receiver, in order to be used for the new frame reconstruction. A former-worker parallelization concept is used for parallel implementation of the computationally very extensive fractal-based video coding.<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128418240","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
A parallel-computation model for nonlinear electromagnetic field analysis by harmonic balance finite element method 谐波平衡有限元法非线性电磁场分析的并行计算模型
Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing Pub Date : 1995-04-19 DOI: 10.1109/ICAPP.1995.472267
Junwei Lu, Yao Li, Chengzheng Sun, S. Yamada
{"title":"A parallel-computation model for nonlinear electromagnetic field analysis by harmonic balance finite element method","authors":"Junwei Lu, Yao Li, Chengzheng Sun, S. Yamada","doi":"10.1109/ICAPP.1995.472267","DOIUrl":"https://doi.org/10.1109/ICAPP.1995.472267","url":null,"abstract":"This paper presents a parallel computation model for the time-periodic nonlinear electromagnetic field analysis in the frequency domain using harmonic balance finite element method (HBFEM). The proposed model, different from the traditional HBFEM technique that requires large memory and long CPU time, divides the global system matrix into a number of matrices in the frequency domain. Each computation unit has exactly the same number of elements and unknown values. The work involved in calculating the element matrices is equal, therefore the load can be well-balanced and the maximum speed-up will be M times if M processors are available (M is the number of harmonics considered in the electromagnetic field). The model is well-suited to MIMD parallel computer or multiple computers connected by local area networks.<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131280004","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}
引用次数: 3
The design of a simulation system for distributed task scheduling algorithms 设计了一个分布式任务调度算法仿真系统
Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing Pub Date : 1995-04-19 DOI: 10.1109/ICAPP.1995.472256
Jiannong Cao, M. Pole
{"title":"The design of a simulation system for distributed task scheduling algorithms","authors":"Jiannong Cao, M. Pole","doi":"10.1109/ICAPP.1995.472256","DOIUrl":"https://doi.org/10.1109/ICAPP.1995.472256","url":null,"abstract":"Task scheduling is an important part of any distributed computing environment. Distributed task scheduling algorithms aim at attaining increased performance of a distributed system by distributing the tasks of distributed programs onto the processors of the system. In designing a task scheduling mechanism, one needs to evaluate performance of task scheduling algorithms in order to decide among several algorithms or several versions of an algorithm. This paper describes the design of a general simulation system for distributed task scheduling algorithms. The design is highly modular and provides a system that can be configured and extended to simulate and evaluate different algorithms under different environments. The implementation of DisMimic, a prototype of the simulation system is also described. The framework described in this paper provides a basis of building toolbox to simplify the study of distributed task scheduling algorithms.<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116937349","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
Representation of client-server behaviour within parallel software designs 并行软件设计中客户机-服务器行为的表示
Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing Pub Date : 1995-04-19 DOI: 10.1109/ICAPP.1995.472182
I. Jelly, P. R. Croll, I. Gorton, C. I. Birkinshaw
{"title":"Representation of client-server behaviour within parallel software designs","authors":"I. Jelly, P. R. Croll, I. Gorton, C. I. Birkinshaw","doi":"10.1109/ICAPP.1995.472182","DOIUrl":"https://doi.org/10.1109/ICAPP.1995.472182","url":null,"abstract":"Parallel software design techniques based on client-server process models have been proposed to support the development of deadlock free systems. Deadlock freedom can be guaranteed where no client-server cycles occur in process graphs. Hierarchical composition rules are presented which allow the designer more freedom, including the use of cycles at a higher level. The incorporation of these design rules into a software development methodology, PARSE, is described. When PARSE is used in this manner, it provides the parallel software engineer with a powerful software development framework and permits direct design verification.<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116955282","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
Non-unimodular code generation for parallel machines 并行机器的非单模代码生成
Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing Pub Date : 1995-04-19 DOI: 10.1109/ICAPP.1995.472184
Jingling Xue
{"title":"Non-unimodular code generation for parallel machines","authors":"Jingling Xue","doi":"10.1109/ICAPP.1995.472184","DOIUrl":"https://doi.org/10.1109/ICAPP.1995.472184","url":null,"abstract":"Unimodular transformations have been used successfully in compiling programs for efficient execution on parallel machines. This paper discusses a number of code generation problems for which non-unimodular transformations are useful.<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116969090","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
A distribution independent algorithm for the reduction to tridiagonal form using one-sided rotations 一个分布无关的算法，用于减少到三对角线形式使用单侧旋转
Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing Pub Date : 1995-04-19 DOI: 10.1109/ICAPP.1995.472197
M. Hegland
{"title":"A distribution independent algorithm for the reduction to tridiagonal form using one-sided rotations","authors":"M. Hegland","doi":"10.1109/ICAPP.1995.472197","DOIUrl":"https://doi.org/10.1109/ICAPP.1995.472197","url":null,"abstract":"A scalable algorithm for the reduction to tridiagonal form of symmetric matrices is developed. It uses one-sided rotations instead of similarity transforms. This allows a data distribution independent implementation with low communication volume. Timings on the Fujitsu AP 1000 and VPP 500 show good performance.<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121896995","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}
引用次数: 2
A fault tolerant hierarchical interconnection network and its bandwidth analysis 一种容错分层互连网络及其带宽分析
Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing Pub Date : 1995-04-19 DOI: 10.1109/ICAPP.1995.472261
S. Mahmud, L. T. Samaratunga
{"title":"A fault tolerant hierarchical interconnection network and its bandwidth analysis","authors":"S. Mahmud, L. T. Samaratunga","doi":"10.1109/ICAPP.1995.472261","DOIUrl":"https://doi.org/10.1109/ICAPP.1995.472261","url":null,"abstract":"A number of hierarchical interconnection networks (HINs) has been proposed in the literature which can be used for building large cluster-based multiprocessors. It is very desirable that a HIN must be fault tolerant, because even a single fault in the network can completely disconnect a large number of processors and memory modules from the rest of the system. As a result, the performance of the system will decrease significantly. In this paper, we have proposed a HIN which can work under faulty conditions but with a slight degradation in performance. We have also developed analytical models to determine the performance of the proposed fault tolerant HIN. The analytical models have been validated by simulation models.<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115392341","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
Multithreaded self-scheduling: application of multithreading on loop scheduling for distributed shared memory multiprocessor 多线程自调度:多线程在分布式共享内存多处理器循环调度中的应用
Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing Pub Date : 1995-04-19 DOI: 10.1109/ICAPP.1995.472255
K. P. Hung, N. Yung, Y. Cheung
{"title":"Multithreaded self-scheduling: application of multithreading on loop scheduling for distributed shared memory multiprocessor","authors":"K. P. Hung, N. Yung, Y. Cheung","doi":"10.1109/ICAPP.1995.472255","DOIUrl":"https://doi.org/10.1109/ICAPP.1995.472255","url":null,"abstract":"A new loop scheduling scheme called multithreaded self-scheduling (MSS) for distributed shared memory multiprocessor is proposed. Based on the principles of multithreading, MSS attempts to hide the remote memory access latencies by switching between multiple contexts of threads. Consequently, loops scheduled by using MSS can obtain better performance comparing to the single-thread approaches. In this paper a series of simulation results corresponding to various parameter changes are presented, which provides a measure of the effectiveness of MSS under different boundary conditions and suggests the ways for further improvements.<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123655642","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
Efficient one-sided Jacobi algorithms for singular value decomposition and the symmetric eigenproblem 奇异值分解和对称特征问题的有效单侧Jacobi算法
Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing Pub Date : 1995-04-19 DOI: 10.1109/ICAPP.1995.472193
B. Zhou, R. Brent, M. Kahn
{"title":"Efficient one-sided Jacobi algorithms for singular value decomposition and the symmetric eigenproblem","authors":"B. Zhou, R. Brent, M. Kahn","doi":"10.1109/ICAPP.1995.472193","DOIUrl":"https://doi.org/10.1109/ICAPP.1995.472193","url":null,"abstract":"A method which uses one-sided Jacobi to solve singular valve decomposition and the symmetric eigen-valve problem in parallel is presented. We describe a parallel ring ordering for one-sided Jacobi computation. One distinctive feature of this ordering is that it can sort column norms in each sweep, which is very important to achieve fast convergence. Experimental results on both the Fujitsu AP1000 and the Fujitsu VPP500 are reported.<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"231 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123264308","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}
引用次数: 9
Memory design for row/column/diagonal access 行/列/对角线访问的存储器设计
Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing Pub Date : 1995-04-19 DOI: 10.1109/ICAPP.1995.472297
A. Iconomidou, N. Sharma
{"title":"Memory design for row/column/diagonal access","authors":"A. Iconomidou, N. Sharma","doi":"10.1109/ICAPP.1995.472297","DOIUrl":"https://doi.org/10.1109/ICAPP.1995.472297","url":null,"abstract":"Summary form only given. Vectorizing involves parallel access to data elements from a random access memory (RAM). However, a single memory module of conventional design can access no more than one word during each cycle of the memory clock. One common solution is to partition the memory into multiple modules or memory banks with address interleaving, leading to a number of disadvantages and restrictions over vectorizing. A different approach is to design memory modules with build-in access ability to commonly used array partitions. In this paper, a new memory organization is proposed, in which words can be formed row-wise, column-wise or diagonally at the control of an external input. The behavioral and structural representation of this design have been defined.<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129697481","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信