• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

An analysis of the effects of memory allocation policy on storage fragmentation (1996)

by M S Neely
Add To MetaCart

Tools

Sorted by:
Results 1 - 2 of 2

Measuring fragmentation of two-dimensional resources applied to advance reservation grid scheduling

by Julius Gehr, Jörg Schneider, Technische Universitaet Berlin - in Proceedings of 9th International Symposium on Cluster Computing and the Grid (CCGrid 09 , 2009
"... Whenever a resource allocation fails although enough free capacity being available, fragmentation is easily spotted as cause. But how the fragmentation in a system requiring continuous allocations like time schedules or memory can be quantified is hardly analyzed. A Grid environment using advance re ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
Whenever a resource allocation fails although enough free capacity being available, fragmentation is easily spotted as cause. But how the fragmentation in a system requiring continuous allocations like time schedules or memory can be quantified is hardly analyzed. A Grid environment using advance reservation even combines two-dimensions: time and resource dimension. In this paper a new way to measure the fragmentation of a system in one dimension is proposed. This measure is then extended to incorporate also the second dimension. Extensive simulations showed that the proposed fragmentation measure is a good indicator of the state of the system. 1

Callback Implementations in C++

by Paul Jakubik , 1996
"... This paper decomposes the callback solution proposed in [Hickey] to show all of the patterns involved in transforming a simple solution for having two separate objects talk to each other to a sophisticated callback solution. After exposing all of the patterns in Hickey's callbacks, the paper shows h ..."
Abstract - Add to MetaCart
This paper decomposes the callback solution proposed in [Hickey] to show all of the patterns involved in transforming a simple solution for having two separate objects talk to each other to a sophisticated callback solution. After exposing all of the patterns in Hickey's callbacks, the paper shows how the decomposition exposes a decision point where a more common pattern could be applied. By applying this pattern, the solution evolves into a different callback library that, while slightly less efficient, is simpler and more flexible than the callbacks presented in [Hickey]. INTRODUCTION Callbacks are most easily described in terms of the telephone system. A function call is analogous to calling someone on a telephone, asking her a question, getting an answer, and hanging up; adding a callback changes the analogy so that after asking her a question, you also give her your name and number so she can call you back with the answer. In this paper, the original caller is the client, and ...
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University