Proceedings. Workshop on Heterogeneous Processing,最新文献

{"title":"Towards a Virtual Multicomputer","authors":"D. J. Batey, J. Padget","doi":"10.1109/WHP.1993.664369","DOIUrl":"https://doi.org/10.1109/WHP.1993.664369","url":null,"abstract":"We advocate the use of a single language to control heterogeneous computer ensembles, and offer an alternative perspective on architecture independence. The approach we suggest emphasises the common aspects of all models of parallel computation, while accepting the strengths and weaknesses of their differences. This common model can then be used to express algorithms appropriate to the different operational models of the target machines involved. Our work is based on Paralation Lisp - we give a brief overview of this collection-oriented language, and describe an experimental MIMD implementation based on EuLisp and PVM. Finally, we outliize a virtual architecture for general purpose parallel processing on multicomputers, allowing multi-user remote manipulaton of SIMD arrays, multiprocessors, and LAN connected workstations, from within a single application session.","PeriodicalId":235913,"journal":{"name":"Proceedings. Workshop on Heterogeneous Processing,","volume":"10 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":"130397303","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}

{"title":"Partitioning Problems in Heterogeneous Computer Systems","authors":"M. A. Iqbal","doi":"10.1109/WHP.1993.664361","DOIUrl":"https://doi.org/10.1109/WHP.1993.664361","url":null,"abstract":"Heterogeneous Computer Systems (HCS) have the potential to achieve enhanced performance and costeffectiveness over hLomogeneous systems for solving problems with diverse computational requirements. As the HCS consist of number of parallel computers which may have distinct language and system support and sometimes different computational models, the algorithm designer faces the formidable task of optimally assigning the subtasks of an application onto various machines of the HCS. In this paper, we address the problem of finding the least expensive set of super-speed machines subject to a maximal execution time constraint for a given application task. We show here that it is possible to find an optimal solution to the above problem under certain restrictions on the interconnection structure of the subtasks as well as the heterogeneous computer system. The algorithm that we have presented in this paper can also find a solution to the dual of the above problem i.e. finding the fastest set of machines to solve a given application task subject to a given cost constraint.","PeriodicalId":235913,"journal":{"name":"Proceedings. Workshop on Heterogeneous Processing,","volume":"8 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":"121332033","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}

{"title":"Design of a Heterogeneous Parallel Processing System for Beam Forming","authors":"C.H. Lee, D. Sullivan","doi":"10.1109/WHP.1993.664375","DOIUrl":"https://doi.org/10.1109/WHP.1993.664375","url":null,"abstract":"In many defense related applications, very complex hardware and software systems exist. They are characterized by difficult computation and real time requirements. These systems typically have an assorted collection of heterogeneous analog or digital processors. The program that run the embedded system typically is in the order of hundreds of thousands of line of source code. The system is generally very complex, hard to design, and hard to maintain. Due to recent substantial investment and possible pay off in high performance computation by the government it is all natural to examine the possibility of implementing this kind of very complex system on high performance parallel processors. Of the many forms of parallel processor system, distributed heterogeneous parallel system is a possible attractive approach. Despite the continuing research efforts in parallel processing, persistent difficulty and challenge still exists. (1 ) Scalability problem: Measured efficiency of speed up (from benchmarks) experiments with large (=1000’s processing) MIMD parallel architectures are still in the single digit percent range. For vector processors type of supercomputer the performance is a little better in the tenth of percent range. (2) Software parallel processor is still a problem: Programming a paralIel processor system can be done in two different approaches. The first one is to take a regular sequential program and compile i t for a parallel processor system. This is geiierally referred to as the parallelizing compiler approach. The second approach is to recode the program in a parallel language such as LINDA, Fortran 90, or functional (applicative) language. The first approach does not require a large effort of program rewrite. The parallelizing compiler dealing with 1000’s of lines of code does not exist yet, and the available one for small programs still suffers performance problems. The second approach can achieve better performance. However, there is no automatic mapping technology for partitioning and scheduling. Good pedormance in programming parallel processors still relies on slow and tedious manual mapping.","PeriodicalId":235913,"journal":{"name":"Proceedings. Workshop on Heterogeneous Processing,","volume":"86 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":"130945191","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}

{"title":"A Framework for Compile-Time Selection of Parallel Modes in an Simd/spmd Heterogeneous Environment","authors":"D. Watson, H. Siegel, J. Antonio, M. A. Nichols, M. Atallah","doi":"10.1109/WHP.1993.664367","DOIUrl":"https://doi.org/10.1109/WHP.1993.664367","url":null,"abstract":"A framework for estimating the relative execution time of a data-parallel algorir!hm in an environment capable of the SIMD and SPMD (Single Program Multiple Data) modes of computation is presented. Given a data-parallel program in a language whose syntax is mode-independent, and empirical inj5ormation about instruction execution time characteristics, the long-term goal is to determine at compile time an implemenlation that results in an optimal execution time for a heterogeneous system capable of SIMD and SPMD parallelism.","PeriodicalId":235913,"journal":{"name":"Proceedings. Workshop on Heterogeneous Processing,","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":"121865627","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}

{"title":"Experiments with a Task Partitioning Model for Heterogeneous Computing","authors":"D. Lilja","doi":"10.1109/WHP.1993.664362","DOIUrl":"https://doi.org/10.1109/WHP.1993.664362","url":null,"abstract":"One potentially promising approach for exploiting the best features of a variety of different computer architectures is to partition an application program to simultaneously execute on two or more different machines interconnected with a high-speed network. A fundamental problem with this heterogeneous computing, however, is the difficulty of partitioning an application program across the machines. This paper presents a partitioning strategy that relates the relative performance of two heterogeneous machines to the communication cost of transferring partial results across their interconnection network. Experiments are described that use this strategy to partition two different application programs across the sequential front-end processor of a Connection Machine CM-200, and its parallel back-end array.","PeriodicalId":235913,"journal":{"name":"Proceedings. Workshop on Heterogeneous Processing,","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":"114181040","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}

{"title":"Image Understanding: A Driving Application for Research in Heterogeneous Parallel Processing","authors":"C. Weems","doi":"10.1109/WHP.1993.664376","DOIUrl":"https://doi.org/10.1109/WHP.1993.664376","url":null,"abstract":"This paper surveys the field of image understanding, or knowledge-based computer vision, from the perspective of a driving application for research into heterogeneous parallel processing. Image understanding is so rich in its diversity of methodologies and so inherently computational intensive that it naturally demands a very heterogeneous mix of parallelism. This paper begins by exploring some of the diversity of potential parallelism in vision, and then considers the implications for both architectural and software issues of heterogeneous parallel processing.","PeriodicalId":235913,"journal":{"name":"Proceedings. Workshop on Heterogeneous Processing,","volume":"14 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":"130103950","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}

{"title":"Partitioning Algorithms for a Class of Application Specific Multiprocessor Architectures","authors":"C. De Castro, S. Yalamanchili","doi":"10.1109/WHP.1993.664374","DOIUrl":"https://doi.org/10.1109/WHP.1993.664374","url":null,"abstract":"We consider the problem of partitioning coarse grain signal flow graphs for execution on a class of hi erarc hical ly structured, heterogeneous mu12 iprocessor architectures tailored to match the characteristics of a specific application (e.g., acoustic beamforming), or a specific domain (e.g., radar signal processing). This is achieved by utilizing the desired mix of processing element types, e.g., ASICs, DSPs, generic processors, etc. We propose two heuristics and describe the experimental results of applying both heuristics to a set of generated flow graphs. The performance of these heuristics is also compared to that of an adaptive variant of simulated annealing[l].","PeriodicalId":235913,"journal":{"name":"Proceedings. Workshop on Heterogeneous Processing,","volume":"69 5 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":"130459727","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}

{"title":"Workshop on Heterogeneous Processing WHP'93","authors":"","doi":"10.1109/WHP.1993.664358","DOIUrl":"https://doi.org/10.1109/WHP.1993.664358","url":null,"abstract":"","PeriodicalId":235913,"journal":{"name":"Proceedings. Workshop on Heterogeneous Processing,","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127893455","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}