Skip to search formSkip to main contentSkip to account menu
  • Publications
  • Influence
A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
  • P. Kogge, H. Stone
  • Mathematics, Computer Science
    IEEE Transactions on Computers
  • 1 August 1973
TLDR
This paper uses a technique called recursive doubling in an algorithm for solving a large class of recurrence problems on parallel computers such as the Iliac IV.
View on IEEE
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
  • H. Stone
  • Computer Science
    IEEE Transactions on Software Engineering
  • 1977
TLDR
This paper shows that this program module assignment problem can be solved efficiently by making use of the well-known Ford–Fulkerson algorithm for finding maximum flows in commodity networks as modified by Edmonds and Karp, Dinic, and Karzanov.
View on IEEE
Parallel Processing with the Perfect Shuffle
  • H. Stone
  • Mathematics
    IEEE Transactions on Computers
  • 1 February 1971
Given a vector of N elements, the perfect shuffle of this vector is a permutation of the elements that are identical to a perfect shuffle of a deck of cards. Elements of the first half of the vector…
View on IEEE
An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
TLDR
An efficient parallel algorithm is presented in which computation time grows as log 2, which can be used to solve recurrence relations of all orders.
View on ACM
Footprints in the cache
TLDR
An analytical model for a cache-reload transient is developed and it is shown that the reload transient is related to the area in the tail of a normal distribution whose mean is a function of the footprints of the programs that compete for the cache.
View on ACM
Optimal Partitioning of Cache Memory
TLDR
An efficient combinatorial algorithm for determining the optimal steady-state allocation, which, in theory, could be used to reduce the length of the transient, is described and generalizes to multilevel cache memories.
View via Publisher
A Logic-in-Memory Computer
  • H. Stone
  • Computer Science
    IEEE Transactions on Computers
  • 1970
TLDR
The logic-in-memory computer points to a new direction for achieving orders of magnitude increase in computer performance, since the computer is specifically organized for large-scale integration, the increased performance might be obtained for a comparatively small dollar cost.
View on IEEE
Optimizing Murty's ranked assignment method
TLDR
The following three optimizations are discussed: (1) inheriting dual variables and partial solutions during partitioning, (2) sorting subproblems by lower cost bounds before solving, and (3) partitioning in an optimized order.
View on IEEE
Discrete Mathematical Structures and Their Applications
View via Publisher
Synthetic Traces for Trace-Driven Simulation of Cache Memories
TLDR
By comparing synthetic traces with real traces of identical locality parameters, it is demonstrated that synthetic traces exhibit miss ratios and lifetime functions that compare well with those of the real traces they mimic, both in fully associative and in set-associate memories.
View via Publisher
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License