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

CiteSeerX logo

Tools

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

Visualizing dynamic memory allocations

by Sergio Moreta, Ru Telea - In VISSOFT’07: Proceedings of 4th IEEE International Workshop on Visualizing Software for Understanding and Analysis (to appear) (2007), IEEE CS
"... We present a visualization tool for dynamic memory allocation information obtained from instrumenting the runtime allocator used by C programs. The goal of the presented visualization techniques is to convey insight in the dynamic behavior of the allocator. The purpose is to help the allocator desig ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
designers understand how the performance and working of the allocator depend on the actual allocation scenarios in order to optimize its functionality by decreasing fragmentation and improving response time. We use an orthogonal dense pixel layout of time versus memory space which can show tens of thousands

Memory and Fitness Optimization of Bacteria under Fluctuating Environments

by unknown authors , 2014
"... Bacteria prudently regulate their metabolic phenotypes by sensing the availability of specific nutrients, expressing the required genes for their metabolism, and repressing them after specific metabolites are depleted. It is unclear, however, how genetic networks maintain and transmit phenotypic sta ..."
Abstract - Add to MetaCart
of stable intracellular lac proteins dramatically reduces lag phases under cyclical fluctuations with intermediate timescales (1–10 generations). Second, response memory, a hysteretic behavior in which gene expression persists after removal of its external inducer, enhances adaptation when environments

Understanding the Behavior of Shared Memory Applications Using the SMiLE Monitoring Framework

by Jie Tao, Wolfgang Karl, Martin Schulz , 2000
"... Data locality is a key factor for the performance of parallel systems. In a Distributed Shared Memory (DSM) system, however, it is difficult for the users to maintain a high data locality as it is usually a priori unknown how the data is distributed among the nodes. In this article we introduce a mo ..."
Abstract - Add to MetaCart
monitoring framework that allows users to understand the memory behavior of parallel applications. The information offered by the monitor system enables data to be allocated or redistributed more rationally among memories. This reduces remote memory accesses and further improves parallel performance

Using Simulation to Understand the Data Layout of Programs

by Jie Tao, Wolfgang Karl, Martin Schulz - In Proceedings of the IASTED International Conference on Applied Simulation and Modelling (ASM 2001 , 2001
"... One of the most prominent performance issues on NUMA systems is the access latency to remote memories, which can be several orders of magnitude higher than the one of local memory accesses. Effective data allocation that limits the necessity to access remote memories therefore has the potential to s ..."
Abstract - Cited by 10 (10 self) - Add to MetaCart
One of the most prominent performance issues on NUMA systems is the access latency to remote memories, which can be several orders of magnitude higher than the one of local memory accesses. Effective data allocation that limits the necessity to access remote memories therefore has the potential

Integer Programming Based Register Allocation

by Chris Lupo, Kent Wilken
"... this paper is based on that prior work. The primary objective of this project is to significantly speedup the integer programming based register allocator ORA (Optimal Register Allocator). Significant speedup is expected from the discovery of application-specific methods for solving register allocat ..."
Abstract - Add to MetaCart
this paper is based on that prior work. The primary objective of this project is to significantly speedup the integer programming based register allocator ORA (Optimal Register Allocator). Significant speedup is expected from the discovery of application-specific methods for solving register

Cache-Conscious Allocation of Pointer-Based Data Structures Revisited with

by Bryan Black Intel Labs, Josefin Hallberg, Tuva Palm, Mats Brorsson, Dharmesh Parikh, Yan Zhang, Karthik Sankaranarayanan, Kevin Skadron, Mircea Stan, Christopher Cowell, Csaba Andras Moritz, Wayne Burleson, Gregory S. Hartman, Priya Narasimhan, Geoff Langdale, Thomas Gross, Dan Ernst, Todd Austin, Kaushal R. G, Nihar R. Mahapatra, Josefin Hallberg, Tuva Palm, Mats Brorsson , 2002
"... As memory access times continue to be a bottleneck, differential research is required for better understanding of memory access performance. Studies of cache-conscious allocation and software prefetch have recently sparked research in the area of software optimizations on memory, as pointer-based da ..."
Abstract - Add to MetaCart
As memory access times continue to be a bottleneck, differential research is required for better understanding of memory access performance. Studies of cache-conscious allocation and software prefetch have recently sparked research in the area of software optimizations on memory, as pointer

Understanding TCP Vegas: . . .

by Steven H. Low, Larry L. Peterson, Limin Wang , 2002
"... We view congestion control as a distributed primal–dual algorithm carried out by sources and links over a network to solve a global optimization problem. We describe a multilink multisource model of the TCP Vegas congestion control mechanism. The model provides a fundamental understanding of delay, ..."
Abstract - Add to MetaCart
We view congestion control as a distributed primal–dual algorithm carried out by sources and links over a network to solve a global optimization problem. We describe a multilink multisource model of the TCP Vegas congestion control mechanism. The model provides a fundamental understanding of delay

Review article Memories that last forever: strategies for optimizing vaccine T-cell memory

by Jeffrey D. Ahlers, Igor M. Belyakov
"... For acute self-limiting infections a vac-cine is successful if it elicits memory at least as good as the natural experience; however, for persistent and chronic infec-tions such as HIV, hepatitis C virus (HCV), human papillomavirus (HPV), and human herpes viruses, this paradigm is not appli-cable. A ..."
Abstract - Add to MetaCart
For acute self-limiting infections a vac-cine is successful if it elicits memory at least as good as the natural experience; however, for persistent and chronic infec-tions such as HIV, hepatitis C virus (HCV), human papillomavirus (HPV), and human herpes viruses, this paradigm is not appli

Cache-Conscious Allocation of Pointer-Based Data Structures Revisited with HW/SW Prefetching

by Josefin Hallberg, Tuva Palm, Mats Brorsson - in ‘2 n d Annual Workshop on Duplicating, Deconstructing, and Debunking , 2003
"... As memory access times continue to be a bottleneck, differential research is required for better understanding of memory access performance. Studies of cache-conscious allocation and software prefetch have recently sparked research in the area of software optimizations on memory, as pointer-based da ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
As memory access times continue to be a bottleneck, differential research is required for better understanding of memory access performance. Studies of cache-conscious allocation and software prefetch have recently sparked research in the area of software optimizations on memory, as pointer

A Quantitative Performance Analysis Model for GPU Architectures

by Yao Zhang, John D. Owens - In HPCA , 2011
"... We develop a microbenchmark-based performance model for NVIDIA GeForce 200-series GPUs. Our model identifies GPU program bottlenecks and quantitatively analyzes performance, and thus allows programmers and architects to predict the benefits of potential program optimizations and architectural improv ..."
Abstract - Cited by 57 (2 self) - Add to MetaCart
on performance, allowing us to understand the configuration of the fastest dense matrix multiply implementation and to optimize the tridiagonal solver and sparse matrix vector multiply by 60 % and 18 % respectively. Furthermore, our model applied to analysis on these codes allows us to suggest architectural
Next 10 →
Results 1 - 10 of 111
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