Pub Date : 1993-04-13DOI: 10.1109/IPPS.1993.262900
D. Chen, S. Guha
The authors show that, in parallel, an n-vertex simple polygon can be tested for monotonicity optimally in O(logn) time using O(n/logn) EREW PRAM processors, and present two different optimal parallel algorithms for solving this problem. Their result leads to an optimal parallel algorithm for triangulating monotone polygons that takes O(logn) time using O(n/logn) EREW PRAM processors.<>
{"title":"Testing a simple polygon for monotonicity optimally in parallel","authors":"D. Chen, S. Guha","doi":"10.1109/IPPS.1993.262900","DOIUrl":"https://doi.org/10.1109/IPPS.1993.262900","url":null,"abstract":"The authors show that, in parallel, an n-vertex simple polygon can be tested for monotonicity optimally in O(logn) time using O(n/logn) EREW PRAM processors, and present two different optimal parallel algorithms for solving this problem. Their result leads to an optimal parallel algorithm for triangulating monotone polygons that takes O(logn) time using O(n/logn) EREW PRAM processors.<<ETX>>","PeriodicalId":248927,"journal":{"name":"[1993] Proceedings Seventh International Parallel Processing Symposium","volume":"50 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120888979","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}
Pub Date : 1993-04-13DOI: 10.1109/IPPS.1993.262799
Minhwa Chung, D. Moldovan
The paper presents a parallel natural language processing system implemented on a marker-passing parallel AI computer, Semantic Network Array Processor (SNAP). The system uses a memory-based parsing approach in which parsing is viewed as a memory search process. Linguistic information is stored as phrasal patterns in a semantic network knowledge base distributed over the memory of the parallel computer. Parsing is performed by recognizing and linking linguistic patterns that reflect a sentence interpretation. This is achieved via propagating markers over the distributed network. The authors have developed a system capable of processing newswire articles from a particular domain. The paper presents the structure of the system, the memory-based parsing method used, and performance results obtained.<>
{"title":"Parallel memory-based parsing on SNAP","authors":"Minhwa Chung, D. Moldovan","doi":"10.1109/IPPS.1993.262799","DOIUrl":"https://doi.org/10.1109/IPPS.1993.262799","url":null,"abstract":"The paper presents a parallel natural language processing system implemented on a marker-passing parallel AI computer, Semantic Network Array Processor (SNAP). The system uses a memory-based parsing approach in which parsing is viewed as a memory search process. Linguistic information is stored as phrasal patterns in a semantic network knowledge base distributed over the memory of the parallel computer. Parsing is performed by recognizing and linking linguistic patterns that reflect a sentence interpretation. This is achieved via propagating markers over the distributed network. The authors have developed a system capable of processing newswire articles from a particular domain. The paper presents the structure of the system, the memory-based parsing method used, and performance results obtained.<<ETX>>","PeriodicalId":248927,"journal":{"name":"[1993] Proceedings Seventh International Parallel Processing Symposium","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133785069","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}
Pub Date : 1993-04-13DOI: 10.1109/IPPS.1993.262787
Garng M. Huang, Xiao Zhu, W. Hsieh
Parallel implementation issues of the textured algorithm to solve the optimal routing problem (ORP) in data networks is investigated. The textured model decomposes a large data network into a multi-level structure, each level contains a few subnetworks and each subnetwork is controlled by a local processor (e.g. an internet gateway). Subnetworks of the same level are not overlapped with each other, subnetworks on different levels overlap partially. Compared with solving the ORP globally, the textured algorithm clearly saves computation time and has better precision since parallel computation is applied to smaller scale subproblems at each level. On the other hand, synchronization overhead among local processors needs to be addressed. It is shown that due to the characteristics of the textured algorithm, its synchronization overhead can be managed to remain a constant as the size of network increases since one only needs to exchange data among neighboring processors.<>
{"title":"Parallel implementation issues of the textured algorithm for optimal routing in data networks","authors":"Garng M. Huang, Xiao Zhu, W. Hsieh","doi":"10.1109/IPPS.1993.262787","DOIUrl":"https://doi.org/10.1109/IPPS.1993.262787","url":null,"abstract":"Parallel implementation issues of the textured algorithm to solve the optimal routing problem (ORP) in data networks is investigated. The textured model decomposes a large data network into a multi-level structure, each level contains a few subnetworks and each subnetwork is controlled by a local processor (e.g. an internet gateway). Subnetworks of the same level are not overlapped with each other, subnetworks on different levels overlap partially. Compared with solving the ORP globally, the textured algorithm clearly saves computation time and has better precision since parallel computation is applied to smaller scale subproblems at each level. On the other hand, synchronization overhead among local processors needs to be addressed. It is shown that due to the characteristics of the textured algorithm, its synchronization overhead can be managed to remain a constant as the size of network increases since one only needs to exchange data among neighboring processors.<<ETX>>","PeriodicalId":248927,"journal":{"name":"[1993] Proceedings Seventh International Parallel Processing Symposium","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128703826","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}
Pub Date : 1993-04-13DOI: 10.1109/IPPS.1993.262833
A. Khokhar, Wei-Ming Lin
The authors present parallel techniques to implement two vision tasks; stereo matching and image matching using linear features as primitives. The implementations are performed on a fixed size linear array and achieve processor-time optimal performance. For stereo matching, they propose an O(Nn/sup 3//P) time algorithm on a P-processor linear array, where N is the number of line segments in one image, n is the number of line segments in a window determined by the object size, and P>
{"title":"Stereo and image matching on fixed size linear arrays","authors":"A. Khokhar, Wei-Ming Lin","doi":"10.1109/IPPS.1993.262833","DOIUrl":"https://doi.org/10.1109/IPPS.1993.262833","url":null,"abstract":"The authors present parallel techniques to implement two vision tasks; stereo matching and image matching using linear features as primitives. The implementations are performed on a fixed size linear array and achieve processor-time optimal performance. For stereo matching, they propose an O(Nn/sup 3//P) time algorithm on a P-processor linear array, where N is the number of line segments in one image, n is the number of line segments in a window determined by the object size, and P<or=n. The sequential algorithm takes O(Nn/sup 3/) time. They also propose a partitioned parallel implementation of image matching with an O((nm/P+P)nm) time performance achieved on a P-processor linear array, where n is the number of line segments in the image, m is the number of line segments in the model and P<or=nm. This leads to a processor-time optimal solution for P<or= square root nm. Previously known approaches to the image matching problem take O(n/sup 3/m/sup 3/) time.<<ETX>>","PeriodicalId":248927,"journal":{"name":"[1993] Proceedings Seventh International Parallel Processing Symposium","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129277460","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}
Pub Date : 1993-04-13DOI: 10.1109/IPPS.1993.262857
A. Lingas, A. Maheshwari, J. Sack
The authors provide optimal parallel solutions to several fundamental link distance problems set in trapezoided rectilinear polygons. All parallel algorithms are deterministic, run in logarithmic time, have an optimal time-processor product and are designed to run on EREW PRAM. The authors develop techniques (e.g. rectilinear window partition) for solving link distance problems in parallel which are expected to find applications in the design of other parallel computational geometry algorithms. They employ these parallel techniques for example to compute the link diameter, link center, and central diagonal of a rectilinear polygon. Their results also imply an optimal linear-time sequential algorithm for constructing a data structure to support rectilinear link distance queries between points.<>
{"title":"Parallel algorithms for rectilinear link distance problems","authors":"A. Lingas, A. Maheshwari, J. Sack","doi":"10.1109/IPPS.1993.262857","DOIUrl":"https://doi.org/10.1109/IPPS.1993.262857","url":null,"abstract":"The authors provide optimal parallel solutions to several fundamental link distance problems set in trapezoided rectilinear polygons. All parallel algorithms are deterministic, run in logarithmic time, have an optimal time-processor product and are designed to run on EREW PRAM. The authors develop techniques (e.g. rectilinear window partition) for solving link distance problems in parallel which are expected to find applications in the design of other parallel computational geometry algorithms. They employ these parallel techniques for example to compute the link diameter, link center, and central diagonal of a rectilinear polygon. Their results also imply an optimal linear-time sequential algorithm for constructing a data structure to support rectilinear link distance queries between points.<<ETX>>","PeriodicalId":248927,"journal":{"name":"[1993] Proceedings Seventh International Parallel Processing Symposium","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134447911","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}
Pub Date : 1993-04-13DOI: 10.1109/IPPS.1993.262778
Zhigang Chen, Weijia Shang
The paper addresses the problem of mapping uniform dependence algorithms onto fixed size processor arrays. The optimal computation time of executing uniform dependence algorithm on a fixed size processor array is first discussed. A mapping and partitioning method for 2-dimensional algorithms (algorithms with doubly nested loops) which can achieve near optimal computation time is proposed. Necessary and sufficient conditions are presented for a given pair of schedule and partition to be time optimal. The inefficient utilization of processors is caused by the boundary time steps. For a given pair of schedule and partition vectors, the number of boundary time steps is identified. Also, the amount of external communication, which is the communication between blocks of a partition, by a given pair of schedule and partition vectors is studied. Issues concerning minimizing boundary time steps and external communication are discussed.<>
{"title":"Mapping of uniform dependence algorithm onto fixed size processor arrays","authors":"Zhigang Chen, Weijia Shang","doi":"10.1109/IPPS.1993.262778","DOIUrl":"https://doi.org/10.1109/IPPS.1993.262778","url":null,"abstract":"The paper addresses the problem of mapping uniform dependence algorithms onto fixed size processor arrays. The optimal computation time of executing uniform dependence algorithm on a fixed size processor array is first discussed. A mapping and partitioning method for 2-dimensional algorithms (algorithms with doubly nested loops) which can achieve near optimal computation time is proposed. Necessary and sufficient conditions are presented for a given pair of schedule and partition to be time optimal. The inefficient utilization of processors is caused by the boundary time steps. For a given pair of schedule and partition vectors, the number of boundary time steps is identified. Also, the amount of external communication, which is the communication between blocks of a partition, by a given pair of schedule and partition vectors is studied. Issues concerning minimizing boundary time steps and external communication are discussed.<<ETX>>","PeriodicalId":248927,"journal":{"name":"[1993] Proceedings Seventh International Parallel Processing Symposium","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130029754","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}
Pub Date : 1993-04-13DOI: 10.1109/IPPS.1993.262773
John Krystynak, B. Nitzberg
Typical scientific applications require vast amounts of processing power coupled with significant I/O capacity. Highly parallel computer systems can provide processing power at low cost, but have historically lacked I/O capacity. By evaluating the performance and scalability of the Intel iPSC/860 Concurrent File System and the Connection Machine DataVault, one can get an idea of the current state of parallel I/O performance. The performance tests show that both systems are able to achieve 70% of peak I/O throughput.<>
{"title":"Performance characteristics of the iPSC/860 and CM-2 I/O systems","authors":"John Krystynak, B. Nitzberg","doi":"10.1109/IPPS.1993.262773","DOIUrl":"https://doi.org/10.1109/IPPS.1993.262773","url":null,"abstract":"Typical scientific applications require vast amounts of processing power coupled with significant I/O capacity. Highly parallel computer systems can provide processing power at low cost, but have historically lacked I/O capacity. By evaluating the performance and scalability of the Intel iPSC/860 Concurrent File System and the Connection Machine DataVault, one can get an idea of the current state of parallel I/O performance. The performance tests show that both systems are able to achieve 70% of peak I/O throughput.<<ETX>>","PeriodicalId":248927,"journal":{"name":"[1993] Proceedings Seventh International Parallel Processing Symposium","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129931004","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}
Pub Date : 1993-04-13DOI: 10.1109/IPPS.1993.262806
Arunabha Sen, A. Sengupta, S. Bandyopadhyay
Hamiltonian properties of hypercube, incomplete hypercube and supercube are examined. It is known that in a nonfaulty hypercube there are at least n! Hamiltonian cycles. The authors extend this result showing that the lower bound is at least 2/sup n-3/n! They show that with at most n-2 faulty links a faulty hypercube has at least 2(n-2)! Hamiltonian cycles. They establish that an incomplete hypercube with odd (even) number of nodes has (n-2)! Hamiltonian paths (cycles). They show that a supercube has at least (n-1)! Hamiltonian cycles and when the number of nodes is 2/sup n-1/+2/sup n-2/, then the number of Hamiltonian cycles is at least as high as 2(n-1)!.<>
{"title":"On some topological properties of hypercube, incomplete hypercube and supercube","authors":"Arunabha Sen, A. Sengupta, S. Bandyopadhyay","doi":"10.1109/IPPS.1993.262806","DOIUrl":"https://doi.org/10.1109/IPPS.1993.262806","url":null,"abstract":"Hamiltonian properties of hypercube, incomplete hypercube and supercube are examined. It is known that in a nonfaulty hypercube there are at least n! Hamiltonian cycles. The authors extend this result showing that the lower bound is at least 2/sup n-3/n! They show that with at most n-2 faulty links a faulty hypercube has at least 2(n-2)! Hamiltonian cycles. They establish that an incomplete hypercube with odd (even) number of nodes has (n-2)! Hamiltonian paths (cycles). They show that a supercube has at least (n-1)! Hamiltonian cycles and when the number of nodes is 2/sup n-1/+2/sup n-2/, then the number of Hamiltonian cycles is at least as high as 2(n-1)!.<<ETX>>","PeriodicalId":248927,"journal":{"name":"[1993] Proceedings Seventh International Parallel Processing Symposium","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127413807","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}
Pub Date : 1993-04-13DOI: 10.1109/IPPS.1993.262895
Vipul Gupta, E. Schenfeld
The problem of identifying whether a graph has a bounded l-contraction for a given integer l is known to be NP-complete for l>2. The authors describe a heuristic approach based on simulated annealing to approximate the solution of this problem. Performance results of their algorithm on graphs representing classical topologies (e.g. trees, grids, hypercubes and cube connected cycles), are presented as well.<>
{"title":"A heuristic approach for embedding communication patterns in an interconnection cached parallel processing network","authors":"Vipul Gupta, E. Schenfeld","doi":"10.1109/IPPS.1993.262895","DOIUrl":"https://doi.org/10.1109/IPPS.1993.262895","url":null,"abstract":"The problem of identifying whether a graph has a bounded l-contraction for a given integer l is known to be NP-complete for l>2. The authors describe a heuristic approach based on simulated annealing to approximate the solution of this problem. Performance results of their algorithm on graphs representing classical topologies (e.g. trees, grids, hypercubes and cube connected cycles), are presented as well.<<ETX>>","PeriodicalId":248927,"journal":{"name":"[1993] Proceedings Seventh International Parallel Processing Symposium","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128803975","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}
Pub Date : 1993-04-13DOI: 10.1109/IPPS.1993.262908
K. Mehrotra, S. Ranka, Jhy-Chun Wang
This paper presents a simple load balancing algorithm and its probabilistic analysis. Unlike most of the previous load balancing algorithms, this algorithm maintains locality. The authors show that the cost of this load balancing algorithm is small for practical situations and discuss some interesting applications for data remapping.<>
{"title":"A probabilistic analysis of a locality maintaining load balancing algorithm","authors":"K. Mehrotra, S. Ranka, Jhy-Chun Wang","doi":"10.1109/IPPS.1993.262908","DOIUrl":"https://doi.org/10.1109/IPPS.1993.262908","url":null,"abstract":"This paper presents a simple load balancing algorithm and its probabilistic analysis. Unlike most of the previous load balancing algorithms, this algorithm maintains locality. The authors show that the cost of this load balancing algorithm is small for practical situations and discuss some interesting applications for data remapping.<<ETX>>","PeriodicalId":248927,"journal":{"name":"[1993] Proceedings Seventh International Parallel Processing Symposium","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124327193","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：