2199 research outputs found
Sort by
The Kent Trumbull Gander, Vol. 2, Issue 6
No full texthttps://kent-islandora.s3.us-east-2.amazonaws.com/node/10051/10085-thumbnail.jpgVolume 2, Issue 6
Dated March 17, 2004</p
The Burr Spring 2004
No full texthttps://kent-islandora.s3.us-east-2.amazonaws.com/theburr/36/thumbnail.jp
TechKNOW Volume 9, Issue 1
No full texthttps://kent-islandora.s3.us-east-2.amazonaws.com/techknow/19/thumbnail.jp
Multiple Instruction Stream Control for an Associative Model of Parallel Computation
No full texthttps://kent-islandora.s3.us-east-2.amazonaws.com/node/16810/87020-thumbnail.jpgThis paper describes a system software design for multiple instruction stream control in a massively parallel associative computing environment. The purpose of providing multiple instruction stream control is to increase throughput and reduce the amount of parallel slackness inherent in single instruction stream parallel programming constructs. The multiple associative computing (MASC) model is used to describe this technique and a brief introduction to the MASC model of parallel computation is presented. A simple parallel computing example is used to illustrate the techniques for multiple instruction stream control in a massively parallel runtime environment.</p
TechKNOW Volume 9, Issue 4
No full texthttps://kent-islandora.s3.us-east-2.amazonaws.com/techknow/22/thumbnail.jp
Writing Center Review Volume 8 Spring 2003
No full texthttps://kent-islandora.s3.us-east-2.amazonaws.com/wcr/vol8/iss1/1/thumbnail.jp
Importance of SIMD Computation Reconsidered
No full texthttps://kent-islandora.s3.us-east-2.amazonaws.com/node/17398/87324-thumbnail.jpgIn this paper, SIMD and MIMD solutions for the real-time database management problem of air traffic control are compared. A real-time database system is highly constrained in a multiprocessor and access to the common database must be made to a limited number of data elements at a time. This MIMD database access is contrasted with the comparable SIMD common database access, which can be several hundred times greater. This is true because the SIMD can simultaneously access thousands of pertinent records instead of the limited number in the MIMD. A relatively simple example is given of a problem that has a polynomial time solution using a SIMD but for which a polynomial time solution using a MIMD is normally impossible. The fact that SIMD can support a polynomial time solution for the air traffic control problem but this problem is normally considered to be intractable for multiprocessors argues against the common belief that MIMD have greater power than SIMD. SIMD are more efficient and powerful for some critically important application areas.</p
ICON Spring 2003
No full texthttps://kent-islandora.s3.us-east-2.amazonaws.com/icon/vol38/iss2/1/thumbnail.jp
ICON Fall 2003
No full texthttps://kent-islandora.s3.us-east-2.amazonaws.com/icon/vol38/iss3/1/thumbnail.jp