Pub Date : 1993-04-13DOI: 10.1109/IPPS.1993.262812
B. F. Beidas, G. Papavassilopoulos
A distributed asynchronous algorithm that minimizes a functional whose minimum drifts with time is discussed. The communication delays among the processors are assumed to be stochastic with Markovian character. The authors present conditions under which the mean square and almost sure convergence to the sought nonstationary solution are guaranteed.<>
{"title":"Implementation of distributed asynchronous algorithms with stochastic delays for solving time drifting optimization problems","authors":"B. F. Beidas, G. Papavassilopoulos","doi":"10.1109/IPPS.1993.262812","DOIUrl":"https://doi.org/10.1109/IPPS.1993.262812","url":null,"abstract":"A distributed asynchronous algorithm that minimizes a functional whose minimum drifts with time is discussed. The communication delays among the processors are assumed to be stochastic with Markovian character. The authors present conditions under which the mean square and almost sure convergence to the sought nonstationary solution are guaranteed.<<ETX>>","PeriodicalId":248927,"journal":{"name":"[1993] Proceedings Seventh International Parallel Processing Symposium","volume":"54 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":"114507502","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.262875
Gebre A. Gessesse, S. Chalasani
Two-dimensional tori, or its variants such as the midimew networks, are the most popular degree-four interconnection networks. However, the number of nodes interconnected by two-dimensional tori or the midimew networks grows as a square of their diameters. The authors discuss two different types of degree-four interconnection networks, the starcake networks and the k-ary 2-cliques. These graphs are regular, vertex-symmetric, maximally fault-tolerant and have a better diameter than the popular degree-four networks. They discuss the construction and routing of these networks and compare them with other interconnection networks. A preliminary performance comparison indicates that the proposed networks offer better throughput-delay characteristics than tori and midimew networks.<>
{"title":"New degree four networks: properties and performance","authors":"Gebre A. Gessesse, S. Chalasani","doi":"10.1109/IPPS.1993.262875","DOIUrl":"https://doi.org/10.1109/IPPS.1993.262875","url":null,"abstract":"Two-dimensional tori, or its variants such as the midimew networks, are the most popular degree-four interconnection networks. However, the number of nodes interconnected by two-dimensional tori or the midimew networks grows as a square of their diameters. The authors discuss two different types of degree-four interconnection networks, the starcake networks and the k-ary 2-cliques. These graphs are regular, vertex-symmetric, maximally fault-tolerant and have a better diameter than the popular degree-four networks. They discuss the construction and routing of these networks and compare them with other interconnection networks. A preliminary performance comparison indicates that the proposed networks offer better throughput-delay characteristics than tori and midimew networks.<<ETX>>","PeriodicalId":248927,"journal":{"name":"[1993] Proceedings Seventh International Parallel Processing Symposium","volume":"67 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":"114728208","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.262853
John Lenell, N. Bagherzadeh
This paper quantitatively compares various superscalar processor architectures with a very long instruction word architecture developed at the University of California, Irvine. The motivation for this comparison is to study the capability of a dynamically scheduled processor to obtain the same performance achieved by a statically scheduled processor, and examine the hardware resources required by each.<>
{"title":"A performance comparison of several superscalar processor models with a VLIW processor","authors":"John Lenell, N. Bagherzadeh","doi":"10.1109/IPPS.1993.262853","DOIUrl":"https://doi.org/10.1109/IPPS.1993.262853","url":null,"abstract":"This paper quantitatively compares various superscalar processor architectures with a very long instruction word architecture developed at the University of California, Irvine. The motivation for this comparison is to study the capability of a dynamically scheduled processor to obtain the same performance achieved by a statically scheduled processor, and examine the hardware resources required by each.<<ETX>>","PeriodicalId":248927,"journal":{"name":"[1993] Proceedings Seventh International Parallel Processing Symposium","volume":"127 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":"115190288","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.262781
Garng M. Huang, W. Ongsakul
The parallelization and implementations of Gauss-Seidel (G-S) algorithms for power flow analysis have been investigated on a Sequent Balance shared memory (SM) machine. In this paper, the authors generalize the idea to more general computer architectures and demonstrate how to effectively increase the speedup upper bounds of G-S algorithms by properly managing the bottlenecks.<>
{"title":"Managing the bottlenecks of a parallel Gauss-Seidel algorithm for power flow analysis","authors":"Garng M. Huang, W. Ongsakul","doi":"10.1109/IPPS.1993.262781","DOIUrl":"https://doi.org/10.1109/IPPS.1993.262781","url":null,"abstract":"The parallelization and implementations of Gauss-Seidel (G-S) algorithms for power flow analysis have been investigated on a Sequent Balance shared memory (SM) machine. In this paper, the authors generalize the idea to more general computer architectures and demonstrate how to effectively increase the speedup upper bounds of G-S algorithms by properly managing the bottlenecks.<<ETX>>","PeriodicalId":248927,"journal":{"name":"[1993] Proceedings Seventh International Parallel Processing Symposium","volume":"1 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":"115209841","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.262902
Suresh Singh, M. Sridhar
The authors present an algorithm that produces a schedule of transmissions to achieve gossiping in a system where nodes are equipped with radio transceivers; different nodes have transceivers with different ranges. They assume that all the nodes are placed on a line and that all communication occurs in one dimension. Finally, unlike traditional system models for gossiping, they assume that all nodes within range can hear a transmission and that simultaneous transmissions may cause information loss via collisions. The gossiping algorithm developed decomposes a system configuration into a spine tree and uses this structure to recursively produce a transmission schedule.<>
{"title":"Gossiping on interval graphs (computer networks)","authors":"Suresh Singh, M. Sridhar","doi":"10.1109/IPPS.1993.262902","DOIUrl":"https://doi.org/10.1109/IPPS.1993.262902","url":null,"abstract":"The authors present an algorithm that produces a schedule of transmissions to achieve gossiping in a system where nodes are equipped with radio transceivers; different nodes have transceivers with different ranges. They assume that all the nodes are placed on a line and that all communication occurs in one dimension. Finally, unlike traditional system models for gossiping, they assume that all nodes within range can hear a transmission and that simultaneous transmissions may cause information loss via collisions. The gossiping algorithm developed decomposes a system configuration into a spine tree and uses this structure to recursively produce a transmission schedule.<<ETX>>","PeriodicalId":248927,"journal":{"name":"[1993] Proceedings Seventh International Parallel Processing Symposium","volume":"1 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":"114766468","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.262878
S. Guha
The author presents optimal parallel algorithms that run in O( square root n) time on a square root n* square root n mesh-connected computer for a number of fundamental problems concerning visibility and distance properties inside a simple polygon. These include computing shortest paths, shortest path trees, shortest path partitions, all-farthest neighbors (both internal and external), the visibility polygon of a point, the weak visibility polygon of an edge, and the shooting problem.<>
{"title":"Optimal mesh computer algorithms for simple polygons","authors":"S. Guha","doi":"10.1109/IPPS.1993.262878","DOIUrl":"https://doi.org/10.1109/IPPS.1993.262878","url":null,"abstract":"The author presents optimal parallel algorithms that run in O( square root n) time on a square root n* square root n mesh-connected computer for a number of fundamental problems concerning visibility and distance properties inside a simple polygon. These include computing shortest paths, shortest path trees, shortest path partitions, all-farthest neighbors (both internal and external), the visibility polygon of a point, the weak visibility polygon of an edge, and the shooting problem.<<ETX>>","PeriodicalId":248927,"journal":{"name":"[1993] Proceedings Seventh International Parallel Processing Symposium","volume":"25 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":"125939791","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.262859
R. K. Thiruchelvan, J. Trahan, R. Vaidyanathan
The authors investigate communication among synchronous parallel processors through a new model of parallel computation called the reconfigurable multiple bus machine (RMBM). Four versions of the RMBM are introduced. In these models processors communicate over buses and possess varying abilities to segment and/or fuse buses. A hierarchy of the versions of the RMBM and the PRAM based on their relative 'powers' is established, indicating the relative contribution of segmenting and fusing buses.<>
{"title":"On the power of segmenting and fusing buses","authors":"R. K. Thiruchelvan, J. Trahan, R. Vaidyanathan","doi":"10.1109/IPPS.1993.262859","DOIUrl":"https://doi.org/10.1109/IPPS.1993.262859","url":null,"abstract":"The authors investigate communication among synchronous parallel processors through a new model of parallel computation called the reconfigurable multiple bus machine (RMBM). Four versions of the RMBM are introduced. In these models processors communicate over buses and possess varying abilities to segment and/or fuse buses. A hierarchy of the versions of the RMBM and the PRAM based on their relative 'powers' is established, indicating the relative contribution of segmenting and fusing buses.<<ETX>>","PeriodicalId":248927,"journal":{"name":"[1993] Proceedings Seventh International Parallel Processing Symposium","volume":"29 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":"122539199","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}
Pub Date : 1993-04-13DOI: 10.1109/IPPS.1993.262782
A. Cheng
When rule-based expert systems are used to monitor and control real-time systems, the ability of these expert systems to met stringent response time constraints is as important as their ability to produce correct results to react to input. This paper explores parallel execution as an approach to achieve higher execution speed in rule-based systems in domains requiring high performance and real-time response. In particular, it shows how rule-firing parallelism can be automatically extracted from a real-time rule-based system via static analysis of the system source code. To demonstrate the practicality of this approach, the proposed technique is applied to reduce the execution time of two NASA expert systems.<>
{"title":"Parallel execution of real-time rule-based systems","authors":"A. Cheng","doi":"10.1109/IPPS.1993.262782","DOIUrl":"https://doi.org/10.1109/IPPS.1993.262782","url":null,"abstract":"When rule-based expert systems are used to monitor and control real-time systems, the ability of these expert systems to met stringent response time constraints is as important as their ability to produce correct results to react to input. This paper explores parallel execution as an approach to achieve higher execution speed in rule-based systems in domains requiring high performance and real-time response. In particular, it shows how rule-firing parallelism can be automatically extracted from a real-time rule-based system via static analysis of the system source code. To demonstrate the practicality of this approach, the proposed technique is applied to reduce the execution time of two NASA expert systems.<<ETX>>","PeriodicalId":248927,"journal":{"name":"[1993] Proceedings Seventh International Parallel Processing Symposium","volume":"11 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120909721","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
扫码关注我们
求助内容：
应助结果提醒方式：