• 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 5,203
Next 10 →

USEFUL MEMORY LOCATIONS

by Leading Edge Co , 2001
"... handshake I/O Register with 59457 E841 handshake ..."
Abstract - Add to MetaCart
handshake I/O Register with 59457 E841 handshake

Value profiling for instructions and memory locations

by Peter T. Feller , 1998
"... ..."
Abstract - Cited by 17 (1 self) - Add to MetaCart
Abstract not found

Eraser: a dynamic data race detector for multithreaded programs

by Stefan Savage, Michael Burrows, Greg Nelson, Patrick Sobalvarro, Thomas Anderson - ACM Transaction of Computer System , 1997
"... Multi-threaded programming is difficult and error prone. It is easy to make a mistake in synchronization that produces a data race, yet it can be extremely hard to locate this mistake during debugging. This paper describes a new tool, called Eraser, for dynamically detecting data races in lock-based ..."
Abstract - Cited by 688 (2 self) - Add to MetaCart
Multi-threaded programming is difficult and error prone. It is easy to make a mistake in synchronization that produces a data race, yet it can be extremely hard to locate this mistake during debugging. This paper describes a new tool, called Eraser, for dynamically detecting data races in lock

The Cache Performance and Optimizations of Blocked Algorithms

by Monica S. Lam, Edward E. Rothberg, Michael E. Wolf - In Proceedings of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems , 1991
"... Blocking is a well-known optimization technique for improving the effectiveness of memory hierarchies. Instead of operating on entire rows or columns of an array, blocked algorithms operate on submatrices or blocks, so that data loaded into the faster levels of the memory hierarchy are reused. This ..."
Abstract - Cited by 574 (5 self) - Add to MetaCart
Blocking is a well-known optimization technique for improving the effectiveness of memory hierarchies. Instead of operating on entire rows or columns of an array, blocked algorithms operate on submatrices or blocks, so that data loaded into the faster levels of the memory hierarchy are reused

Precomputing Memory Locations for Parametric Allocations *

by Jörg Herter, Sebastian Altmeyer
"... Current worst-case execution time (WCET) analyses do not support programs using dynamic memory allocation. This is mainly due to the unpredictability of cache performance introduced by standard memory allocators. To overcome this problem, algorithms have been proposed that precompute static allocati ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
Current worst-case execution time (WCET) analyses do not support programs using dynamic memory allocation. This is mainly due to the unpredictability of cache performance introduced by standard memory allocators. To overcome this problem, algorithms have been proposed that precompute static

Least Types for Memory Locations in Java Bytecode

by Zhenyu Qian , 1999
"... . (Java) bytecode verification should ensure type-safety for Java Virtual Machine (JVM) programs (bytecode) and form a basis for Java-based internet security. Recent research work has proposed using formal typing rules to enforce constraints on types for memory locations in bytecode and thus formall ..."
Abstract - Cited by 11 (0 self) - Add to MetaCart
. (Java) bytecode verification should ensure type-safety for Java Virtual Machine (JVM) programs (bytecode) and form a basis for Java-based internet security. Recent research work has proposed using formal typing rules to enforce constraints on types for memory locations in bytecode and thus

Efficient Context-Sensitive Pointer Analysis for C Programs

by Robert P. Wilson, Monica S. Lam , 1995
"... This paper proposes an efficient technique for contextsensitive pointer analysis that is applicable to real C programs. For efficiency, we summarize the effects of procedures using partial transfer functions. A partial transfer function (PTF) describes the behavior of a procedure assuming that certa ..."
Abstract - Cited by 433 (7 self) - Add to MetaCart
context-sensitive results. Because many C programs use features such as type casts and pointer arithmetic to circumvent the high-level type system, our algorithm is based on a low-level representation of memory locations that safely handles all the features of C. We have implemented our algorithm

Identifying the root causes of memory bugs using corrupted memory location suppression

by Dennis Jeffrey, Neelam Gupta, Rajiv Gupta - Intl. Conf. on Software Maintenance , 2008
"... We present a general approach for automatically isolating the root causes of memory-related bugs in software. Our approach is based on the observation that most memory bugs involve uses of corrupted memory locations. By iteratively suppressing (nullifying) the effects of these corrupted memory locat ..."
Abstract - Cited by 7 (5 self) - Add to MetaCart
We present a general approach for automatically isolating the root causes of memory-related bugs in software. Our approach is based on the observation that most memory bugs involve uses of corrupted memory locations. By iteratively suppressing (nullifying) the effects of these corrupted memory

Iconic memory, location information, and partial report

by Siu L. Chow - Journal of Experimental Psychology: Human Perception and Performance , 1986
"... It has been suggested that the systematic decline of partial report as the delay of the partial-report cue increases is due to a time-related loss of location information. Moreover, the backward masking effect is said to be precipitated by the disruption of location information before and after iden ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
It has been suggested that the systematic decline of partial report as the delay of the partial-report cue increases is due to a time-related loss of location information. Moreover, the backward masking effect is said to be precipitated by the disruption of location information before and after

1 Interference Cancellation Tree Algorithms with k-Signal Memory Locations

by G. T. Peeters, B. Van Houdt
"... Abstract—Recently, tree algorithms have been combined with successive interference cancellation to achieve a substantially higher maximum stable throughput (MST). All previous work assumed either a single or an unbounded number of signal memory locations, with MSTs of 0.662 and 0.693, respectively. ..."
Abstract - Add to MetaCart
Abstract—Recently, tree algorithms have been combined with successive interference cancellation to achieve a substantially higher maximum stable throughput (MST). All previous work assumed either a single or an unbounded number of signal memory locations, with MSTs of 0.662 and 0.693, respectively
Next 10 →
Results 1 - 10 of 5,203
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