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

CiteSeerX logo

Tools

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

Dummynet: A Simple Approach to the Evaluation of Network Protocols

by Luigi Rizzo - ACM Computer Communication Review , 1997
"... Network protocols are usually tested in operational networks or in simulated environments. With the former approach it is not easy to set and control the various operational parameters such as bandwidth, delays, queue sizes. Simulators are easier to control, but they are often only an approximate mo ..."
Abstract - Cited by 484 (6 self) - Add to MetaCart
model of the desired setting, especially for what regards the various traffic generators (both producers and consumers) and their interaction with the protocol itself. In this paper we show how a simple, yet flexible and accurate network simulator -- dummynet -- can be built with minimal modifications

Caching strategies for improving generational garbage collection in Smalltalk

by Vimal K. Reddy, Richard K. Sawyer, Edward F. Gehringer - North Carolina State University , 2003
"... Abstract. In generational garbage collection, the youngest generation of the heap is frequently traversed during garbage collection. Due to randomness of the traversal, memory access patterns are unpredictable and cache performance becomes crucial to garbage-collection efficiency. Our proposal to im ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
to improve cache performance of garbage collection is to “pin ” the youngest generation (sometimes called the nursery) in the cache, converting all nursery accesses to cache hits. To make the nursery fit inside the cache, we reduce its size, and, to prevent its eviction from the cache, we configure

Comparing mark-and-sweep and stop-and-copy garbage collection

by Benjamin Zorn - In Proceedings of the ACM Conference on LISP and Functional Programming , 1990
"... Stop-and-copy garbage collection has been preferred to mark-and-sweep collection in the last decade because its collec-tion time is proportional to the size of reachable data and not to the memory size. This paper compares the CPU overhead and the memory requirements of the two collec-tion algorithm ..."
Abstract - Cited by 43 (5 self) - Add to MetaCart
Stop-and-copy garbage collection has been preferred to mark-and-sweep collection in the last decade because its collec-tion time is proportional to the size of reachable data and not to the memory size. This paper compares the CPU overhead and the memory requirements of the two collec

Automatic Generation of Microarchitecture Simulators

by Soner Onder, Rajiv Gupta - In IEEE International Conference on Computer Languages , 1998
"... In this paper we describe the UPFAST system that automatically generates a cycle level simulator, an assembler and a disassembler from a microarchitecture specification written in a domain specific language called the Architecture Description Language (ADL). Using the UPFAST system it is easy to ret ..."
Abstract - Cited by 43 (10 self) - Add to MetaCart
to retarget a simulator for an existing architecture to a modified architecture since one has to simply modify the input specification and the new simulator is generated automatically. UPFAST also allows porting of simulators to different platforms with minimal effort. We have been able to develop three

GCH: Hints for triggering garbage collection

by Dries Buytaert, Kris Venstermans, Lieven Eeckhout, Koen De Bosschere - Transactions on High-Performance Embedded Architectures and Compilers , 2006
"... Abstract. This paper shows that Appel-style garbage collectors often make suboptimal decisions both in terms of when and how to collect. We argue that garbage collection should be done when the amount of live bytes is low (in order to minimize the collection cost) and when the amount of dead objects ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
Abstract. This paper shows that Appel-style garbage collectors often make suboptimal decisions both in terms of when and how to collect. We argue that garbage collection should be done when the amount of live bytes is low (in order to minimize the collection cost) and when the amount of dead

Parametric Inference of Memory Requirements for Garbage Collected Languages

by Elvira Albert, Samir Genaim, Miguel Gómez-zamalloa
"... The accurate prediction of program’s memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into account or adopt specific models of garbage collectors which do not necessarily correspond to the actual memory usage. We presen ..."
Abstract - Cited by 11 (4 self) - Add to MetaCart
on the memory consumption for a reachability-based garbage collector. Interestingly, if objects lifetimes are inferred by a heap liveness analysis, then we approximate the program minimal memory requirement, i.e., the peak memory usage when using an optimal garbage collector which frees objects as soon

Older-first Garbage Collection in Practice: Evaluation in a Java Virtual Machine

by Darko Stefanovic, Matthew Hertz, Stephen M. Blackburn, Kathryn S. McKinley, J. Eliot B. Moss , 2002
"... Until recently, the best performing copying garbage collectors used a generational policy which repeatedly collects the very youngest objects, copies any survivors to an older space, and then infrequently collects the older space. A previous study that used garbage collection simulation pointed to p ..."
Abstract - Cited by 23 (7 self) - Add to MetaCart
Until recently, the best performing copying garbage collectors used a generational policy which repeatedly collects the very youngest objects, copies any survivors to an older space, and then infrequently collects the older space. A previous study that used garbage collection simulation pointed

CONSERVATIVE GARBAGE COLLECTORS FOR REALTIME AUDIO PROCESSING

by Kjetil Matheussen
"... Garbage-producing and efficient programming languages such as Haskell, Lisp or ML have traditionally not been used for generating individual samples in realtime. The reason is a lack of garbage collector fast and predictably enough to make these languages viable alternatives to C and C++ for high pe ..."
Abstract - Add to MetaCart
Garbage-producing and efficient programming languages such as Haskell, Lisp or ML have traditionally not been used for generating individual samples in realtime. The reason is a lack of garbage collector fast and predictably enough to make these languages viable alternatives to C and C++ for high

Materials for an exploratory theory of the network society.

by Manuel Castells , Anthony Giddens , Alain Touraine , Anthony Smith , Benjamin Barber , Peter Hall , Roger-Pol Droit , Sophie Watson , Frank Webster , Krishan Kumar , David Lyon , Craig Calhoun , Jeffrey Henderson , Ramon Ramos , Jose E Rodrigues-Ibanez , Jose F Tezanos , Mary Kaldor , Stephen Jones , Christopher Freeman - The British Journal of Sociology , 2000
"... ABSTRACT This article aims at proposing some elements for a grounded theor y of the network society. The network society is the social structure characteristic of the Information Age, as tentatively identi ed by empirical, cross-cultural investigation. It permeates most societies in the world, in v ..."
Abstract - Cited by 122 (0 self) - Add to MetaCart
t by obtaining a product, consuming (unevenly) part of it, and accumulating the surplus for investment, according to socially decided goals. Consumption is the appropriation of the product by humans for their individual bene t. Analytically, it is a component of the production process, seen from the reverse side

GA based Optimal Sizing & Placement of Distributed Generation for Loss Minimization

by unknown authors
"... Abstract—This paper addresses a novel technique for placement of distributed generation (DG) in electric power systems. A GA based approach for sizing and placement of DG keeping in view of system power loss minimization in different loading conditions is explained. Minimal system power loss is obta ..."
Abstract - Add to MetaCart
Abstract—This paper addresses a novel technique for placement of distributed generation (DG) in electric power systems. A GA based approach for sizing and placement of DG keeping in view of system power loss minimization in different loading conditions is explained. Minimal system power loss
Next 10 →
Results 1 - 10 of 705
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-2016 The Pennsylvania State University