Paper Info
Title
Views of mixed-mode computing and network evaluation
Abstract
Trade-offs between the SIMD and MIMD models of architecture for parallelism are presented. Mixed-mode parallelism, where a machine can switch between the SIMD and MIMD modes of parallelism at instruction-level granularity with generally negligible overhead, is discussed. Advantages and disadvantages of mixed-mode parallelism and an example of a mixed-mode parallel algorithm are given. The relationship of mixed-mode processing to high-performance heterogeneous computing is overviewed. Difficulties involved with evaluating interconnection networks for parallel machines are then considered. There are a myriad of metrics that have been used in the literature. The problems involved with choosing the most appropriate metric or weighted set of metrics, and performing “fair” comparisons, are explored
Year
DOI
Venue
1994
10.1109/ISPAN.1994.367171
ISPAN
Keywords
Field
DocType
multiprocessor interconnection networks,parallel algorithms,parallel architectures,mimd architecture,simd architecture,fair comparisons,high-performance heterogeneous computing,instruction-level granularity,interconnection network evaluation,mixed-mode computing,mixed-mode parallelism,multiple instruction stream,multiple data stream machines,negligible overhead,parallel architecture,parallel machines,single instruction stream,weighted set of metrics,parallel processing,computer architecture,computer networks,parallel algorithm,switches,concurrent computing,broadcasting,heterogeneous computing
Instruction-level parallelism,Implicit parallelism,Computer science,Parallel algorithm,Task parallelism,Parallel computing,SIMD,Data parallelism,Concurrent computing,MIMD
Conference
ISBN
Citations 
PageRank 
0-8186-6507-6
0
0.34
References 
Authors
17
2
Name
Order
Citations
PageRank
Howard Jay Siegel15428689.33
John K. Antonio2446.32