Large deviations for increasing subsequences of permutations and a concurrency application

Yuliy Baryshnikov, Abram Magner

研究成果: ジャーナルへの寄稿会議記事査読

抄録

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.

本文言語英語
ページ(範囲)39-41
ページ数3
ジャーナルPerformance Evaluation Review
45
2
DOI
出版ステータス出版済み - 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

  • ソフトウェア
  • ハードウェアとアーキテクチャ
  • コンピュータ ネットワークおよび通信

フィンガープリント

「Large deviations for increasing subsequences of permutations and a concurrency application」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル