Cache scheduling
| dc.contributor.author | Hoffman, Torrey Luke | en_US |
| dc.date.accessioned | 2024-08-14T17:18:16Z | |
| dc.date.available | 2024-08-14T17:18:16Z | |
| dc.date.copyright | 1997 | en_US |
| dc.date.issued | 1997 | |
| dc.degree.department | Department of Computer Science | |
| dc.degree.level | Master of Science M.Sc. | en |
| dc.description.abstract | The Cache Scheduling problem is to find an optimal permutation of processes in a computer system to minimize the number of cache misses. This increases the effectiveness of cache memory and improves system performance. We define this problem, evaluate its complexity, and consider algorithms to solve it. Cache Scheduling generalizes known problems such as Pathwidth and Gate Matrix Layout. We show that a generalization of Pathwidth, which we call Almost Pathwidth, is a special case of Cache Scheduling and is a graph problem that is closed under taking graph minors. | |
| dc.format.extent | 91 pages | |
| dc.identifier.uri | https://hdl.handle.net/1828/18190 | |
| dc.rights | Available to the World Wide Web | en_US |
| dc.title | Cache scheduling | en_US |
| dc.type | Thesis | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- HOFFMAN_Torrey_Luke_MSC_1997_935867.pdf
- Size:
- 22.1 MB
- Format:
- Adobe Portable Document Format