scientific article

John L. Hennessy, David A. Patterson

Publication date: 18 September 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

performance analysis computer architecture

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General theory of computer systems (68M01)

Related Items (82)

A novel computer architecture to prevent destruction by viruses ⋮ A generic interface for parallel cell-based finite element operator application ⋮ Methods for message routing in parallel machines ⋮ Block delayed Majorize-Minimize subspace algorithm for large scale image restoration ^* ⋮ The Reduceron reconfigured and re-evaluated ⋮ Fast algorithm for generating Bernstein-Bézier polynomials ⋮ Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme ⋮ Modular multiplication using the core function in the residue number system ⋮ Efficient utilization of shared caches in multicore architectures ⋮ A compact finite differences exact projection method for the Navier-Stokes equations on a staggered grid with fourth-order spatial precision ⋮ A simple volume-of-fluid reconstruction method for three-dimensional two-phase flows ⋮ Why there is no general solution to the problem of software verification ⋮ An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees. II: Parallelization ⋮ More agents may decrease global work: a case in butterfly decontamination ⋮ Asymptotic optimality of statistical multiplexing in pipelined processing ⋮ Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs ⋮ A complexity O(1) priority queue for event driven molecular dynamics simulations ⋮ Recursive computation of discrete Legendre polynomial coefficients ⋮ Using integer linear programming for instruction scheduling and register allocation in multi-issue processors ⋮ Integer codes correcting single errors and random asymmetric errors within a byte ⋮ Optimal eviction policies for stochastic address traces ⋮ Amdahl's law revisited for single chip systems ⋮ Non-dominated sorting procedure for Pareto dominance ranking on multicore CPU and/or GPU ⋮ In situ ray tracing and computational steering for interactive blood flow simulation ⋮ Performance modeling of hybrid MPI/OpenMP scientific applications on large-scale multicore supercomputers ⋮ \texttt{MEEP}: a flexible free-software package for electromagnetic simulations by the FDTD method ⋮ Parallelization of triangular decompositions: techniques and implementation ⋮ ParVec: vectorizing the PARSEC benchmark suite ⋮ Classical and all-floating FETI methods for the simulation of arterial tissues ⋮ An Improved Vectorization Algorithm to Solve the d-MP Problem ⋮ Mathematical model of stored logic based computation ⋮ Oblivious algorithms for multicores and networks of processors ⋮ Inplace run-length 2d compressed search. ⋮ High Performance Implementation of Binomial Option Pricing ⋮ GPU-accelerated solutions of the nonlinear Schrödinger equation for simulating 2D spinor BECs ⋮ A hybrid branch-and-bound and evolutionary approach for allocating strings of applications to heterogeneous distributed computing systems ⋮ A pipelined-loop-compatible architecture and algorithm to reduce variable-length sets of floating-point data on a reconfigurable computer ⋮ A highly efficient implementation of a backpropagation learning algorithm using matrix ISA ⋮ Integer codes correcting burst and random asymmetric errors within a byte ⋮ Parallel algorithms for Burrows-Wheeler compression and decompression ⋮ Upper and lower I/O bounds for pebbling \(r\)-pyramids ⋮ On the complexity of min-max sorting networks ⋮ Probabilistic resource allocation in heterogeneous distributed systems with random failures ⋮ Algebraic models of correctness for abstract pipelines. ⋮ Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. ⋮ Formal communication elimination and sequentialization equivalence proofs for distributed system models ⋮ Parallel discrete molecular dynamics simulation with speculation and in-order commitment ⋮ On the interpretation of mathematical entities in the formalisation of programming and modelling languages ⋮ Upper and Lower I/O Bounds for Pebbling r-Pyramids ⋮ Methods for compressible fluid simulation on GPUs using high-order finite differences ⋮ A mass conserving boundary condition for the lattice Boltzmann equation method ⋮ Normative dynamic analysis of extreme operational modes of a heterogeneous computing system ⋮ Towards exact geometric computation ⋮ On the operating unit size of load/store architectures ⋮ Some useful strategies for unstructured edge-based solvers on shared memory machines ⋮ An integer programming approach to optimal basic block instruction scheduling for single-issue processors ⋮ A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems ⋮ Cache efficient data structures and algorithms for adaptive multidimensional multilevel finite element solvers ⋮ Architectural exploration of heterogeneous multiprocessor systems for JPEG ⋮ Faster min-max resource sharing in theory and practice ⋮ Memory encryption ⋮ Approximate string matching with stuck address bits ⋮ Adaptive partitioning techniques for index 1 IDEs ⋮ The worst page-replacement policy ⋮ The combinatorics of cache misses during matrix multiplication ⋮ Modeling and Simulative Performance Analysis of SMP and Clustered Computer Architectures ⋮ Membrane Computing in Connex Environment ⋮ Testing diagnostics of modern microprocessors with the use of functional models ⋮ Hierarchical Adaptive State Space Caching Based on Level Sampling ⋮ Maurer computers for pipelined instruction processing ⋮ Learning heuristics for basic block instruction scheduling ⋮ Constructive and destructive use of compilers in elliptic curve cryptography ⋮ Efficient Union-Find for planar graphs and other sparse graph classes ⋮ Approximate string matching with address bit errors ⋮ A polynomial-time DNA computing solution for the bin-packing problem ⋮ Cut-elimination for a logic with definitions and induction ⋮ A parallel adaptive coupling algorithm for systems of differential equations ⋮ In-place self-sorting fast Fourier transform algorithm with local memory references ⋮ Designing a reversible stack machine ⋮ Mothers of Pipelines ⋮ Advances in design and implementation of optimization software ⋮ A complete system for NN classification based on a VLSI array processor

This page was built for publication: