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

Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis最新文献

筛选
英文 中文
Non-blocking concurrency control in distributed database systems 分布式数据库系统中的非阻塞并发控制
Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis Pub Date : 1995-03-15 DOI: 10.1109/AISPAS.1995.401338
P. Krishna Reddy, S. Bhalla
{"title":"Non-blocking concurrency control in distributed database systems","authors":"P. Krishna Reddy, S. Bhalla","doi":"10.1109/AISPAS.1995.401338","DOIUrl":"https://doi.org/10.1109/AISPAS.1995.401338","url":null,"abstract":"Concurrency control based on conventional techniques requires additional efforts for deadlock detection and elimination. The possibility of a deadlock is also connected to the introduction of delays, and repeated restarts of transactions in deadlock cycles. In the proposed approach, a technique for generation of data flow precedence graphs among transactions at data sites has been studied. The local access graph approach is a fully distributed approach. Through local computations, the approach can prevent deadlocks in a distributed system.<<ETX>>","PeriodicalId":321580,"journal":{"name":"Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis","volume":"9 Suppl 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116798074","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
A journey into multicomputer routing algorithms 多计算机路由算法之旅
Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis Pub Date : 1995-03-15 DOI: 10.1109/AISPAS.1995.401359
M. Grammatikakis, D. Hsu, M. Kraetzl
{"title":"A journey into multicomputer routing algorithms","authors":"M. Grammatikakis, D. Hsu, M. Kraetzl","doi":"10.1109/AISPAS.1995.401359","DOIUrl":"https://doi.org/10.1109/AISPAS.1995.401359","url":null,"abstract":"We survey various aspects of packet routing, namely (partial) permutation, h-relation routing, routing to random destinations, dynamic routing, isotonic routing, fault tolerant routing, and related sorting results. We present theoretical results for general graphs and the hypercube topology, assuming both SIMD and MIMD communication models.<<ETX>>","PeriodicalId":321580,"journal":{"name":"Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131967247","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
On finding optimal clusterings of task graphs 关于寻找任务图的最优聚类
Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis Pub Date : 1995-03-15 DOI: 10.1109/AISPAS.1995.401333
W. Lowe, W. Zimmermann
{"title":"On finding optimal clusterings of task graphs","authors":"W. Lowe, W. Zimmermann","doi":"10.1109/AISPAS.1995.401333","DOIUrl":"https://doi.org/10.1109/AISPAS.1995.401333","url":null,"abstract":"Currently, many parallel algorithms are defined for shared memory architectures. The preferred machine model is the PRAM, but this model does not take into account properties of existing architectures that have a distributed memory and an asynchronous execution model. A transformation of PRAM programs into distributed, asynchronous ones is known. In order to produce not only correct but also efficient code the tasks have to be clustered. We introduce a parallel algorithm producing an optimal clustering for coarse grained task graphs with respect to the execution time on an asynchronous distributed random access machine, the A-DRAM. This machine model assumes distributed memory, asynchronous execution of tasks, computation costs, and communication delay.<<ETX>>","PeriodicalId":321580,"journal":{"name":"Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133480264","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
An experimental study of load balancing on Amoeba 变形虫负载平衡的实验研究
Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis Pub Date : 1995-03-15 DOI: 10.1109/AISPAS.1995.401345
Weiping Zhu, C. Steketee
{"title":"An experimental study of load balancing on Amoeba","authors":"Weiping Zhu, C. Steketee","doi":"10.1109/AISPAS.1995.401345","DOIUrl":"https://doi.org/10.1109/AISPAS.1995.401345","url":null,"abstract":"The paper presents the results of an experimental study of load balancing using job initiation and process migration, carried out on Amoeba (A.S. Tanenbaum et al., 1990). The results indicate the need for a load balancing facility in a distributed system to improve system performance, e.g., the average response time of processes. A number of load balancing algorithms, including the bidding and neighbouring algorithms, have been studied in this work. A comparison between these algorithms under various conditions is presented, which indicates that in a system with 10-20 computers, a centralized algorithm outperforms a distributed one and job initiation plays an important role in a load balancing scheme. We also point out some requirements for an operating system in order to support an efficient load balancing facility, on the basis of our experience. We conclude with a summary of our experiences and suggestions for further work.<<ETX>>","PeriodicalId":321580,"journal":{"name":"Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114895080","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}
引用次数: 12
Aizu supercomputer: a massively parallel system for virtual reality problems 会津超级计算机:用于虚拟现实问题的大规模并行系统
Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis Pub Date : 1995-03-15 DOI: 10.1109/AISPAS.1995.401355
T. Ikedo
{"title":"Aizu supercomputer: a massively parallel system for virtual reality problems","authors":"T. Ikedo","doi":"10.1109/AISPAS.1995.401355","DOIUrl":"https://doi.org/10.1109/AISPAS.1995.401355","url":null,"abstract":"The Aizu supercomputer is a massively parallel system suited to the solution of virtual reality problems and the support of multimedia applications. It employs a highly parallel MIMD architecture using a conflict-free internetwork system. The scalable communication system consists of two networks: a pyramid network and a reconfigurable network using optical links. The Aizu Supercomputer has a cluster configuration and a shared memory. Each PE includes 113 SPECmark and one cluster is organized with 8 PEs. In the trial production, the supercomputer will include 1365 PEs with more than 100 GFlops at peak performance.<<ETX>>","PeriodicalId":321580,"journal":{"name":"Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis","volume":"97 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120819483","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}
引用次数: 4
Logical timing (global synchronization of asynchronous arrays) 逻辑定时(异步阵列的全局同步)
Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis Pub Date : 1995-03-15 DOI: 10.1109/AISPAS.1995.401346
V. Varshavsky, V. Marakhovsky, T. Chu
{"title":"Logical timing (global synchronization of asynchronous arrays)","authors":"V. Varshavsky, V. Marakhovsky, T. Chu","doi":"10.1109/AISPAS.1995.401346","DOIUrl":"https://doi.org/10.1109/AISPAS.1995.401346","url":null,"abstract":"The problem of global synchronization is solved for asynchronous processor arrays and multiprocessor systems with an arbitrary interconnection graph. Global synchronization of asynchronous systems is treated as a homomorphic mapping of an asynchronous system behavior in logical time onto the behavior of the corresponding synchronous system with a common clock functioning in physical time. The solution is based on decomposing the system to the processor stratum and synchro-stratum; the latter plays the role of a global asynchronous clock. For the case of a synchronous system with two-phase master-slave synchronization, a simple implementation of the synchro-stratum for the corresponding asynchronous system is proposed. It is shown that, depending on the local behavior of the processors, the synchro-stratum is able to perform two types of global synchronization: parallel synchronization and synchronization that uses a system of synchro-waves.<<ETX>>","PeriodicalId":321580,"journal":{"name":"Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114895238","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}
引用次数: 19
Investigation of some hardware accelerators for relational algebra operations 关系代数运算硬件加速器的研究
Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis Pub Date : 1995-03-15 DOI: 10.1109/AISPAS.1995.401324
A. Nepomniaschaya, Y. Fet
{"title":"Investigation of some hardware accelerators for relational algebra operations","authors":"A. Nepomniaschaya, Y. Fet","doi":"10.1109/AISPAS.1995.401324","DOIUrl":"https://doi.org/10.1109/AISPAS.1995.401324","url":null,"abstract":"This paper is devoted to the application of specialized processors for speeding-up the realization of relational algebra operations on fine-grain SIMD computers. A short description of two processors is presented. By means of a special high level language STAR, the algorithms of implementation of relational algebra operations are described in a STARAN-like computer model, and then in the same model with attached processors. The comparison is made, corroborating the efficiency of the proposed co-processors.<<ETX>>","PeriodicalId":321580,"journal":{"name":"Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115144281","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}
引用次数: 4
Aspects of a distributed solution of the Brusselator equation Brusselator方程的分布解的方面
Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis Pub Date : 1995-03-15 DOI: 10.1109/AISPAS.1995.401347
T. Rauber, G. Runger
{"title":"Aspects of a distributed solution of the Brusselator equation","authors":"T. Rauber, G. Runger","doi":"10.1109/AISPAS.1995.401347","DOIUrl":"https://doi.org/10.1109/AISPAS.1995.401347","url":null,"abstract":"The spatial discretization of nonlinear partial differential equations (PDEs) results in large systems of nonlinear ordinary differential equations (ODEs). The discretization of the Brusselator equation is a characteristic example. For the parallel numerical solution of the Brusselator equation we use an iterated Runge-Kutta method. We propose modifications of the original method that exploit the access structure of the Brusselator equation. The implementation is realized on an Intel iPSC/860. A theoretical analysis of the resulting speedup values shows that the efficiency cannot be improved considerably.<<ETX>>","PeriodicalId":321580,"journal":{"name":"Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125946540","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}
引用次数: 6
Implementing a 3D multigrid algorithm on Fujitsu's vector parallel supercomputer 在富士通矢量并行超级计算机上实现三维多网格算法
Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis Pub Date : 1995-03-15 DOI: 10.1109/AISPAS.1995.401348
J. Wang, H. Lung, Y. Katsumata, T. Ishigai
{"title":"Implementing a 3D multigrid algorithm on Fujitsu's vector parallel supercomputer","authors":"J. Wang, H. Lung, Y. Katsumata, T. Ishigai","doi":"10.1109/AISPAS.1995.401348","DOIUrl":"https://doi.org/10.1109/AISPAS.1995.401348","url":null,"abstract":"Multigrid algorithms are well adopted by many engineering applications programs on the traditional sequential computers due to their good convergence behavior. In order to convert those existing resources to the field of parallel computing in a timely manner, an effective parallelization methodology should be set up to ease the conversion efforts and to take advantage of the power of parallel processing at the same time. We demonstrate how domain decomposition can be applied to the multigrid algorithm by means of a simple three-dimensional problem which is solved by a V-cycle scheme. The sequential code in FORTRAN provided by NASA NAS, known as the NAS multigrid parallel benchmark test, is being used in our current study. We have concluded that the parallelization methodology presented here would greatly reduce conversion efforts in the process of parallelization and would obtain very good performance and scalability on the Fujitsu's VPP500 computers.<<ETX>>","PeriodicalId":321580,"journal":{"name":"Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis","volume":"1727 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121782330","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
On the parallelization of loop nests containing while loops 关于包含while循环的循环巢的并行化
Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis Pub Date : 1995-03-15 DOI: 10.1109/AISPAS.1995.401360
C. Lengauer, M. Griebl
{"title":"On the parallelization of loop nests containing while loops","authors":"C. Lengauer, M. Griebl","doi":"10.1109/AISPAS.1995.401360","DOIUrl":"https://doi.org/10.1109/AISPAS.1995.401360","url":null,"abstract":"Recently, efforts have been made to devise automatic methods, based on a mathematical model, for the parallelization of loop nests with while loops. These methods are extensions of methods for the parallelization of nested for loops. As we present the theory, the parallelization of a nest of d loops is guaranteed to lay out one loop in time and d-l loops in space (one can trade off additional dimensions from space to time). The spacetime complexity of the target loop nest is equal to the time complexity of the source loop nest (whose space complexity is constant).<<ETX>>","PeriodicalId":321580,"journal":{"name":"Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132066807","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}
引用次数: 23
首页 上一页 下一页 尾页
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学术官方微信
小红书