• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 13,660
Next 10 →

Implementing Decay Techniques using 4T Quasi-Static Memory Cells

by Philo Juang, Phil Diodato, Stefanos Kaxiras, Kevin Skadron, Zhigang Hu, Margaret Martonosi, Douglas W. Clark , 2002
"... This paper proposes the use of four-transistor (4T) cache and branch predictor array cell designs to address increasing worries regarding leakage power dissipation. While 4T designs lose state when infrequently accessed, they have very low leakage, smaller area, and no capacitive loads to switch. Th ..."
Abstract - Cited by 5 (3 self) - Add to MetaCart
This paper proposes the use of four-transistor (4T) cache and branch predictor array cell designs to address increasing worries regarding leakage power dissipation. While 4T designs lose state when infrequently accessed, they have very low leakage, smaller area, and no capacitive loads to switch

Implementing Branch Predictor Decay Using Quasi-Static Memory Cells

by Philo Juang, Kevin Skadron, Margaret Martonosi, Zhigang Hu, Douglas W. Clark, Philip W. Diodato, Stefanos Kaxiras - IEEE Transactions on Architecture and Code Optimization , 2004
"... This paper evaluates design options related to these questions ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
This paper evaluates design options related to these questions

1 Implementing Branch Predictor Decay using Quasi-Static Memory Cells

by Philo Juang, Kevin Skadron, Margaret Martonosi, Zhigang Hu Douglas W. Clark
"... With semiconductor technology advancing toward deep submicron, leakage energy is of increasing concern, especially for large on-chip array structures such as caches and branch predictors. Recent work has suggested that even larger branch predictors can and should be used in order to improve micropro ..."
Abstract - Add to MetaCart
not on state-preserving, static storage cells, but rather quasi-static, dynamic storage cells. This paper will examine the results of implementing decaying branch predictor structures with dynamic–appropriately, decaying–cells rather than the standard static SRAM cell. Overall, this paper demonstrates

Implementing Decay Techniques using 4T Quasi-Static Memory Cells

by Philo Juang Ý, Phil Diodato Þ, Stefanos Kaxiras Þ, Kevin Skadron, Zhigang Hu Ý, Margaret Martonosi Ý, Douglas W. Clark Ý
"... This paper proposes the use of four-transistor (4T) cache and branch predictor array cell designs to address increasing worries regarding leakage power dissipation. While 4T designs lose state when infrequently accessed, they have very low leakage, smaller area, and no capacitive loads to switch. Th ..."
Abstract - Add to MetaCart
This paper proposes the use of four-transistor (4T) cache and branch predictor array cell designs to address increasing worries regarding leakage power dissipation. While 4T designs lose state when infrequently accessed, they have very low leakage, smaller area, and no capacitive loads to switch

Composable memory transactions

by Tim Harris, Mark Plesko, Avraham Shinnar, David Tarditi - In Symposium on Principles and Practice of Parallel Programming (PPoPP , 2005
"... Atomic blocks allow programmers to delimit sections of code as ‘atomic’, leaving the language’s implementation to enforce atomicity. Existing work has shown how to implement atomic blocks over word-based transactional memory that provides scalable multiprocessor performance without requiring changes ..."
Abstract - Cited by 509 (43 self) - Add to MetaCart
Atomic blocks allow programmers to delimit sections of code as ‘atomic’, leaving the language’s implementation to enforce atomicity. Existing work has shown how to implement atomic blocks over word-based transactional memory that provides scalable multiprocessor performance without requiring

Synchronous data flow

by Edward A. Lee, et al. , 1987
"... Data flow is a natural paradigm for describing DSP applications for concurrent implementation on parallel hardware. Data flow programs for signal processing are directed graphs where each node represents a function and each arc represents a signal path. Synchronous data flow (SDF) is a special case ..."
Abstract - Cited by 622 (45 self) - Add to MetaCart
of data flow (either atomic or large grain) in which the number of data samples produced or consumed by each node on each invocation is specified a priori. Nodes can be scheduled statically (at compile time) onto single or parallel programmable processors so the run-time overhead usually associated

The structure of the potassium channel: molecular basis of K+ conduction and selectivity

by Declan A. Doyle, João Morais Cabral, Richard A. Pfuetzner, Anling Kuo, Jacqueline M. Gulbis, Steven L. Cohen, Brian T. Chait, Roderick Mackinnon - Science , 1998
"... The potassium channel from Streptomyces lividans is an integral membrane protein with sequence similarity to all known K1 channels, particularly in the pore region. X-ray analysis with data to 3.2 angstroms reveals that four identical subunits create an inverted teepee, or cone, cradling the selecti ..."
Abstract - Cited by 460 (1 self) - Add to MetaCart
. This configuration promotes ion conduction by exploiting electro-static repulsive forces to overcome attractive forces between K1 ions and the selectivity filter. The architecture of the pore establishes the physical principles underlying selective K1 conduction. Potassium ions diffuse rapidly across cell

The DaCapo Benchmarks: Java Benchmarking Development and Analysis

by Stephen M Blackburn, Robin Garner , Chris Hoffmann , Asjad M Khan , Kathryn S Mckinley , Rotem Bentzur , Amer Diwan , Daniel Feinberg , Daniel Frampton , Samuel Z Guyer , Martin Hirzel , Antony Hosking , Maria Jump , Han Lee , J Eliot B Moss, Aashish Phansalkar , Darko Stefanović , Thomas Vandrunen , Daniel Von Dincklage , Ben Wiedermann
"... Since benchmarks drive computer science research and industry product development, which ones we use and how we evaluate them are key questions for the community. Despite complex runtime tradeoffs due to dynamic compilation and garbage collection required for Java programs, many evaluations still us ..."
Abstract - Cited by 397 (65 self) - Add to MetaCart
Capo benchmarks, a set of open source, client-side Java benchmarks. We demonstrate that the complex interactions of (1) architecture, (2) compiler, (3) virtual machine, (4) memory management, and (5) application require more extensive evaluation than C, C++, and Fortran which stress (4) much less, and do

Value Locality and Load Value Prediction

by Mikko H. Lipasti, Christopher B. Wilkerson, John Paul Shen , 1996
"... Since the introduction of virtual memory demand-paging and cache memories, computer systems have been exploiting spatial and temporal locality to reduce the average latency of a memory reference. In this paper, we introduce the notion of value locality, a third facet of locality that is frequently p ..."
Abstract - Cited by 391 (18 self) - Add to MetaCart
single condition bit based on previously-seen values. Our work extends this to predict entire 32- and 64-bit register values based on previously-seen values. We find that, just as condition bits are fairly predictable on a per-static-branch basis, full register values being loaded from memory

Enforcing High-Level Protocols in Low-Level Software

by Robert DeLine, Manuel Fahndrich , 2001
"... The reliability of infrastructure software, such as operating systems and web servers, is often hampered by the mismanagement of resources, such as memory and network connections. The Vault programming language allows a programmer to describe resource management protocols that the compiler can stati ..."
Abstract - Cited by 382 (9 self) - Add to MetaCart
The reliability of infrastructure software, such as operating systems and web servers, is often hampered by the mismanagement of resources, such as memory and network connections. The Vault programming language allows a programmer to describe resource management protocols that the compiler can
Next 10 →
Results 1 - 10 of 13,660
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University