1994 International Conference on Parallel Processing Vol. 3最新文献_第2页

Message-Task Scheduling in Ojbect-Oriented Heterogeneous Guru Distributed DBMS 面向对象异构古鲁分布式DBMS中的消息任务调度

1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI: 10.1109/ICPP.1994.129

R. Joshi, G. Varma, Kuldip Singh

引用次数: 0

Schedulability: Real-Time Tasks Scheduling in a Multiprocessor System 可调度性:多处理器系统中的实时任务调度

1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI: 10.1109/ICPP.1994.176

G. Alijani, Farhad Jafari, Chen Wen-Shui

引用次数: 0

A Massively Parallel Algorithm for Compact Finite Difference Schemes 紧有限差分格式的大规模并行算法

1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI: 10.1109/ICPP.1994.33

Xian-He Sun, R. Joslin

引用次数: 6

Multicasting in Meshes 网格中的多播

1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI: 10.1109/ICPP.1994.132

E. Fleury, P. Fraigniaud

引用次数: 11

Derivation of Systolic Programs 收缩程序的推导

1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI: 10.1109/ICPP.1994.86

Ladan Kazerouni, B. Rajan, R. Shyamasundar

引用次数: 4

Triangulation on a Reconfigurable Mesh with Buses 带总线的可重构网格的三角剖分

1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI: 10.1109/ICPP.1994.193

M. Nigam, S. Sahni

引用次数: 5

Data-Parallel Spatial Join Algorithms 数据并行空间连接算法

1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI: 10.1109/ICPP.1994.82

E. Hoel, H. Samet

引用次数: 44

Parallel Graph Contraction with Applications to a Reconfigurable Parallel Architecture 可重构并行体系结构中的并行图收缩应用

1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI: 10.1109/ICPP.1994.149

Y. Lyuu, E. Schenfeld

{"title":"Parallel Graph Contraction with Applications to a Reconfigurable Parallel Architecture","authors":"Y. Lyuu, E. Schenfeld","doi":"10.1109/ICPP.1994.149","DOIUrl":"https://doi.org/10.1109/ICPP.1994.149","url":null,"abstract":"Communication plays a key role in the overall performance of a parallel system. In the general case, the communication network is required to transfer information from any set of sources to to any set of destinations. In practice, parallel applications have various communication needs. Many applications restrict their communication requests to a more limited number of possible connections between sources and destinations. The communication requests of parallel applications are represented by graphs. Parallel graph contraction has been used to embed these graphs into a reconfigurable parallel architecture. We review some of the previous work done in this area showing how various useful communication graphs (e.g., ring, kary trees, mesh, CCC, hypercube, etc.), can be contracted for an efficient embedding. We also present some results for the parallel contraction of other useful graphs such as de Bruijn, shuffle-exchange, mesh of trees, pyramid, and multi-stage communication structures. Lower bounds are proved for all graphs. A heuristic approach for parallel graph contraction is reviewed for irregular graphs based on simulated annealing.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"15 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":"129802798","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

Constant-Time Convexity Problems on Dense Reconfigurable Meshes 密集可重构网格上的常时间凸性问题

1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI: 10.1109/ICPP.1994.79

V. Bokka, H. Gurla, S. Olariu, J. Schwing

{"title":"Constant-Time Convexity Problems on Dense Reconfigurable Meshes","authors":"V. Bokka, H. Gurla, S. Olariu, J. Schwing","doi":"10.1109/ICPP.1994.79","DOIUrl":"https://doi.org/10.1109/ICPP.1994.79","url":null,"abstract":"Recently the authors have shown that the versatility of the reconfigurable mesh can be exploited to devise 0(1) time algorithms for a number of important computational tasks relevant to image processing, computer graphics, and computer vision. Specifically, we have shown that if one or two n-vertex (convex) polygons are pretiled, one vertex per processor, onto a reconfigurable mesh of size sqrt n X sqrt n, then a number of geometric problems can be solved in 0(1) time. These include testing an arbitrary polygon for convexity, the point location problem, the supporting lines problem, the stabbing problem, constructing the common tangents of two separable convex polygons, deciding whether two convex polygons intersect, and computing the smallest distance between the boundaries of two convex polygons. The novelty of these algorithms is that the problems are solved in the dense case. The purpose of this paper is to add to the list of problems that can be solved in 0(1) time in the dense case. The problems that we address are: determining the minimum area corner triangle for a convex polygon, determining the k-maximal vertices of a restricted class of convex polygons, updating the convex hull of a convex polygon in the presence of a set of query points, and determining a point that belongs to exactly one of two given convex polygons.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"36 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":"115697376","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

Using Contextual Knowledge to Improve Parallel Spoken Language Understanding 运用语境知识提高平行口语理解能力

1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI: 10.1109/ICPP.1994.195

Sang-Hwa Chung, D. Moldovan

引用次数: 0