|
| |
| | Garbage collection (computer science) - Wikipedia, the free encyclopedia |
 | | Garbage collection was invented by John McCarthy around 1959 to solve the problems of manual memory management in his recently devised Lisp programming language. | | | In contrast to tracing garbage collection, reference counting is a form of automatic memory management where each object has a count of the number of references to it, and the object's memory is reclaimed when the count reaches zero. | | | In computer science, garbage collection (also known as GC) is a form of automatic memory management. |
|
http://en.wikipedia.org/wiki/Automatic_garbage_collection
(2441 words)
|
|
| |
| | Computer Science |
| | The computing section may be browsed by the following subjects: computing milieux, hardware, computer systems organization, software, data, theory of computation, mathematics of computing, information systems, computing methodologies, computer applications, and general. | | | C. Daily is a computer science news site. | | | There are also books in the Q 300s on artificial intelligence, TK 5100s on computer networks, and TK 7800s on computer hardware and engineering. |
|
http://library.albany.edu/subject/csci.htm
(7982 words)
|
|
| |
| | Talk:Garbage collection (computer science) - Wikipedia, the free encyclopedia |
| | Being garbage collected is a property of an implementation of a language. | | | VM paging, time-slicing), the time taken by a collection cycle is a typically a linear function of 1) the number of live objects, 2) the number of bytes of live objects, 3) the number of pointers in live objects, and 4) the number of dead objects. | | | Certainly, most languages that use garbage collection (in fact, all other than those that can be conservatively collected through third-party tools) have no explicit free operation, and this is part of the design of the language more than an implementation detail. |
|
http://www.wikipedia.org/wiki/Talk:Garbage_collection_%28computer_science%29
(1402 words)
|
|
| |
| | Department of Computer Science - The University of Iowa |
| | From 1999 to 2001, he was an instructor in the Department of Computer Science at IIT. | | | Department of Computer Science - The University of Iowa | | | His courses are computer organization, advance computer architecture, and client/server application development. |
|
http://www.cs.uiowa.edu/Events/Colloquia/2002/03-05.html
(314 words)
|
|
| |
| | ICI programming language - encyclopedia article about ICI programming language. |
| | A programming language or computer language is a standardized communication technique for expressing instructions to a computer. | | | C programming language is a standardized imperative computer programming language developed in the early 1970s by Dennis Ritchie for use on the Unix operating system. | | | The ICI Programming Language is a general purpose interpreted, computer programming language originally developed by Tim Long in 1992. |
|
http://encyclopedia.thefreedictionary.com/ICI+programming+language
(513 words)
|
|
| |
| | Bib |
| | The algorithm proposed is an extension of a garbage collection algorithm proposed by Baker. | | | The algorithm which is proposed has the objective of differentiating the special case of garbage collection for objects with short lives. | | | The intuition is, that if a generation-based garbage collection scheme focuses its effort on scanning recently created objects, then its scanning efforts will pay off more in the form of more recovered garbage, than if it scanned older objects. |
|
http://www.usenix.org/events/javavm02/full_papers/detlefs/detlefs_html/clog-bib.html
(1115 words)
|
|
| |
| | Reference (computer science) - Encyclopedia.WorldSearch |
| | In computer science, a reference is a small object containing information which refers to data elsewhere, as opposed to containing the data itself. | | | This article discusses a general notion of reference in computing. | | | Pointer Fun With Binky Introduction to pointers in a 3 minute educational video - Stanford Computer Science Education Library |
|
http://encyclopedia.worldsearch.com/reference_(computer_science).htm
(697 words)
|
|
| |
| | Computer Science |
| | Eshrat received her Ph.D. in Computer Science from the University of Toronto in 1976. | | | The main goal of this research is to study, develop and experimentally evaluate memory allocation and garbage collection techniques that significantly advance the state of knowledge in GC. | | | Eshrat Chaired the Department of Computer Science during the period 1986-91. |
|
http://www.cs.yorku.ca/people/details/eshrat.html
(184 words)
|
|
| |
| | Garbage Collection |
| | Garbage collection thus reduces "the base problem of not having a handle on the useful life of your objects" from a global one to a local one. | | | In a non-garbage collected language, in addition to determining doing this, each module must be aware of whether any other (including those which haven't been written yet) also accesses the object, and if not free it. | | | In a garbage collected language, it's the responsibility of each module to maintain It's data structures and arrange for them to only contain those objects which that module needs. |
|
http://www.wildcard.demon.co.uk/dev/gc.html
(674 words)
|
|
| |
| | The Harvey Mudd College Computer Science REU Site |
| | She is particularly interested in topics in the systems area of computer science, specifically parallel and distributed systems and programming languages. | | | Garbage collection was once the domain of “unconventional” programming languages such as Lisp and SmallTalk, while programmers working in mainstream languages managed their own memory. | | | Current garbage collectors employ a number of assumptions about the the way data is used that may not be true for programs written in an imperative style, particularly those programs that make heavy use of arrays and thus do not use pointers to provide indirection. |
|
http://www.cs.hmc.edu/REU/projects.html
(1557 words)
|
|
| |
| | Computer Science 68, Notes 02-20 |
| | All we need is an algorithm to compute the objects reachable from the root set. | | | Whenever a new pointer is created to an object, the object's reference count is incremented, whenever a pointer is removed, the object's reference count is decremented. | | | By contrast, a simple mark-sweep or copying collector adds no direct overhead to "y = z;" and "x = z;", since information about object liveness is only computed during the garbage collection process, and is not maintained in between collections. |
|
http://www.cs.dartmouth.edu/~cs68/04w/notes-02-20.html
(2114 words)
|
|
| |
| | UMass Amherst: Department of Computer Science |
| | Ph.D., Computer Science, Massachusetts Institute of Technology (1981), M.S.E.E., Computer Science, Massachusetts Institute of Technology (1978), B.S.E.E., Computer Science, Massachusetts Institute of Technology (1975). | | | Professor Moss has been on the faculty of the University of Massachusetts Amherst since 1985, and is currently an Associate Professor of Computer Science and Director of the Object Systems Laboratory. | | | This site is maintained by the Department of Computer Science. |
|
http://www.cs.umass.edu/csinfo/faculty-bios/moss.html
(136 words)
|
|
| |
| | Computer Science: Publication: Cyclic Distributed Garbage Collection |
| | With the continued growth of distributed systems as a means to provide shared data, designers are turning their attention to garbage collection, prompted by the complexity of memory management and the desire for transparent object management. | | | This thesis presents a new algorithm for distributed garbage collection and describes its implementation in the Network Objects system. | | | Partial tracing of the distributed graph involves only objects thought to be part of a garbage cycle: no collaboration with other processes is required. |
|
http://www.cs.kent.ac.uk/pubs/1998/926
(257 words)
|
|
| |
| | Publisher description for Library of Congress control number 96014601 |
| | Garbage collecting, libraries are even available for such uncooperative languages as C and C++. | | | The efficiency and correctness of garbage collection algorithms is henceforth going to be of concern to hundreds of thousands of programmers; those who really care about this could do no better than to start with Garbage Collection: Algorithms for Automatic Dynamic Memory Management... | | | And yet the answer is relatively easy - garbage collection; removing the clutter of memory management from module interfaces, which then frees the programmer to concentrate on the problem at hand rather than low-level book-keeping details. |
|
http://www.loc.gov/catdir/description/wiley036/96014601.html
(324 words)
|
|
| |
| | OOPS Group Publications |
| | Dynamic memory allocation has been a fundamental part of most computer systems since roughly 1960, and memory allocation is widely considered to be either a solved problem or an insoluble one. | | | We survey basic garbage collection algorithms, and variations such as incremental and generational collection; we then discuss low-level implementation considerations and relationships between storage management systems, languages, and compilers. | | | We survey basic garbage collection algorithms, and variations such as incremental and generational collection. |
|
http://www.cs.utexas.edu/users/oops/papers.html
(4948 words)
|
|
| |
| | UNM Computer Science |
| | You find that the faculty in your department is embroiled in a heated debate regarding what language to teach in the introductory Computer Science course. | | | It has been said that functional languages are more suited to use on parallel computers. | | | Garbage collection is easy to do in Lisp. |
|
http://www.cs.unm.edu/degrees/phd_degrees/comprehensive_examinations/spring_95_programming
(439 words)
|
|
| |
| | Home - Computer Professionals Program |
| | The Computer Professionals Program — also known as the M.S. in Computer Science Cooperative Program — is offered exclusively by Maharishi University of Management at its campus in Fairfield, Iowa, USA. | | | The Computer Science professors work closely with students to help bring maximum success to their studies and careers. | | | You can now gain professional IT experience in the USA and earn a Master of Science degree in Computer Science from a highly respected accredited U.S. university. |
|
http://mum.edu/compro
(415 words)
|
|
| |
| | George's Links - computer science |
| | Information and Computation a journal of Theoretical Computer Science. | | | A collection of bibliographies on various aspects of computer science. | | | Another index of Computer Science Journals, this one in Germany. |
|
http://home.clara.net/ghrow/subjects/cs.html
(499 words)
|
|
| |
| | Boehm garbage collector - Wikipedia, the free encyclopedia |
| | It supports numerous operating systems, including many Unix variants, Microsoft Windows, and Mac OS X, and provides a number of advanced features including incremental collection, parallel collection and a variety of finalizer semantics. | | | The code piece below shows how one can use Boehm instead of traditional malloc and free in C [1]. |
|
http://en.wikipedia.org/wiki/Boehm_garbage_collector
(171 words)
|
|
| |
| | Computer Science: Mr RE Jones |
| | He was made an Honorary Fellow of the University of Glasgow in July 2005, the only computer scientist to have received this accolade. | | | GCspy is an architectural framework for the collection, transmission, storage and replay of memory management behaviour. | | | My interest in garbage collection came from earlier work on the efficient implementation of lazy functional languages. |
|
http://www.cs.kent.ac.uk/people/staff/rej
(988 words)
|
|
| |
| | [No title] |
| | SPMD style computation in a thread-based computing model. | | | at the Computer Science Department of the University of Twente, | | | single-user computer software tools are recast as multi-user, |
|
http://www.eecs.umich.edu/~omalley/links/Computer-Misc.html
(1382 words)
|
|
| |
| | Connectivity-Based Garbage Collection |
| | I present an evaluation of connectivity-based garbage collection and the pointer analysis. | | | This talk presents a novel family of garbage collection algorithms that use information about the connectivity of heap objects to reduce these costs. | | | I first present empirical data showing that connectivity information is a good indicator for when objects die. |
|
http://www.cs.purdue.edu/calendar/webevent.cgi?cmd=showevent&id=1038
(154 words)
|
|
| |
| | Random Thoughts about Garbage Collection |
| | A good computer scientist should know when and where to use the tools at his/her disposal. | | | Garbage collection is just one of many tools in a programmer's toolbox! | | | Programmers who know the strengths and weaknesses of their tools, and who don't use "The user can just buy a faster computer" as an excuse to write bad code. |
|
http://www.rpi.edu/~roghab/garbage_collection_thoughts.html
(639 words)
|
|
| |
| | ALI Recent Papers |
| | Real-Time Computing: Implications for General Microprocessors, Charles C. Weems, Steven Dropsho, University of Massachusetts-Amherst Computer Science Department TR-95-42. | | | University of Massachusetts at Amherst Computer Science Department TR-95-40. | | | The DARPA Image Understanding Benchmark for Parallel Computers Charles C. Weems, Allen R. Hanson, Edward M. Riseman, Azriel Rosenfeld, Journal of Parallel and Distributed Computing, Vol. |
|
http://www-ali.cs.umass.edu/bibliography.html
(2934 words)
|
|
| |
| | UMass Amherst: Department of Computer Science |
| | In this talk, we present two new garbage collection algorithms that exploit object lifetime and pointer updates behavior in new ways to improve performance and pause times. | | | The increasing reliance on garbage collected languages requires high performance from the memory management system. | | | A hybrid collector then combines copying generational collection on the young objects and ulterior reference counting on the old objects to combine good throughput and low pause times. |
|
http://www.cs.umass.edu/csinfo/colloquia/DEPT/mckinley.html
(115 words)
|
|
| |
| | math lessons - Persistent data structure |
| | In computing, a persistent data structure is a data structure which always preserves the previous version of itself when it is modified; such data structures are effectively immutable, as their operations do not (visibly) update the structure in-place, but instead always yield a new updated structure. | | | A better method is to exploit the similarity between the new and old versions to share structure between them, such as using the same subtree in a number of tree structures. | | | However, because it rapidly becomes infeasible to determine how many previous versions share which parts of the structure, and because it is often desirable to discard old versions, this necessitates an environment with garbage collection. |
|
http://www.mathdaily.com/lessons/Persistent_data_structure
(302 words)
|
|
| |
| | Theory versus Practice in Real-Time Computing with the Java(tm) Platform |
| | The discipline of Computer Science has always featured a large gap between theory and practice. | | | Theory versus Practice in Real-Time Computing with the Java(tm) Platform | | | The Java(tm) programming language has been an important factor leading to the commercial popularization of these techniques.The field of real-time computing has suffered from a particularly acute disconnect between theory and practice. |
|
http://csdl.computer.org/comp/proceedings/isorc/1999/0207/00/02070105abs.htm
(238 words)
|
|
| |
| | Computer Science |
| | Mobile computing at the University of Washington (Bershad) | | | Scripting languages have been identified as a need in the Web project. |
|
http://www.cs.virginia.edu/~knabe/cs.html
(204 words)
|
|
| |
| | Computer Science: Research Publications |
| | Image and Vision Computing 16: 989 - 1002. | | | Proceedings of the 25th Australasian Computer Science Conference, Australian Computer Science Communications, Volume 24, Number 1, January 2002 (342 pages). | | | Proceedings of the 24th Australasian Computer Science Conference, Australian Computer Science Communications, Volume 23, Number 1, January 2001 (230 pages). |
|
http://www.cs.adelaide.edu.au/research/publications
(4673 words)
|
|
| |
| | A Bibliography on Garbage Collection |
| | This paper references literature related to garbage collection in uniprocessor, parallel, distributed, real-time, object-oriented, functional and logic programming systems. | | | You may use Lucene syntax, available fields are: |
|
http://liinwww.ira.uka.de/bibliography/Compiler/garbage.collection.html
(136 words)
|
|
| |
| | UMass Amherst: Department of Computer Science |
| | We propose novel garbage collection algorithms based on a framework called "sliding views". | | | We start with a novel reference counting algorithm that uses only fine-grained synchronization. | | | All these garbage collectors were implemented on the Jikes research JVM and comparisons against Jikes collectors will be presented. |
|
http://www.cs.umass.edu/csinfo/colloquia/DEPT/petrank-2.html
(191 words)
|
|
| |
| | COLLDV-L |
| | Date: Tue, 9 Jun 1998 09:00:39 -0800 To: COLLDV-L@usc.edu Subject: no.1767-WEEDING OF COMPUTER SCIENCE COLLECTION From: Christine Elizabeth Dunphy I have been given the task of weeding the computer science collection of a relatively large Canadian academic library. | | | The decisions I will eventually make will be reviewed by a specialist, but space is valuable here. | | | If guidelines for the weeding of such a collection have been drawn up somewhere else, I would very much like to know of them. |
|
http://www.infomotions.com/serials/colldv-l/98/0146.shtml
(152 words)
|
|
| |
| | archives: Preferred Embodiment of a Hardware-Assisted Garbage-Collection System |
| | Preferred Embodiment of a Hardware-Assisted Garbage-Collection System Kelvin D. Nilsen William J. Schmidt Hardware-assisted garbage collection combines the potential of high average-case allocation rates and memory bandwidth with fast worst-case allocation, fetch, and store times. | | | This paper describes an architecture that allows memory fetch and store operations to execute, on the average, nearly as fast as traditional memory. | | | Technical Report TR92-17a, Department of Computer Science, Iowa State University. |
|
http://archives.cs.iastate.edu/documents/disk0/00/00/00/23/index.html
(124 words)
|
|
| |
| | Bibliography of the publications of the Jacaranda Research Group |
| | Publications associated with the Jacaranda Research Group (Department of Computer Science, Adelaide University). | | | Up: Bibliographies on Distributed Computing, Networking and Telecommunications | | | Bibliography of the publications of the Jacaranda Research Group |
|
http://www.math.utah.edu:8080/ftp/pub/mirrors/ftp.ira.uka.de/bibliography/Distributed/jacaranda.html
(72 words)
|
|
| |
| | garbage collection: Information From Answers.com |
| | Garbage collection (computer science): an automatic way of reclaiming unused storage; | | | Business Entertainment Games Health People Places Reference Science Shopping Words More... | | | Garbage collection can refer to two different things: |
|
http://www.answers.com/topic/garbage-collection-1
(116 words)
|
|
| |
| | SpiderMonkey - RecipeFacts |
| | JavaScript OSA, a SpiderMonkey inter-process communication language for the Macintosh computer | | | It does not itself provide host environments such as Document Object Model (DOM). | | | SpiderMonkey is written in C and contains a compiler, interpreter, decompiler, garbage collector, and standard classes. |
|
http://www.recipeland.com/encyclopaedia/index.php/SpiderMonkey
(149 words)
|
|
|
