A Study of Permutations Permissible by LIFO Service Disciplines
| dc.contributor.author | Hawkin, Simon | en_US |
| dc.contributor.author | Agrawala, Ashok | en_US |
| dc.date.accessioned | 2004-05-31T22:54:14Z | |
| dc.date.available | 2004-05-31T22:54:14Z | |
| dc.date.created | 1998-11 | en_US |
| dc.date.issued | 1998-11-12 | en_US |
| dc.description.abstract | We study permutations of the job order performed by various LIFO service disciplines. The sets of such permutations are shown to be equivalent to sets of string permutations with simple characteristics. In particular, it is easy to test whether a given permutation belongs to these sets. Several algorithms that efficiently perform such tests are presented. (Also cross-referenced as UMIACS-TR-98-65) | en_US |
| dc.format.extent | 197525 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/978 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-3953 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-98-65 | en_US |
| dc.title | A Study of Permutations Permissible by LIFO Service Disciplines | en_US |
| dc.type | Technical Report | en_US |