Abstract
We consider the problem of estimating the average tour length of the asymmetric TSP arising from the disk scheduling problem with a linear seek function and a probability distribution on the location of I/O requests. We provide a law of large numbers expression, for the expected tour size and compute it explicitely in the most interesting cases. We also provide finer asymptotic estimates in the case of a uniform request distribution. Our methods relate disk scheduling to the problem of finding the longest increasing subsequence in a permutation. Our tour length estimates also answer questions on the asymptotics of the connect-the dots problem with Lipschitz functions which was raised in Adv. Appl. Probab. 37, 571–603 (2005). In the last section we show that all the above problems can be interpreted naturally, in terms of Lorentzian geometry. We generalize the main results to this setting.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aldous, D., Diaconis, P.: Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem. Bull. Am. Math. Soc. 36, 413–432 (1999)
Andrews, M., Bender, M.A., Zhang, L.: New algorithms for the disk scheduling problem. Algorithmica 32, 277–301 (2002) Conference version. In: Proceedings of FOCS, pp. 580–589 (October 1996)
Arias-Castro, E., Donoho, D.L., Huo, X., Tovey, C.A.: Connect-the-dots: how many random points can a regular curve pass through?. Adv. Appl. Probab. 37, 571–603 (2005). Correction: 38, 579 (2006)
Bachmat, E.: Average case analysis for batched disk scheduling and increasing subsequences. In: Proc. of the Symp. on Theo. of Comp. (STOC), Montreal (2002)
Bachmat, E.: Discrete spacetime and its applications. Preprint, gr-qc/0702140
Bachmat, E., Berend, D., Sapir, L., Skiena, S., Stolyarov, N.: Analysis of airplane boarding times (2005, submitted). Also at www.cs.bgu.ac.il/~ebachmat/#pubs
Bachmat, E., Berend, D., Sapir, L., Skiena, S., Stolyarov, N.: Analysis of airplane boarding via space-time geometry and random matrix theory. J. Phys. A: Math. Gen. 39, L453–L459 (2006)
Baik, J., Deift, P.A., Johansson, K.: On the distribution of the length of the length of the longest increasing subsequence of random permutations. J. Am. Math. Soc. 12, 1119–1178 (1999)
Bollobas, B., Brightwell, G.: Box-spaces and random partial orders. Trans. Am. Math. Soc. 324, 59–72 (1991)
Brightwell, G., Gregory, R.: Structure of random discrete space-time. Phys. Rev. Lett. 66, 260–263 (1991)
Carroll, S.M.: Spacetime and Geometry. Addison-Wesley, Reading (2004)
Deuschel, J.D., Zeitouni, O.: Limiting curves for iid records. Ann. Probab. 23, 852–878 (1995)
Johansson, K.: Transversal fluctuations for increasing subsequences on the plane. Probab. Theory Relat. Fields 116, 445–456 (2001)
Lowe, M., Merkl, F.: Moderate deviations for longest increasing subsequences: the upper tail. Commun. Pure Appl. Math. 54, 1488–1520 (2001)
Penrose, R.: Techniques of Differential Topology in Relativity. Regional Conference Series in Applied Mathematics, vol. 7. SIAM, Philadelphia (1972)
Author information
Authors and Affiliations
Corresponding author
Additional information
Research partially supported by an IBM faculty award.
Rights and permissions
About this article
Cite this article
Bachmat, E. Average Case Analysis of Disk Scheduling, Increasing Subsequences and Spacetime Geometry. Algorithmica 49, 212–231 (2007). https://doi.org/10.1007/s00453-007-9017-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-007-9017-6