Search For:

Displaying 1-24 out of 24 total
Address-Indexed Memory Disambiguation and Store-to-Load Forwarding
Found in: Microarchitecture, IEEE/ACM International Symposium on
By Sam S. Stone, Kevin M. Woley, Matthew I. Frank
Issue Date:November 2005
pp. 171-182
<p>This paper describes a scalable, low-complexity alternative to the conventional load/store queue (LSQ) for superscalar processors that execute load and store instructions speculatively and out-of-order prior to resolving their dependences. Whereas...
Multiple Reservations and the Oklahoma Update
Found in: IEEE Concurrency
By Janice M. Stone, Harold S. Stone, Philip Heidelberger, John Turek
Issue Date:November 1993
pp. 58-71
A multiple reservation approach that allows atomic updates of multiple shared variables and simplifies concurrent and nonblocking codes for managing shared data structures such as queues and linked lists is presented. The method can be implemented as an ex...
Dynamic Memories with Enhanced Data Access
Found in: IEEE Transactions on Computers
By Harold S. Stone
Issue Date:April 1972
pp. 359-366
Dynamic memories are commonly constructed as circulating shift registers, and thus have access times that are proportional to the size of memory. When each word in a dynamic memory is connected to r words, r ¿ 2, access time can be proportional to the base...
Optimal partitioning of randomly generated distributed programs
Found in: IEEE Transactions on Software Engineering
By Bipin Indurkhya,Harold S. Stone,Lu Xi-Cheng
Issue Date:March 1986
pp. 483-495
This paper investigates an optimal task-assignment policy for a random-graph model of a distributed program. The model of the distributed computer system assumes that communications overhead adds to total run time and that total run time decreases as the n...
Initial selection and screening of the CFA candidate computer architectures
Found in: Managing Requirements Knowledge, International Workshop on
By Samuel H. Fuller, Harold S. Stone, William E. Burr
Issue Date:June 1977
pp. 139
No summary available.
Associative Processing for General Purpose Computers Through the Use of Modified Memories
Found in: Managing Requirements Knowledge, International Workshop on
By Harold S. Stone
Issue Date:December 1968
pp. 949
No summary available.
The Translation Sensitivity of Wavelet-Based Registration
Found in: IEEE Transactions on Pattern Analysis and Machine Intelligence
By Harold S. Stone, Jacqueline Le Moigne, Morgan McGuire
Issue Date:October 1999
pp. 1074-1081
<p><b>Abstract</b>—This paper studies the effects of image translation on wavelet-based image registration. The main result is that the normalized correlation coefficients of low-pass Haar and Daubechies wavelet subbands are essentially i...
A Legislator's Dilemma
Found in: IEEE Internet Computing
By S. Ruth,S. Stone
Issue Date:November 2012
pp. 78-81
Drafting and passing federal laws aimed at curbing online copyright violations or discouraging hacking into private databases has proven difficult enough, but a greater challenge looms: top cybersecurity officials worry that major infrastructure elements s...
Asynchronous propagation-limited logic
Found in: Foundations of Computer Science, Annual IEEE Symposium on
By J. Goldberg, H. S. Stone
Issue Date:October 1966
pp. 215-226
It is generally recognized that asynchronous operation of logic networks offers specific advantages over synchronous operation controlled by a central clock when the network is subject to large or widely varying inter-module propagation delays. In this pap...
Copyrights and Author Responsibilities
Found in: Computer
By Harold S. Stone
Issue Date:December 1992
pp. 46-51
<p>The issues associated with the reuse of copyrighted material are discussed by examining a number of case studies. The concepts of exclusive rights and fair use of copyright-protected material are described. An author's reuse of his or her own copy...
Database Applications of the FETCH-AND-ADD Instruction
Found in: IEEE Transactions on Computers
By Harold S. Stone
Issue Date:July 1984
pp. 604-612
The FETCH-AND-ADD instruction provides for synchronization of multiple processes in a parallel manner. This paper explores the use of FETCH-AND-ADD in the context of database systems. We show how to enqueue locks, detect lock conflicts, and release locks w...
Designing in the multimedia era
Found in: IEEE Design and Test of Computers
By Harold S. Stone
Issue Date:December 1996
pp. 6-7
<p><it>[The 1996 International Conference on Computer Design featured Harold S. Stone's keynote address. The following excerpts focus on expected hardware design changes in the near term. Stone conducts research in image processing at NEC Resea...
Computer Architecture in the 1990s
Found in: Computer
By Harold S. Stone, John Cocke
Issue Date:September 1991
pp. 30-38
<p>Some of the technology that will drive the advances of the 1990s are explored. A brief tutorial is given to explain the fundamental speed limits of metal interconnections. The advantages and disadvantages of optical interconnections and where they...
Implicitly parallel programming models for thousand-core microprocessors
Found in: Proceedings of the 44th annual conference on Design automation (DAC '07)
By Aqeel A. Mahesri, Isaac Gelado, John H. Kelm, Matthew I. Frank, Nacho Navarro, Robert E. Kidd, Sain-Zee Ueng, Sam S. Stone, Sanjay J. Patel, Sara S. Baghsorkhi, Shane Ryoo, Stephanie C. Tsao, Steve S. Lumetta, Wen-mei Hwu
Issue Date:June 2007
pp. 754-759
This paper argues for an implicitly parallel programming model for many-core microprocessors, and provides initial technical approaches towards this goal. In an implicitly parallel programming model, programmers maximize algorithm-level parallelism, expres...
Evaluation of the software bases of the candidate architectures for the military computer family
Found in: Managing Requirements Knowledge, International Workshop on
By James Wagner, Edward Lieblein, Jorge Rodriquez, Harold S. Stone
Issue Date:June 1977
pp. 175
No summary available.
Program optimization space pruning for a multithreaded gpu
Found in: Proceedings of the sixth annual IEEE/ACM international symposium on Code generation and optimization (CGO '08)
By Christopher I. Rodrigues, John A. Stratton, Sain-Zee Ueng, Sam S. Stone, Sara S. Baghsorkhi, Shane Ryoo, Wen-mei W. Hwu
Issue Date:April 2008
pp. 49-54
Program optimization for highly-parallel systems has historically been considered an art, with experts doing much of the performance tuning by hand. With the introduction of inexpensive, single-chip, massively parallel platforms, more developers will be cr...
Optimization principles and application performance evaluation of a multithreaded GPU using CUDA
Found in: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming (PPoPP '08)
By Christopher I. Rodrigues, David B. Kirk, Sam S. Stone, Sara S. Baghsorkhi, Shane Ryoo, Wen-mei W. Hwu
Issue Date:February 2008
pp. 26-33
GPUs have recently attracted the attention of many application developers as commodity data-parallel coprocessors. The newest generations of GPU architecture provide easier programmability and increased generality while maintaining the tremendous memory ba...
Decomposition of group functions and the synthesis of multirail cascades
Found in: Foundations of Computer Science, Annual IEEE Symposium on
By Bernard Elspas, Harold S. Stone
Issue Date:October 1967
pp. 184-196
A group function is defined as a mapping from the boolean m-cube, Xm, into a finite group. When m=l, we speak of an elementary group function (or, cell). A group function f into a group H is said to be decomposable over a group G if it can be expressed as ...
Exploiting query term correlation for list caching in web search engines
Found in: Proceedings of the 22nd ACM international conference on Conference on information & knowledge management (CIKM '13)
By Douglas S. Stones, Fan Zhang, Shizhao Sun, Xiaoguang Liu, Gang Wang, Jiancong Tong
Issue Date:October 2013
pp. 1817-1820
Caching technologies have been widely employed to boost the performance of Web search engines. Motivated by the correlation between terms in query logs from a commercial search engine, we explore the idea of a caching scheme based on pairs of terms, rather...
Accelerating advanced mri reconstructions on gpus
Found in: Proceedings of the 2008 conference on Computing frontiers (CF '08)
By Bradley P. Sutton, Justin P. Haldar, Samuel S. Stone, Stephanie C. Tsao, Wen-mei W. Hwu, Zhi-Pei Liang
Issue Date:May 2008
pp. 353-358
Computational acceleration on graphics processing units (GPUs) can make advanced magnetic resonance imaging (MRI) reconstruction algorithms attractive in clinical settings, thereby improving the quality of MR images across a broad spectrum of applications....
Footprints in the cache
Found in: ACM Transactions on Computer Systems (TOCS)
By Dominique Thiebaut, Harold S. Stone
Issue Date:October 1987
pp. 305-329
This paper develops an analytical model for cache-reload transients and compares the model to observations based on several address traces. The cache-reload transient is the set of cache misses that occur when a process is reinitiated after being suspended...
Footprints in the cache
Found in: Proceedings of the 1992 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation (SIGMETRICS '86/PERFORMANCE '86)
By Dominique Thibaut, Harold S. Stone
Issue Date:May 1986
pp. 275-281
This paper develops an analytical model for a cache-reload transient. When an interrupt program or system program runs periodically in a cache-based computer, a short cache-reload transient occurs each time the interrupt program is invoked. That transient ...
A note on a combinatorial problem of Burnett and Coffman
Found in: Communications of the ACM
By Harold S. Stone
Issue Date:March 1974
pp. 165-166
I had hoped that Moorer's rebuttal to my short communication in the November 1972 Communications would close the debate on a topic which, like the computer itself, has provoked an inordinately large quantity of unqualified argument. Unfortunately, the shor...
An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
Found in: Journal of the ACM (JACM)
By Harold S. Stone
Issue Date:January 1973
pp. 27-38
Tridiagonal linear systems of equations can be solved on conventional serial machines in a time proportional to N, where N is the number of equations. The conventional algorithms do not lend themselves directly to parallel computation on computers of the I...