Thu, 21 Aug 2008 15:14:29 BST CiteULike: dfsweeney library [7 articles] http://www.citeulike.org/user/dfsweeney CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/user/dfsweeney/article/2960 <i>SIGSOFT Softw. Eng. Notes, Vol. 17, No. 4. (October 1992), pp. 40-52.</i> Foundations for the study of software architecture Dewayne Perry Alexander Wolf doi:10.1145/141874.141884 SIGSOFT Softw. Eng. Notes, Vol. 17, No. 4. (October 1992), pp. 40-52. 2004-12-07T16:24:37-00:00 1992 SIGSOFT Softw. Eng. Notes 0163-5948 17 4 40 52 ACM Press software_architecture http://www.citeulike.org/user/dfsweeney/article/1152 <i>Combinatorica, Vol. 6, No. 2. (1986), pp. 83-96.</i> Eigen values and expanders N Alon Combinatorica, Vol. 6, No. 2. (1986), pp. 83-96. 2004-11-29T20:52:19-00:00 1986 Combinatorica 0209-9683 6 2 83 96 Springer-Verlag New York, Inc. linear_algebra http://www.citeulike.org/user/dfsweeney/article/1138 <i>Vol. 37, No. 11. (November 2002), pp. 1-12.</i> Reconsidering custom memory allocation Emery Berger Benjamin Zorn Kathryn Mckinley doi:10.1145/582419.582421 Vol. 37, No. 11. (November 2002), pp. 1-12. 2004-11-29T17:31:47-00:00 2002 37 11 1 12 ACM Press memory http://www.citeulike.org/user/dfsweeney/article/1136 <i>(2001), pp. 70-80.</i><br /><br />Region-based memory management systems structure memory by grouping objects in regions under program control. Memory is reclaimed by deleting regions, freeing all objects stored therein. Our compiler for C with regions, RC, prevents unsafe region deletions by keeping a count of references to each region. Using type annotations that make the structure of a program's regions more explicit, we reduce the overhead of reference counting from a maximum of 27% to a maximum of 11% on a suite of... Language Support for Regions David Gay Alexander Aiken (2001), pp. 70-80. 2004-11-29T17:20:16-00:00 2001 70 80 memory regions http://www.citeulike.org/user/dfsweeney/article/1135 <i>(1998), pp. 313-323.</i><br /><br />Much research has been devoted to studies of and algorithms for memory management based on garbage collection or explicit allocation and deallocation. An alternative approach, region-based memory management, has been known for decades, but has not been wellstudied. In a region-based system each allocation specifies a region, and memory is reclaimed by destroying a region, freeing all the storage allocated therein. We show that on a suite of allocation-intensive C programs, regions are... Memory Management with Explicit Regions David Gay Alexander Aiken (1998), pp. 313-323. 2004-11-29T17:17:38-00:00 1998 313 323 memory regions http://www.citeulike.org/user/dfsweeney/article/1134 <i>Information and Computation (1997)</i><br /><br />This paper describes a memory management discipline for programs that perform dynamic memory allocation and de-allocation. At runtime, all values are put into regions. The store consists of a stack of regions. All points of region allocation and deallocation are inferred automatically, using a type and effect based program analysis. The scheme does not assume the presence of a garbage collector. The scheme was first presented by Tofte and Talpin (1994); subsequently, it has been tested in The... Region-Based Memory Management Mads Tofte Jean-Pierre Talpin Information and Computation (1997) 2004-11-29T17:17:03-00:00 1997 Information and Computation memory regions http://www.citeulike.org/user/dfsweeney/article/1133 <i>Integration, the VLSI Journal, Vol. 28, No. 2. (January 1999), pp. 173-184.</i><br /><br />The memory intensive nature of object-oriented languages such as C++ and Java has created the need of a high-performance dynamic memory management. Object-oriented applications often generate higher memory intensity in the heap region. Thus, high-performance memory manager is needed to cope with such applications. As today's VLSI technology advances, it becomes more and more attractive to map basic software algorithms such as malloc( ), free( ), and realloc( ) into hardware. This paper presents a hardware design of realloc function that fully utilizes the advantage of combinational logic. There are two steps needed to complete a reallocation process: (a) try to reallocate on the original memory block and (b) if (a) failed, allocate another memory block and copy the contents of the original block to this new location. In our scheme, (a) can be done in constant time. For (b), the allocation of new memory block and the deallocation of original block are done in constant time. The hardware complexity of proposed scheme (i.e. X-unit, RS-unit, and ESG-unit) is O(n), where n represents the size of bit-map. A hardware implementation of realloc function Witawas Srisa-An C Dan J Morris doi:10.1016/S0167-9260(99)00016-4 Integration, the VLSI Journal, Vol. 28, No. 2. (January 1999), pp. 173-184. 2004-11-29T17:07:56-00:00 1999 Integration, the VLSI Journal 28 2 173 184 memory