Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Computer Systems Organization (C) > Processor Architectures (C.1) > Multiple Data Stream Architectures (Multiprocessors) (C.1.2) > Single-Instruction-Stream, Multiple-Data-Stream Processors (SIMD) (C.1.2...)  
 
Options:
 
  1-8 of 8 Reviews about "Single-Instruction-Stream, Multiple-Data-Stream Processors (SIMD) (C.1.2...)": Date Reviewed
  Improving loop dependence analysis
Jensen N., Karlsson S. ACM Transactions on Architecture and Code Optimization 14(3): 1-24, 2017.  Type: Article

Research on multicore utilization embraces three major categories of topics: investigations regarding the issues of multicore interaction functionality, operating system affairs and compilers, and programming language concerns. The pap...

Dec 7 2017
  Accelerating mobile video: a 64-bit SIMD architecture for handheld applications
Paver N., Khan M., Aldrich B., Emmons C. Journal of VLSI Signal Processing Systems 41(1): 21-34, 2005.  Type: Article

This paper presents an Intel single instruction, multiple data (SIMD) architecture designed as a coprocessor for the ARM, the purpose being acceleration of video processing on mobile devices. Obviously, the nature of image processing c...

Jul 3 2006
  The UCSC Kestrel Parallel Processor
Di Blas A., Dahle D., Diekhans M., Grate L., Hirschberg J., Karplus K., Keller H., Kendrick M., Pease D., Rice E., Schultz A., Speck D., Hughey R. IEEE Transactions on Parallel and Distributed Systems 16(1): 80-92, 2005.  Type: Article

Kestrel is a single instruction, multiple data (SIMD) parallel processor built at a university. This paper describes the processor architecture. The processor is a single board processor with a 512-element linear array of eight-bit SIM...

Jul 13 2005
  Parallel free-text search on the connection machine system
Stanfill C., Kahle B. Communications of the ACM 29(12): 1229-1239, 1986.  Type: Article

As the title suggests, this paper describes techniques to exploit parallelism of the Connection Machine for free-text search algorithms while searching natural-language documents contained in large databases, ranging from a few megabyt...

Aug 1 1987
  LUCAS associative array processor: design, programming and application studies
Fernstrom C., Kruzela I., Svensson B., Springer-Verlag, London, UK, 1986.  Type: Book (9789783540164456)

This book--which is, in fact, the joint publication of three PhD theses--describes the LUCAS (Lund University Content Addressable System). The main objective in designing and implementing the LUCAS was to have availab...

Jun 1 1987
  Low cost management of replicated data in fault-tolerant distributed systems
Joseph T., Birman K. ACM Transactions on Computer Systems 4(1): 54-70, 1986.  Type: Article

The keywords “low cost” in the title of the paper notwithstanding, the authors have not clearly defined, or even mentioned, what the cost objectives are, be they processing or bandwidth overheads in terms of the num...

Feb 1 1987
  A digital orrery
Applegate J., Douglas M., Gürsel Y., Hunter P., Seitz C. (ed), Sussman G. (ed) IEEE Transactions on Computers 34(9): 822-831, 1985.  Type: Article

The research described in this paper involved the design and construction of a special-purpose computer system to be used in computing solutions to the equations of motion of systems such as the solar system. The digital orrery is comp...

Sep 1 1986
  A taxonomy of parallel sorting
Bitton D., DeWitt D., Hsaio D., Menon J. ACM Computing Surveys 16(3): 287-318, 1984.  Type: Article

The dry-sounding title belies an excellent survey paper. The paper clarifies parallel sorting techniques into those implemented on sorting networks, those implemented on shared-memory multiprocessors, and those implemented on file stor...

Nov 1 1985
 
 
 
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy