NOTE: This item is not available outside the Texas A&M University network. Texas A&M affiliated users who are off campus can access the item through NetID and password authentication or by using TAMU VPN. Non-affiliated individuals should request a copy through their local library's interlibrary loan service.
An automated method for memory allocation using acyclic digraphs
dc.contributor.advisor | Drew, Dan | |
dc.creator | Marchbanks, Miner Peek | |
dc.date.accessioned | 2020-08-21T21:47:46Z | |
dc.date.available | 2020-08-21T21:47:46Z | |
dc.date.issued | 1976 | |
dc.identifier.uri | https://hdl.handle.net/1969.1/DISSERTATIONS-473596 | |
dc.description | Vita. | en |
dc.description.abstract | In many cases more effective memory utilization in digital computers can be accomplished through the use of memory management techniques such as virtual memory and/or the overlay facilities of the linkage editor. Methodologies necessary to reduce the amount of effort required to use the overlay facilities are presented. In addition, a method is given which can reduce the size of a program's working set, resulting in more effective hardware utilization in a virtual memory environment. The algorithms are developed using an acyclic digraph as an abstract representation of the program. A topological order is used as the basis for the node numbering scheme, producing an upper triangular adjacency matrix. The upper triangular adjacency matrix is used as the starting point of the method. The adjacency matrix is converted into a minimal connectivity matrix which exhibits the same transitive relationships. The paths through the minimal connectivity graph are used for placing program segments in memory. The minimal connectivity matrix is used directly when the program is to be used in virtual memory. The method is extended for use with overlays by producing the path matrix and using the columns as exclusion vectors to prevent exclusive calls between overlay segments. In special cases the use of duplicate segments within the program is shown to increase efficiency with the use of overlayed or virtual memory. | en |
dc.format.extent | xiv, 107 leaves | en |
dc.format.medium | electronic | en |
dc.format.mimetype | application/pdf | |
dc.language.iso | eng | |
dc.rights | This thesis was part of a retrospective digitization project authorized by the Texas A&M University Libraries. Copyright remains vested with the author(s). It is the user's responsibility to secure permission from the copyright holder(s) for re-use of the work beyond the provision of Fair Use. | en |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | |
dc.subject | Graph theory | en |
dc.subject | Virtual computer systems | en |
dc.subject | Computing Science | en |
dc.subject.classification | 1976 Dissertation M315 | |
dc.subject.lcsh | Virtual computer systems | en |
dc.subject.lcsh | Graph theory | en |
dc.title | An automated method for memory allocation using acyclic digraphs | en |
dc.type | Thesis | en |
thesis.degree.grantor | Texas A&M University | en |
thesis.degree.name | Doctor of Philosophy | en |
dc.type.genre | dissertations | en |
dc.type.material | text | en |
dc.format.digitalOrigin | reformatted digital | en |
dc.publisher.digital | Texas A&M University. Libraries | |
dc.identifier.oclc | 2979492 |
Files in this item
This item appears in the following Collection(s)
-
Digitized Theses and Dissertations (1922–2004)
Texas A&M University Theses and Dissertations (1922–2004)
Request Open Access
This item and its contents are restricted. If this is your thesis or dissertation, you can make it open-access. This will allow all visitors to view the contents of the thesis.