---
_id: '7355'
abstract:
- lang: eng
text: Dynamic Meta Modeling (DMM) is a visual semantics specification technique
targeted at languages based on a metamodel. A DMM specification consists of a
runtime metamodel and operational rules which describe how instances of the runtime
metamodel change over time. A known deficiency of the DMM approach is that it
does not support the refinement of a DMM specification, e.g., in the case of defining
the semantics for a refined and extended domain-specific language (DSL). Up to
now, DMM specifications could only be reused by adding or removing DMM rules.
In this paper, we enhance DMM such that DMM rules can override other DMM rules,
similar to a method being overridden in a subclass, and we show how rule overriding
can be realized with the graph transformation tool GROOVE. We argue that rule
overriding does not only have positive impact on reusability, but also improves
the intuitive understandability of DMM semantics specifications.
author:
- first_name: Christian
full_name: Soltenborn, Christian
id: '1737'
last_name: Soltenborn
orcid: 0000-0002-0342-8227
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: Soltenborn C, Engels G. Using rule overriding to improve reusability and understandability
of Dynamic Meta Modeling specifications. Journal of Visual Languages &
Computing. 2011;22(3):233-250. doi:10.1016/j.jvlc.2010.12.005
apa: Soltenborn, C., & Engels, G. (2011). Using rule overriding to improve reusability
and understandability of Dynamic Meta Modeling specifications. Journal of Visual
Languages & Computing, 22(3), 233–250. https://doi.org/10.1016/j.jvlc.2010.12.005
bibtex: '@article{Soltenborn_Engels_2011, title={Using rule overriding to improve
reusability and understandability of Dynamic Meta Modeling specifications}, volume={22},
DOI={10.1016/j.jvlc.2010.12.005},
number={3}, journal={Journal of Visual Languages & Computing}, publisher={Elsevier
BV}, author={Soltenborn, Christian and Engels, Gregor}, year={2011}, pages={233–250}
}'
chicago: 'Soltenborn, Christian, and Gregor Engels. “Using Rule Overriding to Improve
Reusability and Understandability of Dynamic Meta Modeling Specifications.” Journal
of Visual Languages & Computing 22, no. 3 (2011): 233–50. https://doi.org/10.1016/j.jvlc.2010.12.005.'
ieee: C. Soltenborn and G. Engels, “Using rule overriding to improve reusability
and understandability of Dynamic Meta Modeling specifications,” Journal of
Visual Languages & Computing, vol. 22, no. 3, pp. 233–250, 2011.
mla: Soltenborn, Christian, and Gregor Engels. “Using Rule Overriding to Improve
Reusability and Understandability of Dynamic Meta Modeling Specifications.” Journal
of Visual Languages & Computing, vol. 22, no. 3, Elsevier BV, 2011, pp.
233–50, doi:10.1016/j.jvlc.2010.12.005.
short: C. Soltenborn, G. Engels, Journal of Visual Languages & Computing 22
(2011) 233–250.
date_created: 2019-01-31T13:02:21Z
date_updated: 2022-01-06T07:03:35Z
department:
- _id: '66'
doi: 10.1016/j.jvlc.2010.12.005
intvolume: ' 22'
issue: '3'
language:
- iso: eng
page: 233-250
publication: Journal of Visual Languages & Computing
publication_identifier:
issn:
- 1045-926X
publication_status: published
publisher: Elsevier BV
status: public
title: Using rule overriding to improve reusability and understandability of Dynamic
Meta Modeling specifications
type: journal_article
user_id: '14955'
volume: 22
year: '2011'
...
---
_id: '7535'
author:
- first_name: Irina
full_name: Böckelmann, Irina
last_name: Böckelmann
- first_name: Daniel
full_name: Schenk, Daniel
last_name: Schenk
- first_name: Thoralf
full_name: Rößler, Thoralf
last_name: Rößler
- first_name: Simon
full_name: Adler, Simon
last_name: Adler
- first_name: Björn
full_name: Senft, Björn
id: '9109'
last_name: Senft
- first_name: Jens
full_name: Grubert, Jens
last_name: Grubert
- first_name: Rüdiger
full_name: Mecke, Rüdiger
last_name: Mecke
- first_name: Anke
full_name: Huckauf, Anke
last_name: Huckauf
- first_name: Mario
full_name: Urbina, Mario
last_name: Urbina
- first_name: Johannes
full_name: Tümler, Johannes
last_name: Tümler
- first_name: Sabine
full_name: Darius, Sabine
last_name: Darius
citation:
ama: 'Böckelmann I, Schenk D, Rößler T, et al. Physiologische Beanspruchungsreaktionen
bei der Anwendung von kopfgetragenen AR-Displays. In: ; 2011.'
apa: Böckelmann, I., Schenk, D., Rößler, T., Adler, S., Senft, B., Grubert, J.,
… Darius, S. (2011). Physiologische Beanspruchungsreaktionen bei der Anwendung
von kopfgetragenen AR-Displays. Presented at the 51. Wissenschaftliche Jahrestagung
der Deutschen Gesellschaft für Arbeitsmedizin und Umweltmedizin e. V. (DGAUM).
bibtex: '@inproceedings{Böckelmann_Schenk_Rößler_Adler_Senft_Grubert_Mecke_Huckauf_Urbina_Tümler_et
al._2011, title={Physiologische Beanspruchungsreaktionen bei der Anwendung von
kopfgetragenen AR-Displays}, author={Böckelmann, Irina and Schenk, Daniel and
Rößler, Thoralf and Adler, Simon and Senft, Björn and Grubert, Jens and Mecke,
Rüdiger and Huckauf, Anke and Urbina, Mario and Tümler, Johannes and et al.},
year={2011} }'
chicago: Böckelmann, Irina, Daniel Schenk, Thoralf Rößler, Simon Adler, Björn Senft,
Jens Grubert, Rüdiger Mecke, et al. “Physiologische Beanspruchungsreaktionen Bei
Der Anwendung von Kopfgetragenen AR-Displays,” 2011.
ieee: I. Böckelmann et al., “Physiologische Beanspruchungsreaktionen bei
der Anwendung von kopfgetragenen AR-Displays,” presented at the 51. Wissenschaftliche
Jahrestagung der Deutschen Gesellschaft für Arbeitsmedizin und Umweltmedizin e.
V. (DGAUM), 2011.
mla: Böckelmann, Irina, et al. Physiologische Beanspruchungsreaktionen Bei Der
Anwendung von Kopfgetragenen AR-Displays. 2011.
short: 'I. Böckelmann, D. Schenk, T. Rößler, S. Adler, B. Senft, J. Grubert, R.
Mecke, A. Huckauf, M. Urbina, J. Tümler, S. Darius, in: 2011.'
conference:
name: 51. Wissenschaftliche Jahrestagung der Deutschen Gesellschaft für Arbeitsmedizin
und Umweltmedizin e. V. (DGAUM)
date_created: 2019-02-05T12:36:59Z
date_updated: 2022-01-06T07:03:39Z
department:
- _id: '66'
language:
- iso: eng
status: public
title: Physiologische Beanspruchungsreaktionen bei der Anwendung von kopfgetragenen
AR-Displays
type: conference
user_id: '9109'
year: '2011'
...
---
_id: '7536'
author:
- first_name: Florian
full_name: Klompmaker, Florian
last_name: Klompmaker
- first_name: Björn
full_name: Senft, Björn
id: '9109'
last_name: Senft
- first_name: Karsten
full_name: Nebe, Karsten
last_name: Nebe
- first_name: Clemens
full_name: Busch, Clemens
last_name: Busch
- first_name: Detlev
full_name: Willemsen, Detlev
last_name: Willemsen
citation:
ama: 'Klompmaker F, Senft B, Nebe K, Busch C, Willemsen D. User Centered Design
Process of OSAMi-D - Developing User Interfaces for a Remote Ergometer Training
Application. In: {HEALTHINF} 2011 - Proceedings of the International Conference
on Health Informatics, Rome, Italy, 26-29 January, 2011. ; 2011:268-273.'
apa: Klompmaker, F., Senft, B., Nebe, K., Busch, C., & Willemsen, D. (2011).
User Centered Design Process of OSAMi-D - Developing User Interfaces for a Remote
Ergometer Training Application. In {HEALTHINF} 2011 - Proceedings of the International
Conference on Health Informatics, Rome, Italy, 26-29 January, 2011 (pp. 268–273).
bibtex: '@inproceedings{Klompmaker_Senft_Nebe_Busch_Willemsen_2011, title={User
Centered Design Process of OSAMi-D - Developing User Interfaces for a Remote Ergometer
Training Application}, booktitle={{HEALTHINF} 2011 - Proceedings of the International
Conference on Health Informatics, Rome, Italy, 26-29 January, 2011}, author={Klompmaker,
Florian and Senft, Björn and Nebe, Karsten and Busch, Clemens and Willemsen, Detlev},
year={2011}, pages={268–273} }'
chicago: Klompmaker, Florian, Björn Senft, Karsten Nebe, Clemens Busch, and Detlev
Willemsen. “User Centered Design Process of OSAMi-D - Developing User Interfaces
for a Remote Ergometer Training Application.” In {HEALTHINF} 2011 - Proceedings
of the International Conference on Health Informatics, Rome, Italy, 26-29 January,
2011, 268–73, 2011.
ieee: F. Klompmaker, B. Senft, K. Nebe, C. Busch, and D. Willemsen, “User Centered
Design Process of OSAMi-D - Developing User Interfaces for a Remote Ergometer
Training Application,” in {HEALTHINF} 2011 - Proceedings of the International
Conference on Health Informatics, Rome, Italy, 26-29 January, 2011, 2011,
pp. 268–273.
mla: Klompmaker, Florian, et al. “User Centered Design Process of OSAMi-D - Developing
User Interfaces for a Remote Ergometer Training Application.” {HEALTHINF} 2011
- Proceedings of the International Conference on Health Informatics, Rome, Italy,
26-29 January, 2011, 2011, pp. 268–73.
short: 'F. Klompmaker, B. Senft, K. Nebe, C. Busch, D. Willemsen, in: {HEALTHINF}
2011 - Proceedings of the International Conference on Health Informatics, Rome,
Italy, 26-29 January, 2011, 2011, pp. 268–273.'
date_created: 2019-02-05T12:41:05Z
date_updated: 2022-01-06T07:03:39Z
department:
- _id: '66'
language:
- iso: eng
page: 268-273
publication: '{HEALTHINF} 2011 - Proceedings of the International Conference on Health
Informatics, Rome, Italy, 26-29 January, 2011'
status: public
title: User Centered Design Process of OSAMi-D - Developing User Interfaces for a
Remote Ergometer Training Application
type: conference
user_id: '9109'
year: '2011'
...
---
_id: '8471'
abstract:
- lang: eng
text: Performance is an important quality attribute for business information systems.
When a tester has spotted a performance error, the error is passed to the software
developers to fix it. However, in component-based software development the tester
has to do blame analysis first, i. e. the tester has to decide, which party is
responsible to fix the error. If the error is a design or deployment issue, it
can be assigned to the software architect or the system deployer. If the error
is specific to a component, it needs to be assigned to the corresponding component
developer. An accurate blame analysis is important, because wrong assignments
of errors will cause a loss of time and money. Our approach aims at doing blame
analysis for performance errors by comparing performance metrics obtained in performance
testing and performance prediction. We use performance prediction values as expected
values for individual components. For performance prediction we use the Palladio
approach. By this means, our approach evaluates each component’s performance in
a certain test case. If the component performs poorly, its component developer
needs to fix the component or the architect replaces the component with a faster
one. If no omponent performs poorly, we can deduce that there is a design or deployment
issue and the architecture needs to be changed. In this paper, we present an exemplary
blame analysis based on a web shop system. The example shows the feasibility of
our approach.
author:
- first_name: Frank
full_name: Brüseke, Frank
last_name: Brüseke
- first_name: Steffen
full_name: Becker, Steffen
last_name: Becker
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Brüseke F, Becker S, Engels G. Palladio-based performance blame analysis.
In: Proceedings of the 16th International Workshop on Component-Oriented Programming
(WCOP; Satellite Event of the CompArch 2011), Boulder Colorado, CO (USA).
New York, NY (USA): ACM; 2011:25-32. doi:http://dx.doi.org/10.1145/2000292.2000298'
apa: 'Brüseke, F., Becker, S., & Engels, G. (2011). Palladio-based performance
blame analysis. In Proceedings of the 16th International Workshop on Component-Oriented
Programming (WCOP; satellite event of the CompArch 2011), Boulder Colorado, CO
(USA) (pp. 25–32). New York, NY (USA): ACM. http://dx.doi.org/10.1145/2000292.2000298'
bibtex: '@inproceedings{Brüseke_Becker_Engels_2011, place={New York, NY (USA)},
title={Palladio-based performance blame analysis}, DOI={http://dx.doi.org/10.1145/2000292.2000298},
booktitle={Proceedings of the 16th International Workshop on Component-Oriented
Programming (WCOP; satellite event of the CompArch 2011), Boulder Colorado, CO
(USA)}, publisher={ACM}, author={Brüseke, Frank and Becker, Steffen and Engels,
Gregor}, year={2011}, pages={25–32} }'
chicago: 'Brüseke, Frank, Steffen Becker, and Gregor Engels. “Palladio-Based Performance
Blame Analysis.” In Proceedings of the 16th International Workshop on Component-Oriented
Programming (WCOP; Satellite Event of the CompArch 2011), Boulder Colorado, CO
(USA), 25–32. New York, NY (USA): ACM, 2011. http://dx.doi.org/10.1145/2000292.2000298.'
ieee: F. Brüseke, S. Becker, and G. Engels, “Palladio-based performance blame analysis,”
in Proceedings of the 16th International Workshop on Component-Oriented Programming
(WCOP; satellite event of the CompArch 2011), Boulder Colorado, CO (USA),
2011, pp. 25–32.
mla: Brüseke, Frank, et al. “Palladio-Based Performance Blame Analysis.” Proceedings
of the 16th International Workshop on Component-Oriented Programming (WCOP; Satellite
Event of the CompArch 2011), Boulder Colorado, CO (USA), ACM, 2011, pp. 25–32,
doi:http://dx.doi.org/10.1145/2000292.2000298.
short: 'F. Brüseke, S. Becker, G. Engels, in: Proceedings of the 16th International
Workshop on Component-Oriented Programming (WCOP; Satellite Event of the CompArch
2011), Boulder Colorado, CO (USA), ACM, New York, NY (USA), 2011, pp. 25–32.'
date_created: 2019-03-08T09:36:29Z
date_updated: 2022-01-06T07:03:55Z
department:
- _id: '66'
doi: http://dx.doi.org/10.1145/2000292.2000298
language:
- iso: eng
page: 25-32
place: New York, NY (USA)
publication: Proceedings of the 16th International Workshop on Component-Oriented
Programming (WCOP; satellite event of the CompArch 2011), Boulder Colorado, CO (USA)
publisher: ACM
status: public
title: Palladio-based performance blame analysis
type: conference
user_id: '52534'
year: '2011'
...
---
_id: '8472'
author:
- first_name: 'Benjamin '
full_name: 'Nagel, Benjamin '
last_name: Nagel
citation:
ama: 'Nagel B. Semi-automatische Ableitung externer Anpassungsmechanismen für selbst-adaptive
Systeme. In: Proceedings of the Software Engineering 2011 (SE 2011), Karlsruhe
(Germany). Lecture Notes in Informatics. Bonn: Gesellschaft für Informatik
(GI); 2011.'
apa: 'Nagel, B. (2011). Semi-automatische Ableitung externer Anpassungsmechanismen
für selbst-adaptive Systeme. In Proceedings of the Software Engineering 2011
(SE 2011), Karlsruhe (Germany). Bonn: Gesellschaft für Informatik (GI).'
bibtex: '@inproceedings{Nagel_2011, place={Bonn}, series={Lecture Notes in Informatics},
title={Semi-automatische Ableitung externer Anpassungsmechanismen für selbst-adaptive
Systeme}, booktitle={Proceedings of the Software Engineering 2011 (SE 2011), Karlsruhe
(Germany)}, publisher={Gesellschaft für Informatik (GI)}, author={Nagel, Benjamin
}, year={2011}, collection={Lecture Notes in Informatics} }'
chicago: 'Nagel, Benjamin . “Semi-Automatische Ableitung Externer Anpassungsmechanismen
Für Selbst-Adaptive Systeme.” In Proceedings of the Software Engineering 2011
(SE 2011), Karlsruhe (Germany). Lecture Notes in Informatics. Bonn: Gesellschaft
für Informatik (GI), 2011.'
ieee: B. Nagel, “Semi-automatische Ableitung externer Anpassungsmechanismen für
selbst-adaptive Systeme,” in Proceedings of the Software Engineering 2011 (SE
2011), Karlsruhe (Germany), 2011.
mla: Nagel, Benjamin. “Semi-Automatische Ableitung Externer Anpassungsmechanismen
Für Selbst-Adaptive Systeme.” Proceedings of the Software Engineering 2011
(SE 2011), Karlsruhe (Germany), Gesellschaft für Informatik (GI), 2011.
short: 'B. Nagel, in: Proceedings of the Software Engineering 2011 (SE 2011), Karlsruhe
(Germany), Gesellschaft für Informatik (GI), Bonn, 2011.'
date_created: 2019-03-08T09:38:16Z
date_updated: 2022-01-06T07:03:55Z
department:
- _id: '66'
language:
- iso: eng
place: Bonn
publication: Proceedings of the Software Engineering 2011 (SE 2011), Karlsruhe (Germany)
publisher: Gesellschaft für Informatik (GI)
series_title: Lecture Notes in Informatics
status: public
title: Semi-automatische Ableitung externer Anpassungsmechanismen für selbst-adaptive
Systeme
type: conference
user_id: '52534'
year: '2011'
...
---
_id: '646'
abstract:
- lang: eng
text: This paper presents a dynamic overlay network based on the De Bruijn graph
which we call Linearized De Bruijn (LDB) network. The LDB network has the advantage
that it has a guaranteed constant node degree and that the routing between any
two nodes takes at most O(log n) hops with high probability. Also, we show that
there is a simple local-control algorithm that can recover the LDB network from
any network topology that is weakly connected.
author:
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Richa AW, Scheideler C. Self-Stabilizing DeBruijn Networks. In: Proceedings
of the 13th International Symposium on Stabilization, Safety, and Security of
Distributed Systems (SSS). LNCS. ; 2011:416-430. doi:10.1007/978-3-642-24550-3_31'
apa: Richa, A. W., & Scheideler, C. (2011). Self-Stabilizing DeBruijn Networks.
In Proceedings of the 13th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS) (pp. 416–430). https://doi.org/10.1007/978-3-642-24550-3_31
bibtex: '@inproceedings{Richa_Scheideler_2011, series={LNCS}, title={Self-Stabilizing
DeBruijn Networks}, DOI={10.1007/978-3-642-24550-3_31},
booktitle={Proceedings of the 13th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)}, author={Richa, Andrea W. and Scheideler,
Christian}, year={2011}, pages={416–430}, collection={LNCS} }'
chicago: Richa, Andrea W., and Christian Scheideler. “Self-Stabilizing DeBruijn
Networks.” In Proceedings of the 13th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS), 416–30. LNCS, 2011. https://doi.org/10.1007/978-3-642-24550-3_31.
ieee: A. W. Richa and C. Scheideler, “Self-Stabilizing DeBruijn Networks,” in Proceedings
of the 13th International Symposium on Stabilization, Safety, and Security of
Distributed Systems (SSS), 2011, pp. 416–430.
mla: Richa, Andrea W., and Christian Scheideler. “Self-Stabilizing DeBruijn Networks.”
Proceedings of the 13th International Symposium on Stabilization, Safety, and
Security of Distributed Systems (SSS), 2011, pp. 416–30, doi:10.1007/978-3-642-24550-3_31.
short: 'A.W. Richa, C. Scheideler, in: Proceedings of the 13th International Symposium
on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp.
416–430.'
date_created: 2017-10-17T12:42:58Z
date_updated: 2022-01-06T07:03:06Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-24550-3_31
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T13:57:26Z
date_updated: 2018-03-14T13:57:26Z
file_id: '1227'
file_name: 646-SSS2011-Scheideler_02.pdf
file_size: 339664
relation: main_file
success: 1
file_date_updated: 2018-03-14T13:57:26Z
has_accepted_license: '1'
page: 416-430
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 13th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)
series_title: LNCS
status: public
title: Self-Stabilizing DeBruijn Networks
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '647'
author:
- first_name: Michael
full_name: Leuschel, Michael
last_name: Leuschel
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Leuschel M, Wehrheim H. Selected papers on Integrated Formal Methods (iFM09).
Science of Computer Programming. 2011;(10):835--836. doi:10.1016/j.scico.2011.01.009
apa: Leuschel, M., & Wehrheim, H. (2011). Selected papers on Integrated Formal
Methods (iFM09). Science of Computer Programming, (10), 835--836. https://doi.org/10.1016/j.scico.2011.01.009
bibtex: '@article{Leuschel_Wehrheim_2011, title={Selected papers on Integrated Formal
Methods (iFM09)}, DOI={10.1016/j.scico.2011.01.009},
number={10}, journal={Science of Computer Programming}, publisher={Elsevier},
author={Leuschel, Michael and Wehrheim, Heike}, year={2011}, pages={835--836}
}'
chicago: 'Leuschel, Michael, and Heike Wehrheim. “Selected Papers on Integrated
Formal Methods (IFM09).” Science of Computer Programming, no. 10 (2011):
835--836. https://doi.org/10.1016/j.scico.2011.01.009.'
ieee: M. Leuschel and H. Wehrheim, “Selected papers on Integrated Formal Methods
(iFM09),” Science of Computer Programming, no. 10, pp. 835--836, 2011.
mla: Leuschel, Michael, and Heike Wehrheim. “Selected Papers on Integrated Formal
Methods (IFM09).” Science of Computer Programming, no. 10, Elsevier, 2011,
pp. 835--836, doi:10.1016/j.scico.2011.01.009.
short: M. Leuschel, H. Wehrheim, Science of Computer Programming (2011) 835--836.
date_created: 2017-10-17T12:42:58Z
date_updated: 2022-01-06T07:03:06Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1016/j.scico.2011.01.009
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T13:56:48Z
date_updated: 2018-03-14T13:56:48Z
file_id: '1226'
file_name: 647-LeuschelWehrheim.pdf
file_size: 139105
relation: main_file
success: 1
file_date_updated: 2018-03-14T13:56:48Z
has_accepted_license: '1'
issue: '10'
language:
- iso: eng
page: 835--836
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Science of Computer Programming
publisher: Elsevier
status: public
title: Selected papers on Integrated Formal Methods (iFM09)
type: journal_article
user_id: '477'
year: '2011'
...
---
_id: '648'
author:
- first_name: Philipp
full_name: Brandes, Philipp
last_name: Brandes
citation:
ama: Brandes P. Robust Distributed Computation in Dynamic Networks. Universität
Paderborn; 2011.
apa: Brandes, P. (2011). Robust Distributed Computation in Dynamic Networks.
Universität Paderborn.
bibtex: '@book{Brandes_2011, title={Robust Distributed Computation in Dynamic Networks},
publisher={Universität Paderborn}, author={Brandes, Philipp}, year={2011} }'
chicago: Brandes, Philipp. Robust Distributed Computation in Dynamic Networks.
Universität Paderborn, 2011.
ieee: P. Brandes, Robust Distributed Computation in Dynamic Networks. Universität
Paderborn, 2011.
mla: Brandes, Philipp. Robust Distributed Computation in Dynamic Networks.
Universität Paderborn, 2011.
short: P. Brandes, Robust Distributed Computation in Dynamic Networks, Universität
Paderborn, 2011.
date_created: 2017-10-17T12:42:58Z
date_updated: 2022-01-06T07:03:06Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Robust Distributed Computation in Dynamic Networks
type: mastersthesis
user_id: '477'
year: '2011'
...
---
_id: '649'
abstract:
- lang: eng
text: 'Today, the concept of service oriented architectures provides a way of building
integrated solutions out of existing services. To this end, services from different
providers are composed using advanced orchestration and choreography techniques.
However, while this principle allows for greater flexibility at a smaller cost,
the use of third party services also includes a risk: Deployed services might
not work as claimed by their providers. In this paper, we propose a technique
for analyzing the expected reliability of service compositions based on ratings
given by (previous) service users. Every service thereby comes with a reputation,
and the analysis computes an overall reliability of a service composition from
the reputations of its constituent services. The proposed model-driven approach
proceeds by translating statechart models of service compositions into input for
a probabilistic model checker (PRISM) using state-of-the-art model transformations
techniques. The approach has been implemented as an Eclipse plug-in and is fully
compliant with UML.'
author:
- first_name: Galina
full_name: Besova, Galina
last_name: Besova
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: Annika
full_name: Wagner, Annika
last_name: Wagner
citation:
ama: Besova G, Wehrheim H, Wagner A. Reputation-based Reliability Prediction of
Service Compositions. Electronic Notes in Theoretical Computer Science.
2011;(2):3-16. doi:10.1016/j.entcs.2011.11.008
apa: Besova, G., Wehrheim, H., & Wagner, A. (2011). Reputation-based Reliability
Prediction of Service Compositions. Electronic Notes in Theoretical Computer
Science, (2), 3–16. https://doi.org/10.1016/j.entcs.2011.11.008
bibtex: '@article{Besova_Wehrheim_Wagner_2011, title={Reputation-based Reliability
Prediction of Service Compositions}, DOI={10.1016/j.entcs.2011.11.008},
number={2}, journal={Electronic Notes in Theoretical Computer Science}, publisher={Elsevier},
author={Besova, Galina and Wehrheim, Heike and Wagner, Annika}, year={2011}, pages={3–16}
}'
chicago: 'Besova, Galina, Heike Wehrheim, and Annika Wagner. “Reputation-Based Reliability
Prediction of Service Compositions.” Electronic Notes in Theoretical Computer
Science, no. 2 (2011): 3–16. https://doi.org/10.1016/j.entcs.2011.11.008.'
ieee: G. Besova, H. Wehrheim, and A. Wagner, “Reputation-based Reliability Prediction
of Service Compositions,” Electronic Notes in Theoretical Computer Science,
no. 2, pp. 3–16, 2011.
mla: Besova, Galina, et al. “Reputation-Based Reliability Prediction of Service
Compositions.” Electronic Notes in Theoretical Computer Science, no. 2,
Elsevier, 2011, pp. 3–16, doi:10.1016/j.entcs.2011.11.008.
short: G. Besova, H. Wehrheim, A. Wagner, Electronic Notes in Theoretical Computer
Science (2011) 3–16.
date_created: 2017-10-17T12:42:58Z
date_updated: 2022-01-06T07:03:07Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1016/j.entcs.2011.11.008
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T13:55:38Z
date_updated: 2018-03-14T13:55:38Z
file_id: '1225'
file_name: 649-ETAPS2011-Besova-Wehrheim-Wagner_01.pdf
file_size: 534727
relation: main_file
success: 1
file_date_updated: 2018-03-14T13:55:38Z
has_accepted_license: '1'
issue: '2'
language:
- iso: eng
page: 3-16
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Electronic Notes in Theoretical Computer Science
publisher: Elsevier
status: public
title: Reputation-based Reliability Prediction of Service Compositions
type: journal_article
user_id: '477'
year: '2011'
...
---
_id: '650'
author:
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
citation:
ama: Platenius MC. Reengineering of Design Deficiencies in Component-Based Software
Architectures. Universität Paderborn; 2011.
apa: Platenius, M. C. (2011). Reengineering of Design Deficiencies in Component-Based
Software Architectures. Universität Paderborn.
bibtex: '@book{Platenius_2011, title={Reengineering of Design Deficiencies in Component-Based
Software Architectures}, publisher={Universität Paderborn}, author={Platenius,
Marie Christin}, year={2011} }'
chicago: Platenius, Marie Christin. Reengineering of Design Deficiencies in Component-Based
Software Architectures. Universität Paderborn, 2011.
ieee: M. C. Platenius, Reengineering of Design Deficiencies in Component-Based
Software Architectures. Universität Paderborn, 2011.
mla: Platenius, Marie Christin. Reengineering of Design Deficiencies in Component-Based
Software Architectures. Universität Paderborn, 2011.
short: M.C. Platenius, Reengineering of Design Deficiencies in Component-Based Software
Architectures, Universität Paderborn, 2011.
date_created: 2017-10-17T12:42:58Z
date_updated: 2022-01-06T07:03:08Z
department:
- _id: '76'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Reengineering of Design Deficiencies in Component-Based Software Architectures
type: mastersthesis
user_id: '477'
year: '2011'
...
---
_id: '652'
abstract:
- lang: eng
text: In the development process of service-oriented systems, business process models
are used at different levels. Typically, high-level business process models that
describe business requirements and needs are stepwise refined to the IT level
by different business modelers and software architects. As a result, different
process model versions must be compared and merged by means of model version control.
An important prerequisite for process model version control is an elaborated matching
approach that results in precise mappings between different process model versions.
The challenge of such an approach is to deal with syntactically different process
models that are semantically equivalent. For that purpose, matching techniques
must consider the semantics of process modeling languages.In this paper, we present
a matching approach for process models in a versioning scenario. Based on a term
formalization of process models, we enable an efficient and effective way to match
syntactically different but semantically equivalent process models resulting in
precise mappings.
author:
- first_name: Christian
full_name: Gerth, Christian
last_name: Gerth
- first_name: Markus
full_name: Luckey, Markus
last_name: Luckey
- first_name: Jochen
full_name: Küster, Jochen
last_name: Küster
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Gerth C, Luckey M, Küster J, Engels G. Precise Mappings between Business Process
Models in Versioning Scenarios. In: Proceedings of the IEEE 8th International
Conference on Service Computingt (SCC). ; 2011:218--225. doi:10.1109/SCC.2011.65'
apa: Gerth, C., Luckey, M., Küster, J., & Engels, G. (2011). Precise Mappings
between Business Process Models in Versioning Scenarios. In Proceedings of
the IEEE 8th International Conference on Service Computingt (SCC) (pp. 218--225).
https://doi.org/10.1109/SCC.2011.65
bibtex: '@inproceedings{Gerth_Luckey_Küster_Engels_2011, title={Precise Mappings
between Business Process Models in Versioning Scenarios}, DOI={10.1109/SCC.2011.65},
booktitle={Proceedings of the IEEE 8th International Conference on Service Computingt
(SCC)}, author={Gerth, Christian and Luckey, Markus and Küster, Jochen and Engels,
Gregor}, year={2011}, pages={218--225} }'
chicago: Gerth, Christian, Markus Luckey, Jochen Küster, and Gregor Engels. “Precise
Mappings between Business Process Models in Versioning Scenarios.” In Proceedings
of the IEEE 8th International Conference on Service Computingt (SCC), 218--225,
2011. https://doi.org/10.1109/SCC.2011.65.
ieee: C. Gerth, M. Luckey, J. Küster, and G. Engels, “Precise Mappings between Business
Process Models in Versioning Scenarios,” in Proceedings of the IEEE 8th International
Conference on Service Computingt (SCC), 2011, pp. 218--225.
mla: Gerth, Christian, et al. “Precise Mappings between Business Process Models
in Versioning Scenarios.” Proceedings of the IEEE 8th International Conference
on Service Computingt (SCC), 2011, pp. 218--225, doi:10.1109/SCC.2011.65.
short: 'C. Gerth, M. Luckey, J. Küster, G. Engels, in: Proceedings of the IEEE 8th
International Conference on Service Computingt (SCC), 2011, pp. 218--225.'
date_created: 2017-10-17T12:42:59Z
date_updated: 2022-01-06T07:03:10Z
ddc:
- '040'
department:
- _id: '66'
doi: 10.1109/SCC.2011.65
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T13:53:51Z
date_updated: 2018-03-14T13:53:51Z
file_id: '1223'
file_name: 652-06009264.pdf
file_size: 713943
relation: main_file
success: 1
file_date_updated: 2018-03-14T13:53:51Z
has_accepted_license: '1'
language:
- iso: eng
page: 218--225
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the IEEE 8th International Conference on Service Computingt
(SCC)
status: public
title: Precise Mappings between Business Process Models in Versioning Scenarios
type: conference
user_id: '477'
year: '2011'
...
---
_id: '654'
abstract:
- lang: eng
text: Research on peer-to-peer (p2p) and distributed systems needs evaluation tools
to predict and observe the behavior of protocols and mechanisms in large scale
networks. PeerfactSim.KOM is a simulator for large scale distributed/p2p systems
aiming at the evaluation of interdependencies in multi-layered p2p systems. The
simulator is written in Java, is event-based and mainly used in p2p research projects.
The main development of PeerfactSim.KOM started in 2005 and is driven since 2006
by the project “QuaP2P”,which aims at the systematic improvement and benchmarking
of p2p systems. Further users of the simulator are working in the project “On-the-fly
Computing” aiming at researching p2p-based service oriented architectures. Both
projects state severe requirements on the evaluation of multi-layered and large-scale
distributed systems. We describe the architecture of PeerfactSim.KOM supporting
these requirements in Section II, present the workflow, selected experiences and
lessons learned in Section III and conclude the overview in Section IV.
author:
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
citation:
ama: 'Graffi K. PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons
Learned. In: Proceedings of the IEEE International Conference on Peer-to-Peer
Computing (IEEE PsP). ; 2011:154-155. doi:10.1109/P2P.2011.6038673'
apa: 'Graffi, K. (2011). PeerfactSim.KOM: A PSP System Simulator - Experiences and
Lessons Learned. In Proceedings of the IEEE International Conference on Peer-to-Peer
Computing (IEEE PsP) (pp. 154–155). https://doi.org/10.1109/P2P.2011.6038673'
bibtex: '@inproceedings{Graffi_2011, title={PeerfactSim.KOM: A PSP System Simulator
- Experiences and Lessons Learned}, DOI={10.1109/P2P.2011.6038673},
booktitle={Proceedings of the IEEE International Conference on Peer-to-Peer Computing
(IEEE PsP)}, author={Graffi, Kalman}, year={2011}, pages={154–155} }'
chicago: 'Graffi, Kalman. “PeerfactSim.KOM: A PSP System Simulator - Experiences
and Lessons Learned.” In Proceedings of the IEEE International Conference on
Peer-to-Peer Computing (IEEE PsP), 154–55, 2011. https://doi.org/10.1109/P2P.2011.6038673.'
ieee: 'K. Graffi, “PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons
Learned,” in Proceedings of the IEEE International Conference on Peer-to-Peer
Computing (IEEE PsP), 2011, pp. 154–155.'
mla: 'Graffi, Kalman. “PeerfactSim.KOM: A PSP System Simulator - Experiences and
Lessons Learned.” Proceedings of the IEEE International Conference on Peer-to-Peer
Computing (IEEE PsP), 2011, pp. 154–55, doi:10.1109/P2P.2011.6038673.'
short: 'K. Graffi, in: Proceedings of the IEEE International Conference on Peer-to-Peer
Computing (IEEE PsP), 2011, pp. 154–155.'
date_created: 2017-10-17T12:42:59Z
date_updated: 2022-01-06T07:03:11Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/P2P.2011.6038673
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T13:50:18Z
date_updated: 2018-03-14T13:50:18Z
file_id: '1221'
file_name: 654-IEEE.P2P.11._Kalman.Graffi_PeerfactSim-A.P2P.System.Simulator_01.pdf
file_size: 327680
relation: main_file
success: 1
file_date_updated: 2018-03-14T13:50:18Z
has_accepted_license: '1'
language:
- iso: eng
page: 154-155
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the IEEE International Conference on Peer-to-Peer Computing
(IEEE PsP)
status: public
title: 'PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned'
type: conference
user_id: '477'
year: '2011'
...
---
_id: '657'
abstract:
- lang: eng
text: 'We present two distributed, constant factor approximation algorithms for
the metric facility location problem. Both algorithms have been designed with
a strong emphasis on applicability in the area of wireless sensor networks: in
order to execute them, each sensor node only requires limited local knowledge
and simple computations. Also, the algorithms can cope with measurement errors
and take into account that communication costs between sensor nodes do not necessarily
increase linearly with the distance, but can be represented by a polynomial. Since
it cannot always be expected that sensor nodes execute algorithms in a synchronized
way, our algorithms are executed in an asynchronous model (but they are still
able to break symmetry that might occur when two neighboring nodes act at exactly
the same time). Furthermore, they can deal with dynamic scenarios: if a node moves,
the solution is updated and the update affects only nodes in the local neighborhood.
Finally, the algorithms are robust in the sense that incorrect behavior of some
nodes during some round will, in the end, still result in a good approximation.
The first algorithm runs in expected O(log_{1+\epsilon} n) communication rounds
and yields a \my^4(1+4\my^2(1+\epsilon)^{1/p})^p approximation, while the second
has a running time of expected O(log^2_{1+\epsilon} n) communication rounds and
an approximation factor of \my^4(1 + 2(1 + \epsilon)^{1/p})^p. Here, \epsilon
> 0 is an arbitrarily small constant, p the exponent of the polynomial representing
the communication costs, and \my the relative measurement error.'
author:
- first_name: Sebastan
full_name: Abshoff, Sebastan
last_name: Abshoff
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: 'Barbara '
full_name: 'Kempkes, Barbara '
last_name: Kempkes
- first_name: Peter
full_name: Pietrzyk, Peter
last_name: Pietrzyk
citation:
ama: 'Abshoff S, Cord-Landwehr A, Degener B, Kempkes B, Pietrzyk P. Local Approximation
Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware
Sensor Networks. In: Proceedings of the 7th International Symposium on Algorithms
for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS).
LNCS. ; 2011:13-27. doi:10.1007/978-3-642-28209-6_3'
apa: Abshoff, S., Cord-Landwehr, A., Degener, B., Kempkes, B., & Pietrzyk, P.
(2011). Local Approximation Algorithms for the Uncapacitated Metric Facility Location
Problem in Power-Aware Sensor Networks. In Proceedings of the 7th International
Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous
Mobile Entities (ALGOSENSORS) (pp. 13–27). https://doi.org/10.1007/978-3-642-28209-6_3
bibtex: '@inproceedings{Abshoff_Cord-Landwehr_Degener_Kempkes_Pietrzyk_2011, series={LNCS},
title={Local Approximation Algorithms for the Uncapacitated Metric Facility Location
Problem in Power-Aware Sensor Networks}, DOI={10.1007/978-3-642-28209-6_3},
booktitle={Proceedings of the 7th International Symposium on Algorithms for Sensor
Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)},
author={Abshoff, Sebastan and Cord-Landwehr, Andreas and Degener, Bastian and
Kempkes, Barbara and Pietrzyk, Peter}, year={2011}, pages={13–27}, collection={LNCS}
}'
chicago: Abshoff, Sebastan, Andreas Cord-Landwehr, Bastian Degener, Barbara Kempkes,
and Peter Pietrzyk. “Local Approximation Algorithms for the Uncapacitated Metric
Facility Location Problem in Power-Aware Sensor Networks.” In Proceedings of
the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad
Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS), 13–27. LNCS, 2011.
https://doi.org/10.1007/978-3-642-28209-6_3.
ieee: S. Abshoff, A. Cord-Landwehr, B. Degener, B. Kempkes, and P. Pietrzyk, “Local
Approximation Algorithms for the Uncapacitated Metric Facility Location Problem
in Power-Aware Sensor Networks,” in Proceedings of the 7th International Symposium
on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile
Entities (ALGOSENSORS), 2011, pp. 13–27.
mla: Abshoff, Sebastan, et al. “Local Approximation Algorithms for the Uncapacitated
Metric Facility Location Problem in Power-Aware Sensor Networks.” Proceedings
of the 7th International Symposium on Algorithms for Sensor Systems, Wireless
Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS), 2011, pp. 13–27,
doi:10.1007/978-3-642-28209-6_3.
short: 'S. Abshoff, A. Cord-Landwehr, B. Degener, B. Kempkes, P. Pietrzyk, in: Proceedings
of the 7th International Symposium on Algorithms for Sensor Systems, Wireless
Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS), 2011, pp. 13–27.'
date_created: 2017-10-17T12:43:00Z
date_updated: 2022-01-06T07:03:12Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-642-28209-6_3
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T13:48:21Z
date_updated: 2018-03-14T13:48:21Z
file_id: '1219'
file_name: 657-flp_algosensors2011-Cord-Landwehr.pdf
file_size: 454740
relation: main_file
success: 1
file_date_updated: 2018-03-14T13:48:21Z
has_accepted_license: '1'
language:
- iso: eng
page: 13-27
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 7th International Symposium on Algorithms for Sensor
Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)
series_title: LNCS
status: public
title: Local Approximation Algorithms for the Uncapacitated Metric Facility Location
Problem in Power-Aware Sensor Networks
type: conference
user_id: '477'
year: '2011'
...
---
_id: '658'
author:
- first_name: Alexander
full_name: Schremmer, Alexander
last_name: Schremmer
citation:
ama: Schremmer A. Function Specification Inference Using Craig Interpolation.
Universität Paderborn; 2011.
apa: Schremmer, A. (2011). Function Specification Inference Using Craig Interpolation.
Universität Paderborn.
bibtex: '@book{Schremmer_2011, title={Function Specification Inference Using Craig
Interpolation}, publisher={Universität Paderborn}, author={Schremmer, Alexander},
year={2011} }'
chicago: Schremmer, Alexander. Function Specification Inference Using Craig Interpolation.
Universität Paderborn, 2011.
ieee: A. Schremmer, Function Specification Inference Using Craig Interpolation.
Universität Paderborn, 2011.
mla: Schremmer, Alexander. Function Specification Inference Using Craig Interpolation.
Universität Paderborn, 2011.
short: A. Schremmer, Function Specification Inference Using Craig Interpolation,
Universität Paderborn, 2011.
date_created: 2017-10-17T12:43:00Z
date_updated: 2022-01-06T07:03:12Z
department:
- _id: '77'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Function Specification Inference Using Craig Interpolation
type: mastersthesis
user_id: '477'
year: '2011'
...
---
_id: '659'
author:
- first_name: Gennadij
full_name: Liske, Gennadij
last_name: Liske
citation:
ama: Liske G. Fault Attacks in Pairing-Based Cryptography. Universität Paderborn;
2011.
apa: Liske, G. (2011). Fault attacks in pairing-based cryptography. Universität
Paderborn.
bibtex: '@book{Liske_2011, title={Fault attacks in pairing-based cryptography},
publisher={Universität Paderborn}, author={Liske, Gennadij}, year={2011} }'
chicago: Liske, Gennadij. Fault Attacks in Pairing-Based Cryptography. Universität
Paderborn, 2011.
ieee: G. Liske, Fault attacks in pairing-based cryptography. Universität
Paderborn, 2011.
mla: Liske, Gennadij. Fault Attacks in Pairing-Based Cryptography. Universität
Paderborn, 2011.
short: G. Liske, Fault Attacks in Pairing-Based Cryptography, Universität Paderborn,
2011.
date_created: 2017-10-17T12:43:00Z
date_updated: 2022-01-06T07:03:13Z
ddc:
- '040'
department:
- _id: '64'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T13:47:44Z
date_updated: 2018-03-14T13:47:44Z
file_id: '1218'
file_name: 659-MA_Fault_attacks_in_pairing-based_cryptography_01.pdf
file_size: 1795920
relation: main_file
success: 1
file_date_updated: 2018-03-14T13:47:44Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '43'
name: Securing the Financial Cloud
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Fault attacks in pairing-based cryptography
type: mastersthesis
user_id: '25078'
year: '2011'
...
---
_id: '660'
author:
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
citation:
ama: Peuster M. Defining and Deploying Complex Applicances in Multi-Site Cloud
Environments. Universität Paderborn; 2011.
apa: Peuster, M. (2011). Defining and Deploying Complex Applicances in Multi-Site
Cloud Environments. Universität Paderborn.
bibtex: '@book{Peuster_2011, title={Defining and Deploying Complex Applicances in
Multi-Site Cloud Environments}, publisher={Universität Paderborn}, author={Peuster,
Manuel}, year={2011} }'
chicago: Peuster, Manuel. Defining and Deploying Complex Applicances in Multi-Site
Cloud Environments. Universität Paderborn, 2011.
ieee: M. Peuster, Defining and Deploying Complex Applicances in Multi-Site Cloud
Environments. Universität Paderborn, 2011.
mla: Peuster, Manuel. Defining and Deploying Complex Applicances in Multi-Site
Cloud Environments. Universität Paderborn, 2011.
short: M. Peuster, Defining and Deploying Complex Applicances in Multi-Site Cloud
Environments, Universität Paderborn, 2011.
date_created: 2017-10-17T12:43:00Z
date_updated: 2022-01-06T07:03:13Z
department:
- _id: '75'
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Defining and Deploying Complex Applicances in Multi-Site Cloud Environments
type: bachelorsthesis
user_id: '15504'
year: '2011'
...
---
_id: '661'
author:
- first_name: Svetlana
full_name: Arifulina, Svetlana
last_name: Arifulina
citation:
ama: Arifulina S. Coverage Criteria for Testing DMM Specifications. Universität
Paderborn; 2011.
apa: Arifulina, S. (2011). Coverage Criteria for Testing DMM Specifications.
Universität Paderborn.
bibtex: '@book{Arifulina_2011, title={Coverage Criteria for Testing DMM Specifications},
publisher={Universität Paderborn}, author={Arifulina, Svetlana}, year={2011} }'
chicago: Arifulina, Svetlana. Coverage Criteria for Testing DMM Specifications.
Universität Paderborn, 2011.
ieee: S. Arifulina, Coverage Criteria for Testing DMM Specifications. Universität
Paderborn, 2011.
mla: Arifulina, Svetlana. Coverage Criteria for Testing DMM Specifications.
Universität Paderborn, 2011.
short: S. Arifulina, Coverage Criteria for Testing DMM Specifications, Universität
Paderborn, 2011.
date_created: 2017-10-17T12:43:00Z
date_updated: 2022-01-06T07:03:13Z
department:
- _id: '66'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
title: Coverage Criteria for Testing DMM Specifications
type: mastersthesis
user_id: '477'
year: '2011'
...
---
_id: '662'
abstract:
- lang: eng
text: We present Corona, a deterministic self-stabilizing algorithm for skip list
construction in structured overlay networks. Corona operates in the low-atomicity
message-passing asynchronous system model. Corona requires constant process memory
space for its operation and, therefore, scales well. We prove the general necessary
conditions limiting the initial states from which a self-stabilizing structured
overlay network in message-passing system can be constructed. The conditions require
that initial state information has to form a weakly connected graph and it should
only contain identiers that are present in the system. We formally describe Corona
and rigorously prove that it stabilizes from an arbitrary initial state subject
to the necessary conditions. We extend Corona to construct a skip graph.
author:
- first_name: Mikhail
full_name: Nesterenko, Mikhail
last_name: Nesterenko
- first_name: Rizal
full_name: Mohd, Rizal
last_name: Mohd
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Nesterenko M, Mohd R, Scheideler C. Corona: A Stabilizing Deterministic Message-Passing
Skip List. In: Proceedings of the 13th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS). LNCS. ; 2011:356--370.
doi:10.1007/978-3-642-24550-3_27'
apa: 'Nesterenko, M., Mohd, R., & Scheideler, C. (2011). Corona: A Stabilizing
Deterministic Message-Passing Skip List. In Proceedings of the 13th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)
(pp. 356--370). https://doi.org/10.1007/978-3-642-24550-3_27'
bibtex: '@inproceedings{Nesterenko_Mohd_Scheideler_2011, series={LNCS}, title={Corona:
A Stabilizing Deterministic Message-Passing Skip List}, DOI={10.1007/978-3-642-24550-3_27},
booktitle={Proceedings of the 13th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)}, author={Nesterenko, Mikhail and Mohd,
Rizal and Scheideler, Christian}, year={2011}, pages={356--370}, collection={LNCS}
}'
chicago: 'Nesterenko, Mikhail, Rizal Mohd, and Christian Scheideler. “Corona: A
Stabilizing Deterministic Message-Passing Skip List.” In Proceedings of the
13th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS), 356--370. LNCS, 2011. https://doi.org/10.1007/978-3-642-24550-3_27.'
ieee: 'M. Nesterenko, R. Mohd, and C. Scheideler, “Corona: A Stabilizing Deterministic
Message-Passing Skip List,” in Proceedings of the 13th International Symposium
on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011,
pp. 356--370.'
mla: 'Nesterenko, Mikhail, et al. “Corona: A Stabilizing Deterministic Message-Passing
Skip List.” Proceedings of the 13th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS), 2011, pp. 356--370, doi:10.1007/978-3-642-24550-3_27.'
short: 'M. Nesterenko, R. Mohd, C. Scheideler, in: Proceedings of the 13th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS),
2011, pp. 356--370.'
date_created: 2017-10-17T12:43:01Z
date_updated: 2022-01-06T07:03:13Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-24550-3_27
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T13:46:48Z
date_updated: 2018-03-14T13:46:48Z
file_id: '1217'
file_name: 662-SSS2011-Corona-Scheideler.pdf
file_size: 305543
relation: main_file
success: 1
file_date_updated: 2018-03-14T13:46:48Z
has_accepted_license: '1'
page: 356--370
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 13th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)
series_title: LNCS
status: public
title: 'Corona: A Stabilizing Deterministic Message-Passing Skip List'
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '663'
author:
- first_name: Kamil
full_name: Swierkot, Kamil
last_name: Swierkot
citation:
ama: Swierkot K. Complexity Classes for Local Computation. Universität Paderborn;
2011.
apa: Swierkot, K. (2011). Complexity Classes for Local Computation. Universität
Paderborn.
bibtex: '@book{Swierkot_2011, title={Complexity Classes for Local Computation},
publisher={Universität Paderborn}, author={Swierkot, Kamil}, year={2011} }'
chicago: Swierkot, Kamil. Complexity Classes for Local Computation. Universität
Paderborn, 2011.
ieee: K. Swierkot, Complexity Classes for Local Computation. Universität
Paderborn, 2011.
mla: Swierkot, Kamil. Complexity Classes for Local Computation. Universität
Paderborn, 2011.
short: K. Swierkot, Complexity Classes for Local Computation, Universität Paderborn,
2011.
date_created: 2017-10-17T12:43:01Z
date_updated: 2022-01-06T07:03:13Z
department:
- _id: '63'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Complexity Classes for Local Computation
type: mastersthesis
user_id: '477'
year: '2011'
...
---
_id: '664'
abstract:
- lang: eng
text: 'Web Computing is a variant of parallel computing where the idle times of
PCs donated by worldwide distributed users are employed to execute parallel programs.
The PUB-Web library developed by us supports this kind of usage of computing resources.
A major problem for the efficient execution of such parallel programs is load
balancing. In the Web Computing context, this problem becomes more difficult because
of the dynamic behavior of the underlying "parallel computer": the set of available
processors (donated PCs) as well as their availability (idle times) change over
time in an unpredictable fashion.In this paper, we experimentally evaluate and
compare load balancing algorithms in this scenario, namely a variant of the well-established
Work Stealing algorithm and strategies based on a heterogeneous version of distributed
hash-tables (DHHTs) introduced recently. In order to run a meaningful experimental
evaluation, we employ, in addition to our Web Computing library PUB-Web, realistic
data sets for the job input streams and for the dynamics of the availability of
the resources.Our experimental evaluations suggest that Work Stealing is the better
strategy if the number of processes ready to run matches the number of available
processors. But a suitable variant of DHHTs outperforms Work Stealing if there
are significantly more processes ready to run than available processors.'
author:
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Gehweiler J, Kling P, Meyer auf der Heide F. An Experimental Comparison of
Load Balancing Strategies in a Web Computing Environment. In: Proceedings of
the 9th International Conference on Parallel Processing and Applied Mathematics
(PPAM). LNCS. ; 2011:31--40. doi:10.1007/978-3-642-31500-8_4'
apa: Gehweiler, J., Kling, P., & Meyer auf der Heide, F. (2011). An Experimental
Comparison of Load Balancing Strategies in a Web Computing Environment. In Proceedings
of the 9th International Conference on Parallel Processing and Applied Mathematics
(PPAM) (pp. 31--40). https://doi.org/10.1007/978-3-642-31500-8_4
bibtex: '@inproceedings{Gehweiler_Kling_Meyer auf der Heide_2011, series={LNCS},
title={An Experimental Comparison of Load Balancing Strategies in a Web Computing
Environment}, DOI={10.1007/978-3-642-31500-8_4},
booktitle={Proceedings of the 9th International Conference on Parallel Processing
and Applied Mathematics (PPAM)}, author={Gehweiler, Joachim and Kling, Peter and
Meyer auf der Heide, Friedhelm}, year={2011}, pages={31--40}, collection={LNCS}
}'
chicago: Gehweiler, Joachim, Peter Kling, and Friedhelm Meyer auf der Heide. “An
Experimental Comparison of Load Balancing Strategies in a Web Computing Environment.”
In Proceedings of the 9th International Conference on Parallel Processing and
Applied Mathematics (PPAM), 31--40. LNCS, 2011. https://doi.org/10.1007/978-3-642-31500-8_4.
ieee: J. Gehweiler, P. Kling, and F. Meyer auf der Heide, “An Experimental Comparison
of Load Balancing Strategies in a Web Computing Environment,” in Proceedings
of the 9th International Conference on Parallel Processing and Applied Mathematics
(PPAM), 2011, pp. 31--40.
mla: Gehweiler, Joachim, et al. “An Experimental Comparison of Load Balancing Strategies
in a Web Computing Environment.” Proceedings of the 9th International Conference
on Parallel Processing and Applied Mathematics (PPAM), 2011, pp. 31--40, doi:10.1007/978-3-642-31500-8_4.
short: 'J. Gehweiler, P. Kling, F. Meyer auf der Heide, in: Proceedings of the 9th
International Conference on Parallel Processing and Applied Mathematics (PPAM),
2011, pp. 31--40.'
date_created: 2017-10-17T12:43:01Z
date_updated: 2022-01-06T07:03:14Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-642-31500-8_4
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T13:45:57Z
date_updated: 2018-03-14T13:45:57Z
file_id: '1216'
file_name: 664-PPAM11GKM_01.pdf
file_size: 333335
relation: main_file
success: 1
file_date_updated: 2018-03-14T13:45:57Z
has_accepted_license: '1'
page: 31--40
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 9th International Conference on Parallel Processing
and Applied Mathematics (PPAM)
series_title: LNCS
status: public
title: An Experimental Comparison of Load Balancing Strategies in a Web Computing
Environment
type: conference
user_id: '15504'
year: '2011'
...