Results 1 - 10 of 391

Abstract Global Instruction Scheduling for SuperScalar Machines

by David Bernslein, Michael Rodeh
"... To improve the utilization of machine resources in superscalar processors, the instructions have to be carefully scheduled by the compiler. As internal parallelism and pipelining increases, it becomes evident that scheduling should be done beyond the basic block level. A scheme for global (intra-loo ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
To improve the utilization of machine resources in superscalar processors, the instructions have to be carefully scheduled by the compiler. As internal parallelism and pipelining increases, it becomes evident that scheduling should be done beyond the basic block level. A scheme for global (intra

PVM: A Framework for Parallel Distributed Computing

by V. S. Sunderam - Concurrency: Practice and Experience , 1990
"... The PVM system is a programming environment for the development and execution of large concurrent or parallel applications that consist of many interacting, but relatively independent, components. It is intended to operate on a collection of heterogeneous computing elements interconnected by one or ..."
Abstract - Cited by 788 (27 self) - Add to MetaCart
or more networks. The participating processors may be scalar machines, multiprocessors, or special-purpose computers, enabling application components to execute on the architecture most appropriate to the algorithm. PVM provides a straightforward and general interface that permits the description

Dynamic SimpleScalar: Simulating Java Virtual Machines

by Xianglong Huang , J. Eliot B. Moss, Kathryn S. Mckinley, Steve Blackburn, Doug Burger - SUBMITTING TO THE FIRST ANNUAL IEEE/ACM INTERNATIONAL SYMPOSIUM ON CODE GENERATION AND OPTIMIZATION. , 2003
"... Current user-mode machine simulators typically do not support simulation of dynamic compilation, threads, or garbage collection, all of which Java Virtual Machines (JVMs) require. In this paper, we describe, evaluate, and validate Dynamic SimpleScalar (DSS). DSS is a tool that simulates Java program ..."
Abstract - Cited by 35 (12 self) - Add to MetaCart
Current user-mode machine simulators typically do not support simulation of dynamic compilation, threads, or garbage collection, all of which Java Virtual Machines (JVMs) require. In this paper, we describe, evaluate, and validate Dynamic SimpleScalar (DSS). DSS is a tool that simulates Java

WaveScalar

by Steven Swanson, Ken Michelson, Andrew Schwerin, Mark Oskin - Proceedings of the 36th International Symposium on Microarchitecture(MICRO , 2003
"... Silicon technology will continue to provide an exponential increase in the availability of raw transistors. Effectively translating this resource into application performance, however, is an open challenge. Ever increasing wire-delay relative to switching speed and the exponential cost of circuit co ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
among dataflow architectures in efficiently providing traditional memory semantics. At last, a dataflow machine can run “real-world” programs, written in any language, without sacrificing parallelism. The WaveScalar ISA is designed to run on an intelligent memory system. Each instruction in a WaveScalar

The WaveScalar architecture

by Steven Swanson, Andrew Schwerin, Martha Mercaldi, Andrew Petersen, Andrew Putnam, Ken Michelson, Mark Oskin, Susan J. Eggers - ACM TRANS. COMPUT. SYST , 2007
"... Silicon technology will continue to provide an exponential increase in the availability of raw transistors. Effectively translating this resource into application performance, however, is an open challenge that conventional superscalar designs will not be able to meet. We present WaveScalar as a sca ..."
Abstract - Cited by 26 (2 self) - Add to MetaCart
scalable alternative to conventional designs. WaveScalar is a dataflow instruction set and execution model designed for scalable, low-complexity/high-performance processors. Unlike previous dataflow machines, WaveScalar can efficiently provide the sequential memory semantics that imperative languages

Interactive Ray Tracing for Isosurface Rendering

by Steven Parker, Peter Shirley, Yarden Livnat, Charles Hansen, Peter-pike Sloan - In IEEE Visualization ’98 , 1998
"... We show that it is feasible to perform interactive isosurfacing of very large rectilinear datasets with brute-force ray tracing on a conventional (distributed) shared-memory multiprocessor machine. Rather than generate geometry representing the isosurface and render with a z-buffer, for each pixel w ..."
Abstract - Cited by 180 (27 self) - Add to MetaCart
We show that it is feasible to perform interactive isosurfacing of very large rectilinear datasets with brute-force ray tracing on a conventional (distributed) shared-memory multiprocessor machine. Rather than generate geometry representing the isosurface and render with a z-buffer, for each pixel

Super Scalar Sample Sort

by Peter S, Sebastian Winkel
"... Abstract. Sample sort, a generalization of quicksort that partitions the input into many pieces, is known as the best practical comparison based sorting algorithm for distributed memory parallel computers. We show that sample sort is also useful on a single processor. The main algorithmic insight is ..."
Abstract - Add to MetaCart
the O(n log n) comparisons. On an Itanium 2 machine, we obtain a speedup of up to 2 over std::sort from the GCC STL library, which is known as one of the fastest available quicksort implementations. 1

Development of The Efficient MHD Code Using Scalar-Parallel Machine

by Tatsuki Ogino, Maki Nakao
"... In recent years, the supercomputer which can be used for large-scale numerical computation is changing from the vector-parallel machine quickly to the scalar-parallel machine. Hitachi and FUJITSU shift to marketing of a cluster type scalar-parallel machine even in Japan, and only NEC is continuing d ..."
Abstract - Add to MetaCart
In recent years, the supercomputer which can be used for large-scale numerical computation is changing from the vector-parallel machine quickly to the scalar-parallel machine. Hitachi and FUJITSU shift to marketing of a cluster type scalar-parallel machine even in Japan, and only NEC is continuing

Equivalence of BSS scalar- and vector-recursion

by C. Troestler , 2001
"... BSS-computable functions can be approached in two ways: from the point of view of computations performed by machines or under the angle of the theory of recursive functions. The goal of this paper is to answer negatively a basic question of the theory of BSSrecursive functions, namely “is vector-re ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
BSS-computable functions can be approached in two ways: from the point of view of computations performed by machines or under the angle of the theory of recursive functions. The goal of this paper is to answer negatively a basic question of the theory of BSSrecursive functions, namely “is vector

Scalarizing fortran 90 array syntax

by Yuan Zhao, Ken Kennedy - Department of Computer Science, Rice University , 2001
"... Array syntax, existed in many languages, adds expressive power by allowing operations on and assignments to the array sections. When compiling to a uniprocessor machine, the array statement must be converted into a loop that maintains the correct semantics, by a process called scalarization. Scalari ..."
Abstract - Cited by 6 (1 self) - Add to MetaCart
Array syntax, existed in many languages, adds expressive power by allowing operations on and assignments to the array sections. When compiling to a uniprocessor machine, the array statement must be converted into a loop that maintains the correct semantics, by a process called scalarization
Results 1 - 10 of 391