---
_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: '651'
author:
- first_name: Nadja
full_name: Stroh-Maraun, Nadja
id: '13264'
last_name: Stroh-Maraun
citation:
ama: Stroh-Maraun N. Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme.
Universität Paderborn; 2011.
apa: Stroh-Maraun, N. (2011). Prozedurale Ansätze zur Lösung mehrdimensionaler
Verhandlungsprobleme. Universität Paderborn.
bibtex: '@book{Stroh-Maraun_2011, title={Prozedurale Ansätze zur Lösung mehrdimensionaler
Verhandlungsprobleme}, publisher={Universität Paderborn}, author={Stroh-Maraun,
Nadja}, year={2011} }'
chicago: Stroh-Maraun, Nadja. Prozedurale Ansätze zur Lösung mehrdimensionaler
Verhandlungsprobleme. Universität Paderborn, 2011.
ieee: N. Stroh-Maraun, Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme.
Universität Paderborn, 2011.
mla: Stroh-Maraun, Nadja. Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme.
Universität Paderborn, 2011.
short: N. Stroh-Maraun, Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme,
Universität Paderborn, 2011.
date_created: 2017-10-17T12:42:58Z
date_updated: 2022-01-06T07:03:08Z
department:
- _id: '205'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
title: Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme
type: bachelorsthesis
user_id: '13264'
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: '653'
abstract:
- lang: eng
text: Performance prototyping is an often used technique to assess the performance
of software architectures early in the development process without relying on
models of the system under study. ProtoCom is a prototype generator for the PCM
realised as model-2-text transformation for which no experience report in a larger,
virtualised setting exists. In this paper, we report on four case studies performed
with an improved version of ProtoCom and report on the results gained with respect
to analysis accuracy and usability. Our results demonstrate that the new version
is much easier to use than previous versions and that results gained in our virtualised
execution environment help in early assessments of performance under realistic
conditions.
author:
- first_name: Sebastian
full_name: Lehrig, Sebastian
last_name: Lehrig
- first_name: Thomas
full_name: Zolynski, Thomas
last_name: Zolynski
citation:
ama: 'Lehrig S, Zolynski T. Performance Prototyping with ProtoCom in a Virtualised
Environment: A Case Study. In: Proceedings of the Palladio Days 2011. Karlsruhe
Reports in Informatics. ; 2011:15-22. doi:10.5445/IR/1000025188 '
apa: 'Lehrig, S., & Zolynski, T. (2011). Performance Prototyping with ProtoCom
in a Virtualised Environment: A Case Study. In Proceedings of the Palladio
Days 2011 (pp. 15–22). https://doi.org/10.5445/IR/1000025188
'
bibtex: '@inproceedings{Lehrig_Zolynski_2011, series={Karlsruhe Reports in Informatics},
title={Performance Prototyping with ProtoCom in a Virtualised Environment: A Case
Study}, DOI={10.5445/IR/1000025188
}, booktitle={Proceedings of the Palladio Days 2011}, author={Lehrig, Sebastian
and Zolynski, Thomas}, year={2011}, pages={15–22}, collection={Karlsruhe Reports
in Informatics} }'
chicago: 'Lehrig, Sebastian, and Thomas Zolynski. “Performance Prototyping with
ProtoCom in a Virtualised Environment: A Case Study.” In Proceedings of the
Palladio Days 2011, 15–22. Karlsruhe Reports in Informatics, 2011. https://doi.org/10.5445/IR/1000025188 .'
ieee: 'S. Lehrig and T. Zolynski, “Performance Prototyping with ProtoCom in a Virtualised
Environment: A Case Study,” in Proceedings of the Palladio Days 2011, 2011,
pp. 15–22.'
mla: 'Lehrig, Sebastian, and Thomas Zolynski. “Performance Prototyping with ProtoCom
in a Virtualised Environment: A Case Study.” Proceedings of the Palladio Days
2011, 2011, pp. 15–22, doi:10.5445/IR/1000025188 .'
short: 'S. Lehrig, T. Zolynski, in: Proceedings of the Palladio Days 2011, 2011,
pp. 15–22.'
date_created: 2017-10-17T12:42:59Z
date_updated: 2022-01-06T07:03:10Z
ddc:
- '040'
doi: '10.5445/IR/1000025188 '
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T13:53:10Z
date_updated: 2018-03-14T13:53:10Z
file_id: '1222'
file_name: 653-Protocom-Lehrig_Zolynski.pdf
file_size: 773622
relation: main_file
success: 1
file_date_updated: 2018-03-14T13:53:10Z
has_accepted_license: '1'
page: 15-22
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the Palladio Days 2011
series_title: Karlsruhe Reports in Informatics
status: public
title: 'Performance Prototyping with ProtoCom in a Virtualised Environment: A Case
Study'
type: conference
user_id: '15504'
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: '655'
author:
- first_name: Joachim
full_name: Meyer, Joachim
last_name: Meyer
citation:
ama: Meyer J. Modellgetriebene Skalierbarkeitsanalyse von selbst-adaptiven Komponentenbasierten
Softwaresystemen in der Cloud. Universität Paderborn; 2011.
apa: Meyer, J. (2011). Modellgetriebene Skalierbarkeitsanalyse von selbst-adaptiven
Komponentenbasierten Softwaresystemen in der Cloud. Universität Paderborn.
bibtex: '@book{Meyer_2011, title={Modellgetriebene Skalierbarkeitsanalyse von selbst-adaptiven
Komponentenbasierten Softwaresystemen in der Cloud}, publisher={Universität Paderborn},
author={Meyer, Joachim}, year={2011} }'
chicago: Meyer, Joachim. Modellgetriebene Skalierbarkeitsanalyse von selbst-adaptiven
Komponentenbasierten Softwaresystemen in der Cloud. Universität Paderborn,
2011.
ieee: J. Meyer, Modellgetriebene Skalierbarkeitsanalyse von selbst-adaptiven
Komponentenbasierten Softwaresystemen in der Cloud. Universität Paderborn,
2011.
mla: Meyer, Joachim. Modellgetriebene Skalierbarkeitsanalyse von selbst-adaptiven
Komponentenbasierten Softwaresystemen in der Cloud. Universität Paderborn,
2011.
short: J. Meyer, Modellgetriebene Skalierbarkeitsanalyse von selbst-adaptiven Komponentenbasierten
Softwaresystemen in der Cloud, Universität Paderborn, 2011.
date_created: 2017-10-17T12:42:59Z
date_updated: 2022-01-06T07:03:11Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Modellgetriebene Skalierbarkeitsanalyse von selbst-adaptiven Komponentenbasierten
Softwaresystemen in der Cloud
type: mastersthesis
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'
...
---
_id: '665'
author:
- first_name: Philip
full_name: Wette, Philip
last_name: Wette
citation:
ama: Wette P. Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke
am Beispiel von Chord. Universität Paderborn; 2011.
apa: Wette, P. (2011). Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke
am Beispiel von Chord. Universität Paderborn.
bibtex: '@book{Wette_2011, title={Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke
am Beispiel von Chord}, publisher={Universität Paderborn}, author={Wette, Philip},
year={2011} }'
chicago: Wette, Philip. Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke
am Beispiel von Chord. Universität Paderborn, 2011.
ieee: P. Wette, Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke
am Beispiel von Chord. Universität Paderborn, 2011.
mla: Wette, Philip. Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke
am Beispiel von Chord. Universität Paderborn, 2011.
short: P. Wette, Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke
am Beispiel von Chord, Universität Paderborn, 2011.
date_created: 2017-10-17T12:43:01Z
date_updated: 2022-01-06T07:03:14Z
department:
- _id: '79'
language:
- iso: ger
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: Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel
von Chord
type: mastersthesis
user_id: '477'
year: '2011'
...
---
_id: '666'
abstract:
- lang: eng
text: Reconfigurable systems on chip are increasingly deployed in security and safety
critical contexts. When downloading and configuring new hardware functions, we
want to make sure that modules adhere to certain security specifications and do
not, for example, contain hardware Trojans. As a possible approach to achieving
hardware security we propose and demonstrate the concept of proof-carrying hardware,
a concept inspired by previous work on proof-carrying code techniques in the software
domain. In this paper, we discuss the hardware trust and threat models behind
proof-carrying hardware and then present our experimental setup. We detail the
employed open-source tool chain for the runtime verification of combinational equivalence
and our bitstream format for an abstract FPGA architecture that allows us to experimentally
validate the feasibility of our approach.
author:
- first_name: Stephanie
full_name: Drzevitzky, Stephanie
last_name: Drzevitzky
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Drzevitzky S, Platzner M. Achieving Hardware Security for Reconfigurable Systems
on Chip by a Proof-Carrying Code Approach. In: Proceedings of the 6th International
Workshop on Reconfigurable Communication-Centric Systems-on-Chip (ReCoSoC).
; 2011:58-65. doi:10.1109/ReCoSoC.2011.5981499'
apa: Drzevitzky, S., & Platzner, M. (2011). Achieving Hardware Security for
Reconfigurable Systems on Chip by a Proof-Carrying Code Approach. In Proceedings
of the 6th International Workshop on Reconfigurable Communication-centric Systems-on-Chip
(ReCoSoC) (pp. 58–65). https://doi.org/10.1109/ReCoSoC.2011.5981499
bibtex: '@inproceedings{Drzevitzky_Platzner_2011, title={Achieving Hardware Security
for Reconfigurable Systems on Chip by a Proof-Carrying Code Approach}, DOI={10.1109/ReCoSoC.2011.5981499},
booktitle={Proceedings of the 6th International Workshop on Reconfigurable Communication-centric
Systems-on-Chip (ReCoSoC)}, author={Drzevitzky, Stephanie and Platzner, Marco},
year={2011}, pages={58–65} }'
chicago: Drzevitzky, Stephanie, and Marco Platzner. “Achieving Hardware Security
for Reconfigurable Systems on Chip by a Proof-Carrying Code Approach.” In Proceedings
of the 6th International Workshop on Reconfigurable Communication-Centric Systems-on-Chip
(ReCoSoC), 58–65, 2011. https://doi.org/10.1109/ReCoSoC.2011.5981499.
ieee: S. Drzevitzky and M. Platzner, “Achieving Hardware Security for Reconfigurable
Systems on Chip by a Proof-Carrying Code Approach,” in Proceedings of the 6th
International Workshop on Reconfigurable Communication-centric Systems-on-Chip
(ReCoSoC), 2011, pp. 58–65.
mla: Drzevitzky, Stephanie, and Marco Platzner. “Achieving Hardware Security for
Reconfigurable Systems on Chip by a Proof-Carrying Code Approach.” Proceedings
of the 6th International Workshop on Reconfigurable Communication-Centric Systems-on-Chip
(ReCoSoC), 2011, pp. 58–65, doi:10.1109/ReCoSoC.2011.5981499.
short: 'S. Drzevitzky, M. Platzner, in: Proceedings of the 6th International Workshop
on Reconfigurable Communication-Centric Systems-on-Chip (ReCoSoC), 2011, pp. 58–65.'
date_created: 2017-10-17T12:43:01Z
date_updated: 2022-01-06T07:03:14Z
ddc:
- '040'
department:
- _id: '78'
doi: 10.1109/ReCoSoC.2011.5981499
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T13:40:48Z
date_updated: 2018-03-14T13:40:48Z
file_id: '1214'
file_name: 666-drzevitzky11_recosoc.pdf
file_size: 666039
relation: main_file
success: 1
file_date_updated: 2018-03-14T13:40:48Z
has_accepted_license: '1'
language:
- iso: eng
page: 58-65
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 6th International Workshop on Reconfigurable Communication-centric
Systems-on-Chip (ReCoSoC)
status: public
title: Achieving Hardware Security for Reconfigurable Systems on Chip by a Proof-Carrying
Code Approach
type: conference
user_id: '477'
year: '2011'
...
---
_id: '667'
citation:
ama: Meyer auf der Heide F, Rajaraman R, eds. 23rd Annual ACM Symposium on Parallelism
in Algorithms and Architectures.; 2011. doi:10.1145/1989493
apa: Meyer auf der Heide, F., & Rajaraman, R. (Eds.). (2011). 23rd Annual
ACM Symposium on Parallelism in Algorithms and Architectures. https://doi.org/10.1145/1989493
bibtex: '@book{Meyer auf der Heide_Rajaraman_2011, title={23rd Annual ACM Symposium
on Parallelism in Algorithms and Architectures}, DOI={10.1145/1989493},
year={2011} }'
chicago: Meyer auf der Heide, Friedhelm, and Rajmohan Rajaraman, eds. 23rd Annual
ACM Symposium on Parallelism in Algorithms and Architectures, 2011. https://doi.org/10.1145/1989493.
ieee: F. Meyer auf der Heide and R. Rajaraman, Eds., 23rd Annual ACM Symposium
on Parallelism in Algorithms and Architectures. 2011.
mla: Meyer auf der Heide, Friedhelm, and Rajmohan Rajaraman, editors. 23rd Annual
ACM Symposium on Parallelism in Algorithms and Architectures. 2011, doi:10.1145/1989493.
short: F. Meyer auf der Heide, R. Rajaraman, eds., 23rd Annual ACM Symposium on
Parallelism in Algorithms and Architectures, 2011.
date_created: 2017-10-17T12:43:02Z
date_updated: 2022-01-06T07:03:14Z
department:
- _id: '63'
doi: 10.1145/1989493
editor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: 'Rajmohan '
full_name: 'Rajaraman, Rajmohan '
last_name: Rajaraman
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
status: public
title: 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures
type: conference_editor
user_id: '477'
year: '2011'
...