Show simple item record

dc.contributor.authorCarey, Michael Jen_US
dc.contributor.authorJauhari, Rajiven_US
dc.contributor.authorLivny, Mironen_US
dc.date.accessioned2012-03-15T16:49:38Z
dc.date.available2012-03-15T16:49:38Z
dc.date.created1989en_US
dc.date.issued1989
dc.identifier.citationTR828
dc.identifier.urihttp://digital.library.wisc.edu/1793/59086
dc.description.abstractIn this paper, we address the problem of priority scheduling in a database management system. We start by investigating the architectural consequences of adding priority to a DBMS. Specific priority-based schemes are then proposed for managing DBMS resources, including a priority-based disk scheduling algorithm and two approaches to adding priority to the buffer manager of a DBMS. We study the performance of our proposals through simulation, both individually and in combination. Our simulation results indicate that the objectives of priority scheduling cannot be met by a single priority-based scheduler. They show that, regardless of whether the system bottleneck is the CPU or the disk, priority scheduling on the critical resource must be complemented by a priority-based buffer management policy.en_US
dc.format.mimetypeapplication/pdfen_US
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titlePriority in DBMS Resource Schedulingen_US
dc.typeTechnical Reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • CS Technical Reports
    Technical Reports Archive for the Department of Computer Sciences at the University of Wisconsin-Madison

Show simple item record