Fast asynchronous systems in dense time
Theoretical Computer Science
Distributed Algorithms
Communication and Concurrency
Methods and Applications of (MAX, +) Linear Algebra
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
A Faster-than Relation for Asynchronous Processes
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Relating Processes With Respect to Speed
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Efficiency of Token-Passing MUTEX-Solutions - Some Experiments
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Measuring the performance of asynchronous systems with PAFAS
Theoretical Computer Science - Process algebra
| Hi-index | 0.00 |
A testing-based faster-than relation has previously been developed that compares the worst-case efficiency of asynchronous systems. This approach reveals that pipelining does not improve efficiency in general; that it does so in practice depends on assumptions about the user behaviour. Accordingly, the approach was adapted to a setting where user behaviour is known to belong to a specific, but often occurring class of request-response behaviours; some quantitative results on the efficiency of the respective so-called response processes were given. In particular, it was shown that in the adapted setting a very simple case of pipelined process with two stages is faster than a comparable atomic processing. In this paper, we determine the performance of general pipelines, study whether the adapted faster-than relation is compatible with chaining (used to build pipelines) and two other operators, and give results on the performance of the resp. compositions, demonstrating also how rich the request-respond setting is.