The study of concurrent processes with conflict points is connected with the geometry of increasing subsequences of permutations - a permutation encodes the transactions of two processes that conflict (i.e., must be executed serially), and a given increasing subsequence encodes one particular serialization of the executions of two processes. This motivates the study of random increasing subsequences of random permutations. Here, we give a large deviation principle which implies that such a subsequence never deviates too far from the identity permutation: a random serialization of two concurrent processes will not favor either process too much at any given time. We then give an efficient exact algorithm for uniform random sampling of an increasing subsequence from a given permutation.
|ジャーナル||Performance Evaluation Review|
|出版ステータス||出版済み - 9月 1 2017|
|イベント||Workshop on MAthematical Performance Modeling and Analysis, MAMA 2017, 2017 Greenmetrics Workshop and Workshop on Critical Infrastructure Network Security, CINS 2017 - Urbana-Champaign, 米国|
継続期間: 6月 1 2017 → …
!!!All Science Journal Classification (ASJC) codes
- コンピュータ ネットワークおよび通信