Performance evaluation of mobile processes via abstract machines

We use a structural operational semantics which drives us in inferring quantitative measures on system evolution. The transitions of the system are labeled and we assign rates to them by only looking at these labels. The rates reflect the possibly distributed architecture on which applications run....

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on software engineering Vol. 27; no. 10; pp. 867 - 889
Main Authors Nottegar, C., Priami, C., Degano, P.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.10.2001
IEEE Computer Society
Subjects
Calculus
Case studies
Comparative analysis
Computation
Computer architecture
Design
Evolution
Humans
Labels
Markov analysis
Mathematical models
Network management systems
Performance analysis
Performance evaluation
Pipelines
Prefetching
Proposals
Quality management
Resource management
Semantics
Software engineering
Stochastic models
Stochastic systems
Studies
Systems development
Online AccessGet full text

Cover

More Information
Summary:We use a structural operational semantics which drives us in inferring quantitative measures on system evolution. The transitions of the system are labeled and we assign rates to them by only looking at these labels. The rates reflect the possibly distributed architecture on which applications run. We then map transition systems to Markov chains, and performance evaluation is carried out using standard tools. As a working example, we compare the performance of a conventional uniprocessor with a prefetch pipeline machine. We also consider two case studies from the literature involving mobile computation to show that our framework is feasible.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0098-5589
1939-3520
DOI:10.1109/32.962559