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

1994 International Conference on Parallel Processing Vol. 3最新文献

筛选
英文 中文
Panel Sessions 小组会议
1994 International Conference on Parallel Processing Vol. 3 Pub Date : 2018-10-01 DOI: 10.1109/iecon.2018.8591612
{"title":"Panel Sessions","authors":"","doi":"10.1109/iecon.2018.8591612","DOIUrl":"https://doi.org/10.1109/iecon.2018.8591612","url":null,"abstract":"","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"204 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115714698","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 Algorithms for the Two-Dimensional Discrete Wavelet Transform 二维离散小波变换的并行算法
1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI: 10.1109/ICPP.1994.148
D. Krishnaswamy, M. Orchard
{"title":"Parallel Algorithms for the Two-Dimensional Discrete Wavelet Transform","authors":"D. Krishnaswamy, M. Orchard","doi":"10.1109/ICPP.1994.148","DOIUrl":"https://doi.org/10.1109/ICPP.1994.148","url":null,"abstract":"We present in this paper two parallel algorithms for the two-dimensional discrete wavelet transform. A mathematical model for the computation vs. communication tradeoff for these algorithms is presented and the scalability of the algorithms is analyzed. The wormhole routing model was used to model the communication costs involved. The algorithms were implemented on the Connection Machine-5 (CM-5^{a}). The theoretical results obtained were validated by the simulations on the CM-5.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"88 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122330296","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
Time-Optimal Multiple Rank Computations on Meshes with Multiple Broadcasting 多重广播网格的时间最优多重秩计算
1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI: 10.1109/ICPP.1994.191
D. Bhagavathi, V. Bokka, H. Gurla, R. Lin, S. Olariu, J. Schwing, W. Shen, L. Wilson
{"title":"Time-Optimal Multiple Rank Computations on Meshes with Multiple Broadcasting","authors":"D. Bhagavathi, V. Bokka, H. Gurla, R. Lin, S. Olariu, J. Schwing, W. Shen, L. Wilson","doi":"10.1109/ICPP.1994.191","DOIUrl":"https://doi.org/10.1109/ICPP.1994.191","url":null,"abstract":"Consider arbitrary collections A = a_1,a_2,.. .,a_n of items and Q = q_1,q_2,...,q_m (1 leqslant mn leqslant n) of queries from a totally ordered universe. The multiple rank problem involves computing for every query qi the number of items in A that have a lesser value. Our contribution is to show that the problem at hand can be solved time-optimally on meshes with multiple broadcasting. More specifically, if the collection A is siored in some order one item per processor and if Q is stored one query per processor in the leftmost frac{m} {{sqrt n }} columns of a mesh with multiple broadcasting of size sqrt n x /sqrt n, the corresponding instance of the multiple rank problem can be solved in Theta left( {m^{frac{1} {3}} n^{frac{1} {6}} } right) time. As an application we present a time-optimal algorithm to compute the histogram of a m-level gray image of size sqrt n x sqrt n in Theta left( {m^{frac{1} {3}} n^{frac{1} {6}} } right) time.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127915602","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
An Empirical Study of the I Test for Exact Data Dependence 精确数据依赖I检验的实证研究
1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI: 10.1109/ICPP.1994.55
K. Psarris, S. Pande
{"title":"An Empirical Study of the I Test for Exact Data Dependence","authors":"K. Psarris, S. Pande","doi":"10.1109/ICPP.1994.55","DOIUrl":"https://doi.org/10.1109/ICPP.1994.55","url":null,"abstract":"Parallelizing Compilers rely upon subscript analysis to detect data dependences between pairs of array references inside loop nests. The most widely used approximate subscript analysis tests are the GCD test and the Banerjee test. In an earlier work we proposed the I test, an improved subscript analysis test. The I test extends the accuracy of a combination of the GCD test and the Banerjee test. It is also able to provide exact data dependence information at no additional computation cost. In the present work we perform an empirical study on the Perfect Club benchmarks to demonstrate the effectiveness and practical importance of the I Test. We compare its performance with that of the GCD test and the Banerjee test. We show that the I test is always an exact test in practice.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133495987","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}
引用次数: 8
Distributed Algorithms for Constructing a Depth-First-Search Tree 构造深度优先搜索树的分布式算法
1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI: 10.1109/ICPP.1994.91
S. Makki, G. Havas
{"title":"Distributed Algorithms for Constructing a Depth-First-Search Tree","authors":"S. Makki, G. Havas","doi":"10.1109/ICPP.1994.91","DOIUrl":"https://doi.org/10.1109/ICPP.1994.91","url":null,"abstract":"We present more efficient distributed depth-firstsearch algorithms which construct a depth-first-search tree for a communication network. The algorithms require left| V right|(1 + r) messages and |V|(l + r) units of time in the worst case, where left| V right| is the number of sites in the network, and 0 leqslant r le 1 . The value of r depends on the network topology and possibly on the routing chosen. In the best case, when the underlying network has a ring topology, r = 0 and our basic algorithm requires V messages and time units, regardless of routing. We extend this algorithm to achieve the same best case bound for other topologies. The worst case bound, which has r = 1¿2/left| V right|, applies if the network topology is a tree. The improvement over the best of previous algorithms is achieved by dynamic backtracking, with a minor increase in message length.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127839726","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}
引用次数: 47
Parallel Logic Synthesis Using Partitioning 基于分划的并行逻辑综合
1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI: 10.1109/ICPP.1994.150
K. De, P. Banerjee
{"title":"Parallel Logic Synthesis Using Partitioning","authors":"K. De, P. Banerjee","doi":"10.1109/ICPP.1994.150","DOIUrl":"https://doi.org/10.1109/ICPP.1994.150","url":null,"abstract":"In this paper, we present a partitioning approach of parallel logic synthesis, which is different from the previous approaches which involved parallelization of individual operations within the synthesis algorithm. We partition the given logic circuits and distribute the partitions to different processors for synthesis. For good load balancing, partitioning algorithm is tuned so that the estimated synthesis times of individual partitions are equal. To improve the quality of synthesized circuits, we propose a novel iterative repartitioning and resynthesis approach to parallel logic synthesis. Experimental evaluation in several large circuits are shown on a network of workstations, and results are compared with MIS.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127413664","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
A Modeling Paradigm for Multidatabases 多数据库的建模范式
1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI: 10.1109/ICPP.1994.35
S. K. Damodaran-Kamal, J. Francioni, N. Pissinou
{"title":"A Modeling Paradigm for Multidatabases","authors":"S. K. Damodaran-Kamal, J. Francioni, N. Pissinou","doi":"10.1109/ICPP.1994.35","DOIUrl":"https://doi.org/10.1109/ICPP.1994.35","url":null,"abstract":"One component of efficient object management in large multidatabase systems is efficient object identification. This paper defines and formalizes concepts related to decentralized object identifier assignment, and presents a model for object identification, shared access and communication in a multidatabase domain.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131080774","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 Backjumping Search Algorithm for a Distributed Memory Multicomputer 分布式内存多计算机的回跳搜索算法
1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI: 10.1109/ICPP.1994.13
J. Conrad, J. Mathew
{"title":"A Backjumping Search Algorithm for a Distributed Memory Multicomputer","authors":"J. Conrad, J. Mathew","doi":"10.1109/ICPP.1994.13","DOIUrl":"https://doi.org/10.1109/ICPP.1994.13","url":null,"abstract":"Solving Constraint Satisfaction Problems (CSPs) has been subject to intense study by earlier researchers because CSPs can be used to model a whole variety of practical real world problems. This work involves investigation of the performance of parallel backtracking algorithms for solving CSPs. Two classes of backtracking search algorithms are considered: i) chronological backtracking, and ii) dependency directed backtracking, called backjumping. Results show that the new parallel backjumping algorithm retains the efficiency that the sequential algorithm exhibits, while realizing twice the speedup of parallel backtracking for random constraint networks.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132042160","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 Fast, Partially Parallelizable Algorithm for Predicting Execution Time of EQL Rule-Based Programs 基于EQL规则的程序执行时间预测的快速、部分可并行算法
1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI: 10.1109/ICPP.1994.24
Jeng-Rung Chen, A. Cheng
{"title":"A Fast, Partially Parallelizable Algorithm for Predicting Execution Time of EQL Rule-Based Programs","authors":"Jeng-Rung Chen, A. Cheng","doi":"10.1109/ICPP.1994.24","DOIUrl":"https://doi.org/10.1109/ICPP.1994.24","url":null,"abstract":"Real-time expert systems are embedded decision systems which must respond to changes in the environments within stringent timing constraints. A major problem impeding the use of rule-based expert systems in real-time environments is the difficulty in predicting the response time of these rule-based systems. In this paper, we tackle this problem with a fast, partially parallelizable response time analysis algorithm for a class of EQL rule-based programs with constant assignments in the action parts of the rules.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130408781","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
Efficient Component Labeling on SIMD Mesh Processors SIMD网格处理器的高效组件标记
1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI: 10.1109/ICPP.1994.99
Whanki Yong, M. Brady
{"title":"Efficient Component Labeling on SIMD Mesh Processors","authors":"Whanki Yong, M. Brady","doi":"10.1109/ICPP.1994.99","DOIUrl":"https://doi.org/10.1109/ICPP.1994.99","url":null,"abstract":"A new component labeling algorithm for SIMD meshes is presented whose time complexity is O(frac{{n^2 }} {{p^2 }} + n) for an n ¿ n image on a p ¿ p mesh. The algorithm is efficient in terms of total work for p leqslant n^{frac{1} {2}} . It was evaluated on a MasPar MP-1 with 1K processors and 64KB of memory per processor. For most of the 1K ¿ 1K size test inputs, our algorithm is faster than a neighbor updating algorithm that is extremely simple but asymptotically slower on images of large diameter.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121804144","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
下一页 尾页
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学术官方微信