Pub Date : 1995-04-19DOI: 10.1109/ICAPP.1995.472240
V. Murthy, E. Krishnamurthy
A transactional paradigm is suggested for computer-assisted parallelization of programs and register-cache scheduling. It can serve as a building tool for pipelining, data parallellism, or generic parallellism in a variety of architectures and the cost of execution can be estimated realistically.<>
{"title":"Transactional paradigm: applications to distributed programming","authors":"V. Murthy, E. Krishnamurthy","doi":"10.1109/ICAPP.1995.472240","DOIUrl":"https://doi.org/10.1109/ICAPP.1995.472240","url":null,"abstract":"A transactional paradigm is suggested for computer-assisted parallelization of programs and register-cache scheduling. It can serve as a building tool for pipelining, data parallellism, or generic parallellism in a variety of architectures and the cost of execution can be estimated realistically.<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121647291","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 : 1995-04-19DOI: 10.1109/ICAPP.1995.472168
T. Braunl
Parallaxis is a machine-independent language for data-parallel programming, based on sequential Modula-2. Programming in Parallaxis is done on a level of abstraction with virtual processors and virtual connections, which may be defined by the application programmer. This paper describes Parallaxis-III, the current version of the language definition, together with a number of parallel sample algorithms.<>
{"title":"Parallaxis-III: a structured data-parallel programming language","authors":"T. Braunl","doi":"10.1109/ICAPP.1995.472168","DOIUrl":"https://doi.org/10.1109/ICAPP.1995.472168","url":null,"abstract":"Parallaxis is a machine-independent language for data-parallel programming, based on sequential Modula-2. Programming in Parallaxis is done on a level of abstraction with virtual processors and virtual connections, which may be defined by the application programmer. This paper describes Parallaxis-III, the current version of the language definition, together with a number of parallel sample algorithms.<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123786744","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 : 1995-04-19DOI: 10.1109/ICAPP.1995.472298
P. Bonnin, E. Pissaloux, T. Dillon
The research presented here focuses on the general problem of finding tools and methods for parallel machine evaluation. "Benchmarks" are the most popular tools for machines speed comparison, unfortunately, they do not give any information on the most convenient hardware structures for implementation of a given vision problem. This paper tries to overcome this problem, and proposes a characterization of a tool for the evaluation of parallel architecture (which is a generalization of the benchmark concept); however, here we focus on the area of computer vision.<>
{"title":"Towards a choice of region algorithms for the evaluation of parallel vision architectures","authors":"P. Bonnin, E. Pissaloux, T. Dillon","doi":"10.1109/ICAPP.1995.472298","DOIUrl":"https://doi.org/10.1109/ICAPP.1995.472298","url":null,"abstract":"The research presented here focuses on the general problem of finding tools and methods for parallel machine evaluation. \"Benchmarks\" are the most popular tools for machines speed comparison, unfortunately, they do not give any information on the most convenient hardware structures for implementation of a given vision problem. This paper tries to overcome this problem, and proposes a characterization of a tool for the evaluation of parallel architecture (which is a generalization of the benchmark concept); however, here we focus on the area of computer vision.<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122500039","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 : 1995-04-19DOI: 10.1109/ICAPP.1995.472219
Chi-Chang Chen, Jianer Chen
In this paper, we present a homomorphism from a higher dimensional de Bruijn graph to a lower dimensional de Bruijn graph. This homomorphism is simple and efficient. Applications of this homomorphism on embedding the large size complete binary trees, rings, and shuffle-exchange networks to the smaller binary de Bruijn networks are presented.<>
{"title":"A homomorphism of the de Bruijn graphs and its applications","authors":"Chi-Chang Chen, Jianer Chen","doi":"10.1109/ICAPP.1995.472219","DOIUrl":"https://doi.org/10.1109/ICAPP.1995.472219","url":null,"abstract":"In this paper, we present a homomorphism from a higher dimensional de Bruijn graph to a lower dimensional de Bruijn graph. This homomorphism is simple and efficient. Applications of this homomorphism on embedding the large size complete binary trees, rings, and shuffle-exchange networks to the smaller binary de Bruijn networks are presented.<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122900840","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 : 1995-04-19DOI: 10.1109/ICAPP.1995.472268
M. Alderighi, D. Crosetto, F. d'Ovidio, E. Gummati, G. Sechi
Recent years have witnessed a growing interest in the study of neural networks. A lot of work has been on understanding how various computational problems can be solved adopting these models. This paper describes an asynchronous feedback neural network, the photon event identification problem in an astrophysics experiment, and shows some promising results.<>
{"title":"A feedback neural network for signal processing and event recognition","authors":"M. Alderighi, D. Crosetto, F. d'Ovidio, E. Gummati, G. Sechi","doi":"10.1109/ICAPP.1995.472268","DOIUrl":"https://doi.org/10.1109/ICAPP.1995.472268","url":null,"abstract":"Recent years have witnessed a growing interest in the study of neural networks. A lot of work has been on understanding how various computational problems can be solved adopting these models. This paper describes an asynchronous feedback neural network, the photon event identification problem in an astrophysics experiment, and shows some promising results.<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115160358","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 : 1995-04-19DOI: 10.1109/ICAPP.1995.472285
C. Chan, Meiling Zhu
The paper proposes an architecture and implementation of a motion control system, with a master-slave multiprocessor mode. Some major problems which must be considered in multiprocessor systems design, including multiprocessor system architecture, interconnection network, hardware circuit design and software design are studied.<>
{"title":"Implementation of real-time parallel processing in a motion control system","authors":"C. Chan, Meiling Zhu","doi":"10.1109/ICAPP.1995.472285","DOIUrl":"https://doi.org/10.1109/ICAPP.1995.472285","url":null,"abstract":"The paper proposes an architecture and implementation of a motion control system, with a master-slave multiprocessor mode. Some major problems which must be considered in multiprocessor systems design, including multiprocessor system architecture, interconnection network, hardware circuit design and software design are studied.<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"188 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133526561","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 : 1995-04-19DOI: 10.1109/ICAPP.1995.472288
P. Tagle, N. K. Sharma
To support broadband integrated services digital networks (B-ISDN), switching networks must have the ability to provide both multipoint connections (multicasting) and point-to-point connections (unicasting). This paper proposes a multicast switching network based on a recently proposed routing network which consists of two banyan networks with links at every stage to allow cell transfer to and from each banyan plane, thereby offering multiple paths between each input-output pair. The proposed multicast network employs the copy and routing networks in a parallel configuration. This approach allows for unicast cells to proceed to the routing network without additional delay and keeps the copy network free of unicast traffic which results in a larger amount of the multicast requests to be successfully replicated. Using simulations, the proposed multicast network was shown to offer better performance than other networks in terms of cell loss rates.<>
{"title":"A multicast switching network for B-ISDN","authors":"P. Tagle, N. K. Sharma","doi":"10.1109/ICAPP.1995.472288","DOIUrl":"https://doi.org/10.1109/ICAPP.1995.472288","url":null,"abstract":"To support broadband integrated services digital networks (B-ISDN), switching networks must have the ability to provide both multipoint connections (multicasting) and point-to-point connections (unicasting). This paper proposes a multicast switching network based on a recently proposed routing network which consists of two banyan networks with links at every stage to allow cell transfer to and from each banyan plane, thereby offering multiple paths between each input-output pair. The proposed multicast network employs the copy and routing networks in a parallel configuration. This approach allows for unicast cells to proceed to the routing network without additional delay and keeps the copy network free of unicast traffic which results in a larger amount of the multicast requests to be successfully replicated. Using simulations, the proposed multicast network was shown to offer better performance than other networks in terms of cell loss rates.<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133664860","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 : 1995-04-19DOI: 10.1109/ICAPP.1995.472282
Henry Y. H. Chuang, Ling Chen
The Euclidean distance transform (EDT) converts a binary image into one where each pixel has a value equal to its Euclidean distance to the nearest foreground pixel. A parallel EDT algorithm on SIMD hypercube computer is presented here. For an n/spl times/n image, the algorithm has a time complexity of O(n) on an n/sup 2/ nodes machine. With modifications to minimize dependency among partitions, the algorithm can be adapted to compute large EDT problems on smaller hypercubes. On a hypercube of t/sup 2/ nodes, the time complexity of the modified algorithm is O(n/sup 2//t log n/t).<>
{"title":"SIMD hypercube algorithm for complete Euclidean distance transform","authors":"Henry Y. H. Chuang, Ling Chen","doi":"10.1109/ICAPP.1995.472282","DOIUrl":"https://doi.org/10.1109/ICAPP.1995.472282","url":null,"abstract":"The Euclidean distance transform (EDT) converts a binary image into one where each pixel has a value equal to its Euclidean distance to the nearest foreground pixel. A parallel EDT algorithm on SIMD hypercube computer is presented here. For an n/spl times/n image, the algorithm has a time complexity of O(n) on an n/sup 2/ nodes machine. With modifications to minimize dependency among partitions, the algorithm can be adapted to compute large EDT problems on smaller hypercubes. On a hypercube of t/sup 2/ nodes, the time complexity of the modified algorithm is O(n/sup 2//t log n/t).<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133992065","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 : 1995-04-19DOI: 10.1109/ICAPP.1995.472265
M. Alderighi, D. Crosetto, S. D'Angelo, G. Sechi
This report describes an implementation on the 3D-flow system developed at the Superconducting Super Collider Lab. of the algorithms and equipment to recognize valid photon events using a morphological analysis of the signals of an intensified CCD in the photon counting mode. The analysis consists of calculating the coordinates of a matrix corresponding to the exact position of each incident photon on the channel plate. Several off-line calculations with efficiency studies aiming at finding the best algorithm for event reconstruction have been performed. This off-line algorithm can be accomplished in real time at the CCD input rate (up to 2000 frames/sec). The communication-intensive nature of the algorithm and of the topology of this application and the particular architecture of the 3D-flow system lead to a very efficient implementation. The existing hardware simulator allows studies of the entire system before actual construction.<>
{"title":"Implementing photon event recognition algorithms on a 3D-flow system","authors":"M. Alderighi, D. Crosetto, S. D'Angelo, G. Sechi","doi":"10.1109/ICAPP.1995.472265","DOIUrl":"https://doi.org/10.1109/ICAPP.1995.472265","url":null,"abstract":"This report describes an implementation on the 3D-flow system developed at the Superconducting Super Collider Lab. of the algorithms and equipment to recognize valid photon events using a morphological analysis of the signals of an intensified CCD in the photon counting mode. The analysis consists of calculating the coordinates of a matrix corresponding to the exact position of each incident photon on the channel plate. Several off-line calculations with efficiency studies aiming at finding the best algorithm for event reconstruction have been performed. This off-line algorithm can be accomplished in real time at the CCD input rate (up to 2000 frames/sec). The communication-intensive nature of the algorithm and of the topology of this application and the particular architecture of the 3D-flow system lead to a very efficient implementation. The existing hardware simulator allows studies of the entire system before actual construction.<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131565090","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 : 1995-04-19DOI: 10.1109/ICAPP.1995.472262
C. Papadopoulos
This paper analyzes the ability of several bounded degree networks that are commonly used for parallel computation to tolerate faults. Among other things it is shown that an N-node butterfly containing N/sup 1-/spl epsiv// worst-case faults (for any constant /spl epsiv/>0) can emulate a fault-free butterfly of the same size with only constant slowdown. Similar results are proven for the shuffle-exchange graph. Hence, these networks become the first connected bounded-degree networks known to be able to sustain more than a constant number of worst-case faults without suffering more than a constant-factor slowdown in performance.<>
{"title":"A formal study on the fault tolerance of parallel and distributed systems","authors":"C. Papadopoulos","doi":"10.1109/ICAPP.1995.472262","DOIUrl":"https://doi.org/10.1109/ICAPP.1995.472262","url":null,"abstract":"This paper analyzes the ability of several bounded degree networks that are commonly used for parallel computation to tolerate faults. Among other things it is shown that an N-node butterfly containing N/sup 1-/spl epsiv// worst-case faults (for any constant /spl epsiv/>0) can emulate a fault-free butterfly of the same size with only constant slowdown. Similar results are proven for the shuffle-exchange graph. Hence, these networks become the first connected bounded-degree networks known to be able to sustain more than a constant number of worst-case faults without suffering more than a constant-factor slowdown in performance.<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"29 16","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133357605","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
扫码关注我们
求助内容：
应助结果提醒方式：