Dynamic Working Set Memory Allocation for Concurrent Processes
dc.contributor.author | Haddad, Emile K. | en |
dc.contributor.department | Computer Science | en |
dc.date.accessioned | 2013-06-19T14:36:33Z | en |
dc.date.available | 2013-06-19T14:36:33Z | en |
dc.date.issued | 1990 | en |
dc.description.abstract | The problem of allocating a given total amount of main memory page-frames M(t) available at time t, among a given set of concurrently active processes {P-sub i} is examined. Memory allocation is managed under the working set policy, and it is assumed that M(t) is larger than the total sum of all working-set sizes but less than the sum of distinct pages in {P-sub i}. It is required that each process receive at least an allocation equal to its working-set size and that the excess memory be additionally distributed among the concurrent processes to enhance their performance. The upper and lower bounds on the individual memory allocations for each process are derived. A fair policy for apportioning the excess memory among the concurrent processes is presented. A procedure for rounding off fragmented page apportionment is described. An application example, illustrating dynamically changing conditions in the concurrent active processes, is described. | en |
dc.format.mimetype | application/pdf | en |
dc.identifier | http://eprints.cs.vt.edu/archive/00000185/ | en |
dc.identifier.sourceurl | http://eprints.cs.vt.edu/archive/00000185/01/TR-90-03.pdf | en |
dc.identifier.trnumber | TR-90-03 | en |
dc.identifier.uri | http://hdl.handle.net/10919/19568 | en |
dc.language.iso | en | en |
dc.publisher | Department of Computer Science, Virginia Polytechnic Institute & State University | en |
dc.relation.ispartof | Historical Collection(Till Dec 2001) | en |
dc.rights | In Copyright | en |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
dc.title | Dynamic Working Set Memory Allocation for Concurrent Processes | en |
dc.type | Technical report | en |
dc.type.dcmitype | Text | en |
Files
Original bundle
1 - 1 of 1