Departmental Papers (CIS)

Date of this Version

June 2005

Document Type

Conference Paper

Comments

Postprint version. Published in Lecture Notes in Computer Science, Proceedings of the 14th International Conference on Concurrency Theory 2003 (CONCUR 2003), Volume 2761, pages 42-56.
Publisher URL: http://dx.doi.org/10.1007/b11938

Abstract

We introduce the problem of compressing partially ordered strings: given string σ ∈ Σ* and a binary independence relation I over Σ how can we compactly represent an input if the decompressor is allowed to reconstruct any string that can be obtained from σ by repeatedly swapping adjacent independent symbols? Such partially ordered strings are also known as Mazurkiewicz traces, and naturally model executions of concurrent programs. Compression techniques have been applied with much success to sequential program traces not only to store them compactly but to discover important profiling patterns within them. For compression to achieve similar aims for concurrent program traces we should exploit the extra freedom provided by the independence relation. Many popular string comrpession schemes are grammar-based schemes that produce a small context-free grammar generating uniquely the given string. We consider three classes of strategies for compression of partially-ordered strings: (i) we adapt grammar-based schemes by rewriting the input string σ into an "equivalent" one before applying grammar-based string compression, (ii) we present the input by a collection of projections before applying (i) to each projection, and (iii) we combine (i) and (ii) with relabeling of symbols. We present some natural algorithms for each of these strategies, and present some experimental evidence that the extra freedom does enable extra compression. We also prove that a strategy of projecting the string onto each pair of dependent symbols can indeed lead to exponentially more succinct representations compared with only rewriting, and is within a factor of |Σ|2 of the optimal strategy for combining projections with rewriting.

Subject Area

CPS Theory

Publication Source

CONCUR 2003 - Concurrency Theory

Volume

2761

Start Page

42

Last Page

56

DOI

10.1007/978-3-540-45187-7_3

Copyright/Permission Statement

© ACM 2003. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in Lecture Notes in Computer Science, http://dx.doi.org/10.1007/978-3-540-45187-7_3.

Share

COinS
 

Date Posted: 15 November 2005