You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format. However, this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the Department of Computer Science of the University of Maryland at College Park under terms that include this permission. All other rights are reserved by the author(s).
A Study of Permutations Permissible by LIFO Service Disciplines. Simon Hawkin. Ashok Agrawala. November 1998.
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) University of Maryland Institute for Advanced Computer Studies, Department of Computer Science, University of Maryland,
Last Generated Fri Aug 11 04:01:01 EDT 2000