| |
 |
|
|
Banerjee, Utpal
Intel Corporation
Santa Clara, California
|
|
 |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 9 of 9
reviews
|
|
|
|
|
|
|
|
A study of scalar compilation techniques for pipelined supercomputers
Weiss S., Smith J. ACM Transactions on Mathematical Software 16(3): 223-245, 1990. Type: Article
This research paper reports on performance improvements for pipelined scientific computers provided by two scalar compilation techniques: loop unrolling and software pipelining. Architectural features to support the techniques are also...
|
Jun 1 1991 |
|
|
|
|
|
|
Performance of Multiprocessor Interconnection Networks
Bhuyan L., Yang Q., Agrawal D. Computer 22(2): 25-37, 1989. Type: Article
This paper is a tutorial on analytical tools that are used to evaluate network performance. It concentrates solely on multiprocessor interconnection networks. The authors start out with a classification of parallel/distributed systems ...
|
Feb 1 1990 |
|
|
|
|
|
|
Multicomputer networks: message-based parallel processing
Reed D., Fujimoto R., MIT Press, Cambridge, MA, 1988. Type: Book (9789780262181297)
As the series editor states, Reed and Fujimoto have written the first comprehensive treatment of the architecture and performance modeling of those non–shared-memory MIMD computing systems in which a large number of processor...
|
Apr 1 1989 |
|
|
|
|
|
|
The architecture of Lisp machines
Pleszkun A., Thazhuthaveetil M. Computer 20(3): 35-44, 1987. Type: Article
The authors identify the four major problem areas in the design of a Lisp machine to be (1) efficient function calling, (2) environment maintenance, (3) list access and representation, and (4) heap maintenance. They then give a classif...
|
Aug 1 1988 |
|
|
|
|
|
|
Finite state model and compatibility theory: new analysis tools for permutation networks
Huang S., Tripathi S. IEEE Transactions on Computers 35(7): 591-601, 1986. Type: Article
Let N = 2n denote the number of inputs and outputs interconnected by a permutation network. The authors give a general proof that, in order to realize all permutations, (2n − 1) passes of the s...
|
May 1 1987 |
|
|
|
|
|
|
Parallel array processing
Ducksbury P., John Wiley & Sons, Inc., New York, NY, 1986. Type: Book (9789780470203309)
This book deals with the solution of two-dimensional partial differential equations by the finite element optimization approach on the SIMD machine DAP (Distributed Array Processor) built by ICL. The version of DAP used has 4,096 proce...
|
May 1 1987 |
|
|
|
|
|
|
An efficient unsorted VLSI dictionary machine
Somani A. (ed), Agarwal V. IEEE Transactions on Computers 34(9): 841-852, 1985. Type: Article
In this paper, the authors simplify and improve their earlier design of a binary tree-based dictionary and priority queue machine. Unlike other machines of the same kind designed in recent years, this machine does not use any links oth...
|
Aug 1 1986 |
|
|
|
|
|
|
An empirical study of automatic restructuring of nonnumerical programs for parallel processors
Lee G., Kruskal C., Kuck D. IEEE Transactions on Computers 34(10): 927-933, 1985. Type: Article
Since nonnumerical programs have more complicated dynamic control and data structures than numerical programs, they are hard to restructure automatically for parallel processing. This paper presents the results of some restructuring ex...
|
May 1 1986 |
|
|
|
|
|
|
Performance of an interconnected microprocessor system designed for fast user-level communications
London T., Ahuja S., Katseff H. Concurrent languages in distributed systems: hardware supported implementation (, Bristol, UK, 1331985. Type: Proceedings
This paper describes a multiprocessor system designed and constructed by the authors. The hardware consists of eight MC68000 single board computers, a DEC VAX-11/750, and S/NET, a high speed message-oriented computer interconnect. The ...
|
Aug 1 1985 |
|
|
|
|
|
| |
|
|
| |
|
|
