---
_id: '639'
abstract:
- lang: eng
text: Service-oriented computing (SOC) emerges as a promising trend solving many
issues in distributed software development. Following the essence of SOC, service
descriptions are dened by the service partners based on current standards, e.g.,
WSDL [15]. However, these standards are mostly structural and do not provide any
behavioral description, which may lead to inaccurate service discovery results.
There is a requirement for a rich service description language for service partners
that encompasses the structural as well as behavioral information in the service
description. Furthermore, service discovery based on an automatic matching of
these comprehensive service descriptions is a complex task, which is further complicated
through the heterogeneity of the service partners' domains in terms of dierent
underlying ontologies. In this paper, we propose a rich service description language
based on UML, which allows the specication of structural and behavioral features
of a service. In addition, we also briefly discuss how some existing matching
approaches can be extended to dene an automatic matching mechanism for rich service
descriptions resolving the underlying heterogeneity.
author:
- first_name: Zille
full_name: Huma, Zille
last_name: Huma
- first_name: Christian
full_name: Gerth, Christian
last_name: Gerth
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
- first_name: Oliver
full_name: Juwig, Oliver
last_name: Juwig
citation:
ama: 'Huma Z, Gerth C, Engels G, Juwig O. A UML-based Rich Service Description for
Automatic Service Discovery. In: Proceedings of the Forum at the CAiSE’12 Conference
on Advanced Information Systems Engineering. CEUR Workshop Proceedings. ;
2012:90--97.'
apa: Huma, Z., Gerth, C., Engels, G., & Juwig, O. (2012). A UML-based Rich Service
Description for Automatic Service Discovery. In Proceedings of the Forum at
the CAiSE’12 Conference on Advanced Information Systems Engineering (pp. 90--97).
bibtex: '@inproceedings{Huma_Gerth_Engels_Juwig_2012, series={CEUR Workshop Proceedings},
title={A UML-based Rich Service Description for Automatic Service Discovery},
booktitle={Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information
Systems Engineering}, author={Huma, Zille and Gerth, Christian and Engels, Gregor
and Juwig, Oliver}, year={2012}, pages={90--97}, collection={CEUR Workshop Proceedings}
}'
chicago: Huma, Zille, Christian Gerth, Gregor Engels, and Oliver Juwig. “A UML-Based
Rich Service Description for Automatic Service Discovery.” In Proceedings of
the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering,
90--97. CEUR Workshop Proceedings, 2012.
ieee: Z. Huma, C. Gerth, G. Engels, and O. Juwig, “A UML-based Rich Service Description
for Automatic Service Discovery,” in Proceedings of the Forum at the CAiSE’12
Conference on Advanced Information Systems Engineering, 2012, pp. 90--97.
mla: Huma, Zille, et al. “A UML-Based Rich Service Description for Automatic Service
Discovery.” Proceedings of the Forum at the CAiSE’12 Conference on Advanced
Information Systems Engineering, 2012, pp. 90--97.
short: 'Z. Huma, C. Gerth, G. Engels, O. Juwig, in: Proceedings of the Forum at
the CAiSE’12 Conference on Advanced Information Systems Engineering, 2012, pp.
90--97.'
date_created: 2017-10-17T12:42:56Z
date_updated: 2022-01-06T07:03:03Z
ddc:
- '040'
department:
- _id: '66'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T14:13:48Z
date_updated: 2018-03-14T14:13:48Z
file_id: '1231'
file_name: 639-HumaGerthCAiSE12.pdf
file_size: 693236
relation: main_file
success: 1
file_date_updated: 2018-03-14T14:13:48Z
has_accepted_license: '1'
language:
- iso: eng
page: 90--97
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 Forum at the CAiSE'12 Conference on Advanced Information
Systems Engineering
series_title: CEUR Workshop Proceedings
status: public
title: A UML-based Rich Service Description for Automatic Service Discovery
type: conference
user_id: '477'
year: '2012'
...
---
_id: '640'
abstract:
- lang: eng
text: Small-world networks have received significant attention because of their
potential as models for the interaction networks of complex systems. Specifically,
neither random networks nor regular lattices seem to be an adequate framework
within which to study real-world complex systems such as chemical-reaction networks,
neural networks, food webs, social networks, scientific-collaboration networks,
and computer networks. Small-world networks provide some desired properties like
an expected polylogarithmic distance between two processes in the network, which
allows routing in polylogarithmic hops by simple greedy routing, and robustness
against attacks or failures. By these properties, small-world networks are possible
solutions for large overlay networks comparable to structured overlay networks
like CAN, Pastry, Chord, which also provide polylogarithmic routing, but due to
their uniform structure, structured overlay networks are more vulnerable to attacks
or failures. In this paper we bring together a randomized process converging to
a small-world network and a self-stabilization process so that a small-world network
is formed out of any weakly connected initial state. To the best of our knowledge
this is the first distributed self-stabilization process for building a small-world
network.
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kniesburges S, Koutsopoulos A, Scheideler C. A Self-Stabilization Process
for Small-World Networks. In: Proceedings of the 26th IEEE International Parallel
and Distributed Processing Symposium (IPDPS). ; 2012:1261--1271. doi:10.1109/IPDPS.2012.115'
apa: Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2012). A Self-Stabilization
Process for Small-World Networks. In Proceedings of the 26th IEEE International
Parallel and Distributed Processing Symposium (IPDPS) (pp. 1261--1271). https://doi.org/10.1109/IPDPS.2012.115
bibtex: '@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2012, title={A Self-Stabilization
Process for Small-World Networks}, DOI={10.1109/IPDPS.2012.115},
booktitle={Proceedings of the 26th IEEE International Parallel and Distributed
Processing Symposium (IPDPS)}, author={Kniesburges, Sebastian and Koutsopoulos,
Andreas and Scheideler, Christian}, year={2012}, pages={1261--1271} }'
chicago: Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler.
“A Self-Stabilization Process for Small-World Networks.” In Proceedings of
the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS),
1261--1271, 2012. https://doi.org/10.1109/IPDPS.2012.115.
ieee: S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A Self-Stabilization
Process for Small-World Networks,” in Proceedings of the 26th IEEE International
Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1261--1271.
mla: Kniesburges, Sebastian, et al. “A Self-Stabilization Process for Small-World
Networks.” Proceedings of the 26th IEEE International Parallel and Distributed
Processing Symposium (IPDPS), 2012, pp. 1261--1271, doi:10.1109/IPDPS.2012.115.
short: 'S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of the 26th
IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012,
pp. 1261--1271.'
date_created: 2017-10-17T12:42:56Z
date_updated: 2022-01-06T07:03:04Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/IPDPS.2012.115
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T14:13:13Z
date_updated: 2018-03-14T14:13:13Z
file_id: '1230'
file_name: 640-IPDPS2012-Kniesb-Kouts-Scheideler.pdf
file_size: 210176
relation: main_file
success: 1
file_date_updated: 2018-03-14T14:13:13Z
has_accepted_license: '1'
page: 1261--1271
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 26th IEEE International Parallel and Distributed Processing
Symposium (IPDPS)
status: public
title: A Self-Stabilization Process for Small-World Networks
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '641'
author:
- first_name: Jonathan
full_name: Schluessler, Jonathan
last_name: Schluessler
citation:
ama: Schluessler J. A Forensic Framework for Automatic Information Retrieval
in Distributed Systems. Universität Paderborn; 2012.
apa: Schluessler, J. (2012). A Forensic Framework for Automatic Information Retrieval
in Distributed Systems. Universität Paderborn.
bibtex: '@book{Schluessler_2012, title={A Forensic Framework for Automatic Information
Retrieval in Distributed Systems}, publisher={Universität Paderborn}, author={Schluessler,
Jonathan}, year={2012} }'
chicago: Schluessler, Jonathan. A Forensic Framework for Automatic Information
Retrieval in Distributed Systems. Universität Paderborn, 2012.
ieee: J. Schluessler, A Forensic Framework for Automatic Information Retrieval
in Distributed Systems. Universität Paderborn, 2012.
mla: Schluessler, Jonathan. A Forensic Framework for Automatic Information Retrieval
in Distributed Systems. Universität Paderborn, 2012.
short: J. Schluessler, A Forensic Framework for Automatic Information Retrieval
in Distributed Systems, Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:57Z
date_updated: 2022-01-06T07:03:04Z
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
title: A Forensic Framework for Automatic Information Retrieval in Distributed Systems
type: mastersthesis
user_id: '15504'
year: '2012'
...
---
_id: '5183'
author:
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Patrick
full_name: Lam, Patrick
last_name: Lam
- first_name: Laurie
full_name: Hendren, Laurie
last_name: Hendren
citation:
ama: Bodden E, Lam P, Hendren L. Partially Evaluating Finite-State Runtime Monitors
Ahead of Time. ACM Transactions on Programming Languages and Systems. 2012;34(2):1-52.
doi:10.1145/2220365.2220366
apa: Bodden, E., Lam, P., & Hendren, L. (2012). Partially Evaluating Finite-State
Runtime Monitors Ahead of Time. ACM Transactions on Programming Languages and
Systems, 34(2), 1–52. https://doi.org/10.1145/2220365.2220366
bibtex: '@article{Bodden_Lam_Hendren_2012, title={Partially Evaluating Finite-State
Runtime Monitors Ahead of Time}, volume={34}, DOI={10.1145/2220365.2220366},
number={2}, journal={ACM Transactions on Programming Languages and Systems}, publisher={Association
for Computing Machinery (ACM)}, author={Bodden, Eric and Lam, Patrick and Hendren,
Laurie}, year={2012}, pages={1–52} }'
chicago: 'Bodden, Eric, Patrick Lam, and Laurie Hendren. “Partially Evaluating Finite-State
Runtime Monitors Ahead of Time.” ACM Transactions on Programming Languages
and Systems 34, no. 2 (2012): 1–52. https://doi.org/10.1145/2220365.2220366.'
ieee: E. Bodden, P. Lam, and L. Hendren, “Partially Evaluating Finite-State Runtime
Monitors Ahead of Time,” ACM Transactions on Programming Languages and Systems,
vol. 34, no. 2, pp. 1–52, 2012.
mla: Bodden, Eric, et al. “Partially Evaluating Finite-State Runtime Monitors Ahead
of Time.” ACM Transactions on Programming Languages and Systems, vol. 34,
no. 2, Association for Computing Machinery (ACM), 2012, pp. 1–52, doi:10.1145/2220365.2220366.
short: E. Bodden, P. Lam, L. Hendren, ACM Transactions on Programming Languages
and Systems 34 (2012) 1–52.
date_created: 2018-10-31T10:43:13Z
date_updated: 2022-01-06T07:01:41Z
ddc:
- '000'
department:
- _id: '76'
doi: 10.1145/2220365.2220366
extern: '1'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:42:24Z
date_updated: 2018-11-02T15:42:24Z
file_id: '5310'
file_name: a7-bodden.pdf
file_size: 2280938
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:42:24Z
has_accepted_license: '1'
intvolume: ' 34'
issue: '2'
language:
- iso: eng
main_file_link:
- url: http://www.bodden.de/pubs/blh12partially.pdf
page: 1-52
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: ACM Transactions on Programming Languages and Systems
publication_identifier:
issn:
- 0164-0925
publication_status: published
publisher: Association for Computing Machinery (ACM)
status: public
title: Partially Evaluating Finite-State Runtime Monitors Ahead of Time
type: journal_article
user_id: '477'
volume: 34
year: '2012'
...
---
_id: '565'
abstract:
- lang: eng
text: 'In model-driven development of multi-layer systems (e.g. application, platform
and infrastructure), each layer is usually described by separate models. When
generating analysis models or code, these separate models rst of all need to be
linked. Hence, existing model transformations for single layers cannot be simply
re-used. In this paper, we present a modular approach to the transformation of
multi-layer systems. It employs model weaving to dene the interconnections between
models of dierent layers. The weaving models themselves are subject to model transformations:
The result of transforming a weaving model constitutes a conguration for the models
obtained by transforming single layers, thereby allowing for a re-use of existing
model transformations. We exemplify our approach by the generation of analysis
models for component-based software.'
author:
- first_name: Galina
full_name: Besova, Galina
last_name: Besova
- first_name: Sven
full_name: Walther, Sven
last_name: Walther
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: Steffen
full_name: Becker, Steffen
last_name: Becker
citation:
ama: 'Besova G, Walther S, Wehrheim H, Becker S. Weaving-based configuration and
modular transformation of multi-layer systems. In: Proceedings of the 15th
International Conference on Model Driven Engineering Languages & Systems (MoDELS).
LNCS. ; 2012:776-792. doi:10.1007/978-3-642-33666-9_49'
apa: Besova, G., Walther, S., Wehrheim, H., & Becker, S. (2012). Weaving-based
configuration and modular transformation of multi-layer systems. In Proceedings
of the 15th International Conference on Model Driven Engineering Languages &
Systems (MoDELS) (pp. 776–792). https://doi.org/10.1007/978-3-642-33666-9_49
bibtex: '@inproceedings{Besova_Walther_Wehrheim_Becker_2012, series={LNCS}, title={Weaving-based
configuration and modular transformation of multi-layer systems}, DOI={10.1007/978-3-642-33666-9_49},
booktitle={Proceedings of the 15th International Conference on Model Driven Engineering
Languages & Systems (MoDELS)}, author={Besova, Galina and Walther, Sven and
Wehrheim, Heike and Becker, Steffen}, year={2012}, pages={776–792}, collection={LNCS}
}'
chicago: Besova, Galina, Sven Walther, Heike Wehrheim, and Steffen Becker. “Weaving-Based
Configuration and Modular Transformation of Multi-Layer Systems.” In Proceedings
of the 15th International Conference on Model Driven Engineering Languages &
Systems (MoDELS), 776–92. LNCS, 2012. https://doi.org/10.1007/978-3-642-33666-9_49.
ieee: G. Besova, S. Walther, H. Wehrheim, and S. Becker, “Weaving-based configuration
and modular transformation of multi-layer systems,” in Proceedings of the 15th
International Conference on Model Driven Engineering Languages & Systems (MoDELS),
2012, pp. 776–792.
mla: Besova, Galina, et al. “Weaving-Based Configuration and Modular Transformation
of Multi-Layer Systems.” Proceedings of the 15th International Conference on
Model Driven Engineering Languages & Systems (MoDELS), 2012, pp. 776–92,
doi:10.1007/978-3-642-33666-9_49.
short: 'G. Besova, S. Walther, H. Wehrheim, S. Becker, in: Proceedings of the 15th
International Conference on Model Driven Engineering Languages & Systems (MoDELS),
2012, pp. 776–792.'
date_created: 2017-10-17T12:42:42Z
date_updated: 2022-01-06T07:02:20Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-642-33666-9_49
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:24:06Z
date_updated: 2018-03-15T10:24:06Z
file_id: '1276'
file_name: 565-Besova_et_al._-_2012_-_Weaving-Based_Configuration_and_Modular_Transformation_of_Multi-layer_Systems_01.pdf
file_size: 589972
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:24:06Z
has_accepted_license: '1'
language:
- iso: eng
page: 776-792
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 15th International Conference on Model Driven Engineering
Languages & Systems (MoDELS)
series_title: LNCS
status: public
title: Weaving-based configuration and modular transformation of multi-layer systems
type: conference
user_id: '477'
year: '2012'
...
---
_id: '566'
author:
- first_name: Ina
full_name: Hilger, Ina
last_name: Hilger
citation:
ama: Hilger I. Untersuchung von Modellen zur operativen Planung in Trinkwasserversorgungsnetzwerken.
Universität Paderborn; 2012.
apa: Hilger, I. (2012). Untersuchung von Modellen zur operativen Planung in Trinkwasserversorgungsnetzwerken.
Universität Paderborn.
bibtex: '@book{Hilger_2012, title={Untersuchung von Modellen zur operativen Planung
in Trinkwasserversorgungsnetzwerken}, publisher={Universität Paderborn}, author={Hilger,
Ina}, year={2012} }'
chicago: Hilger, Ina. Untersuchung von Modellen zur operativen Planung in Trinkwasserversorgungsnetzwerken.
Universität Paderborn, 2012.
ieee: I. Hilger, Untersuchung von Modellen zur operativen Planung in Trinkwasserversorgungsnetzwerken.
Universität Paderborn, 2012.
mla: Hilger, Ina. Untersuchung von Modellen zur operativen Planung in Trinkwasserversorgungsnetzwerken.
Universität Paderborn, 2012.
short: I. Hilger, Untersuchung von Modellen zur operativen Planung in Trinkwasserversorgungsnetzwerken,
Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:42Z
date_updated: 2022-01-06T07:02:22Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '15'
name: SFB 901 - Subprojekt C3
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Untersuchung von Modellen zur operativen Planung in Trinkwasserversorgungsnetzwerken
type: bachelorsthesis
user_id: '477'
year: '2012'
...
---
_id: '13462'
author:
- first_name: Peter
full_name: Lewis, Peter
last_name: Lewis
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Xin
full_name: Yao, Xin
last_name: Yao
citation:
ama: Lewis P, Platzner M, Yao X. An Outlook for Self-Awareness in Computing Systems.
Awareness Magazine; 2012.
apa: Lewis, P., Platzner, M., & Yao, X. (2012). An outlook for self-awareness
in computing systems. Awareness Magazine.
bibtex: '@book{Lewis_Platzner_Yao_2012, title={An outlook for self-awareness in
computing systems}, publisher={Awareness Magazine}, author={Lewis, Peter and Platzner,
Marco and Yao, Xin}, year={2012} }'
chicago: Lewis, Peter, Marco Platzner, and Xin Yao. An Outlook for Self-Awareness
in Computing Systems. Awareness Magazine, 2012.
ieee: P. Lewis, M. Platzner, and X. Yao, An outlook for self-awareness in computing
systems. Awareness Magazine, 2012.
mla: Lewis, Peter, et al. An Outlook for Self-Awareness in Computing Systems.
Awareness Magazine, 2012.
short: P. Lewis, M. Platzner, X. Yao, An Outlook for Self-Awareness in Computing
Systems, Awareness Magazine, 2012.
date_created: 2019-09-30T09:24:09Z
date_updated: 2022-01-06T06:51:36Z
department:
- _id: '78'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '14'
name: SFB 901 - Subproject C2
publisher: Awareness Magazine
status: public
title: An outlook for self-awareness in computing systems
type: misc
user_id: '398'
year: '2012'
...
---
_id: '34169'
author:
- first_name: Sonja
full_name: Brangewitz, Sonja
last_name: Brangewitz
citation:
ama: Brangewitz S. Coalitional and Strategic Market Games.; 2012.
apa: Brangewitz, S. (2012). Coalitional and Strategic Market Games.
bibtex: '@book{Brangewitz_2012, place={Universität Bielefeld}, title={Coalitional
and Strategic Market Games}, author={Brangewitz, Sonja}, year={2012} }'
chicago: Brangewitz, Sonja. Coalitional and Strategic Market Games. Universität
Bielefeld, 2012.
ieee: S. Brangewitz, Coalitional and Strategic Market Games. Universität
Bielefeld, 2012.
mla: Brangewitz, Sonja. Coalitional and Strategic Market Games. 2012.
short: S. Brangewitz, Coalitional and Strategic Market Games, Universität Bielefeld,
2012.
date_created: 2022-11-30T14:43:16Z
date_updated: 2022-11-30T14:47:46Z
ddc:
- '330'
department:
- _id: '205'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2022-11-30T14:44:47Z
date_updated: 2022-11-30T14:44:47Z
file_id: '34170'
file_name: Dissertation-Brangewitz.pdf
file_size: 1277591
relation: main_file
success: 1
file_date_updated: 2022-11-30T14:44:47Z
has_accepted_license: '1'
language:
- iso: eng
place: Universität Bielefeld
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '7'
name: 'SFB 901 - A3: SFB 901 - Subproject A3'
status: public
supervisor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
title: Coalitional and Strategic Market Games
type: dissertation
user_id: '477'
year: '2012'
...
---
_id: '615'
abstract:
- lang: eng
text: Due to the continuously shrinking device structures and increasing densities
of FPGAs, thermal aspects have become the new focus for many research projects
over the last years. Most researchers rely on temperature simulations to evaluate
their novel thermal management techniques. However, the accuracy of the simulations
is to some extent questionable and they require a high computational effort if
a detailed thermal model is used.For experimental evaluation of real-world temperature
management methods, often synthetic heat sources are employed. Therefore, in this
paper we investigated the question if we can create significant rises in temperature
on modern FPGAs to enable future evaluation of thermal management techniques based
on experiments in contrast to simulations. Therefore, we have developed eight
different heat-generating cores that use different subsets of the FPGA resources.
Our experimental results show that, according to the built-in thermal diode of
our Xilinx Virtex-5 FPGA, we can increase the chip temperature by 134 degree C
in less than 12 minutes by only utilizing about 21% of the slices.
author:
- first_name: Markus
full_name: Happe, Markus
last_name: Happe
- first_name: Hendrik
full_name: Hangmann, Hendrik
last_name: Hangmann
- first_name: Andreas
full_name: Agne, Andreas
last_name: Agne
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: 'Happe M, Hangmann H, Agne A, Plessl C. Eight Ways to put your FPGA on Fire
– A Systematic Study of Heat Generators. In: Proceedings of the International
Conference on Reconfigurable Computing and FPGAs (ReConFig). IEEE; 2012:1-8.
doi:10.1109/ReConFig.2012.6416745'
apa: Happe, M., Hangmann, H., Agne, A., & Plessl, C. (2012). Eight Ways to put
your FPGA on Fire – A Systematic Study of Heat Generators. Proceedings of the
International Conference on Reconfigurable Computing and FPGAs (ReConFig),
1–8. https://doi.org/10.1109/ReConFig.2012.6416745
bibtex: '@inproceedings{Happe_Hangmann_Agne_Plessl_2012, title={Eight Ways to put
your FPGA on Fire – A Systematic Study of Heat Generators}, DOI={10.1109/ReConFig.2012.6416745},
booktitle={Proceedings of the International Conference on Reconfigurable Computing
and FPGAs (ReConFig)}, publisher={IEEE}, author={Happe, Markus and Hangmann, Hendrik
and Agne, Andreas and Plessl, Christian}, year={2012}, pages={1–8} }'
chicago: Happe, Markus, Hendrik Hangmann, Andreas Agne, and Christian Plessl. “Eight
Ways to Put Your FPGA on Fire – A Systematic Study of Heat Generators.” In Proceedings
of the International Conference on Reconfigurable Computing and FPGAs (ReConFig),
1–8. IEEE, 2012. https://doi.org/10.1109/ReConFig.2012.6416745.
ieee: 'M. Happe, H. Hangmann, A. Agne, and C. Plessl, “Eight Ways to put your FPGA
on Fire – A Systematic Study of Heat Generators,” in Proceedings of the International
Conference on Reconfigurable Computing and FPGAs (ReConFig), 2012, pp. 1–8,
doi: 10.1109/ReConFig.2012.6416745.'
mla: Happe, Markus, et al. “Eight Ways to Put Your FPGA on Fire – A Systematic Study
of Heat Generators.” Proceedings of the International Conference on Reconfigurable
Computing and FPGAs (ReConFig), IEEE, 2012, pp. 1–8, doi:10.1109/ReConFig.2012.6416745.
short: 'M. Happe, H. Hangmann, A. Agne, C. Plessl, in: Proceedings of the International
Conference on Reconfigurable Computing and FPGAs (ReConFig), IEEE, 2012, pp. 1–8.'
date_created: 2017-10-17T12:42:51Z
date_updated: 2023-09-26T13:42:26Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1109/ReConFig.2012.6416745
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:48:32Z
date_updated: 2018-03-15T06:48:32Z
file_id: '1246'
file_name: 615-ReConFig12_01.pdf
file_size: 730144
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:48:32Z
has_accepted_license: '1'
language:
- iso: eng
page: 1-8
project:
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '14'
grant_number: '160364472'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
- _id: '31'
grant_number: '257906'
name: Engineering Proprioception in Computing Systems
publication: Proceedings of the International Conference on Reconfigurable Computing
and FPGAs (ReConFig)
publisher: IEEE
quality_controlled: '1'
status: public
title: Eight Ways to put your FPGA on Fire – A Systematic Study of Heat Generators
type: conference
user_id: '15278'
year: '2012'
...
---
_id: '591'
abstract:
- lang: eng
text: One major obstacle for a wide spread FPGA usage in general-purpose computing
is the development tool flow that requires much higher effort than for pure software
solutions. Convey Computer promises a solution to this problem for their HC-1
platform, where the FPGAs are configured to run as a vector processor and the software
source code can be annotated with pragmas that guide an automated vectorization
process. We investigate this approach for a stereo matching algorithm that has
abundant parallelism and a number of different computational patterns. We note
that for this case study the automated vectorization in its current state doesn’t
hold its productivity promise. However, we also show that using the Vector Personality
can yield a significant speedups compared to CPU implementations in two of three
investigated phases of the algorithm. Those speedups don’t match custom FPGA implementations,
but can come with much reduced development effort.
author:
- first_name: Tobias
full_name: Kenter, Tobias
id: '3145'
last_name: Kenter
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Henning
full_name: Schmitz, Henning
last_name: Schmitz
citation:
ama: 'Kenter T, Plessl C, Schmitz H. Pragma based parallelization - Trading hardware
efficiency for ease of use? In: Proceedings of the International Conference
on ReConFigurable Computing and FPGAs (ReConFig). IEEE; 2012:1-8. doi:10.1109/ReConFig.2012.6416773'
apa: Kenter, T., Plessl, C., & Schmitz, H. (2012). Pragma based parallelization
- Trading hardware efficiency for ease of use? Proceedings of the International
Conference on ReConFigurable Computing and FPGAs (ReConFig), 1–8. https://doi.org/10.1109/ReConFig.2012.6416773
bibtex: '@inproceedings{Kenter_Plessl_Schmitz_2012, title={Pragma based parallelization
- Trading hardware efficiency for ease of use?}, DOI={10.1109/ReConFig.2012.6416773},
booktitle={Proceedings of the International Conference on ReConFigurable Computing
and FPGAs (ReConFig)}, publisher={IEEE}, author={Kenter, Tobias and Plessl, Christian
and Schmitz, Henning}, year={2012}, pages={1–8} }'
chicago: Kenter, Tobias, Christian Plessl, and Henning Schmitz. “Pragma Based Parallelization
- Trading Hardware Efficiency for Ease of Use?” In Proceedings of the International
Conference on ReConFigurable Computing and FPGAs (ReConFig), 1–8. IEEE, 2012.
https://doi.org/10.1109/ReConFig.2012.6416773.
ieee: 'T. Kenter, C. Plessl, and H. Schmitz, “Pragma based parallelization - Trading
hardware efficiency for ease of use?,” in Proceedings of the International
Conference on ReConFigurable Computing and FPGAs (ReConFig), 2012, pp. 1–8,
doi: 10.1109/ReConFig.2012.6416773.'
mla: Kenter, Tobias, et al. “Pragma Based Parallelization - Trading Hardware Efficiency
for Ease of Use?” Proceedings of the International Conference on ReConFigurable
Computing and FPGAs (ReConFig), IEEE, 2012, pp. 1–8, doi:10.1109/ReConFig.2012.6416773.
short: 'T. Kenter, C. Plessl, H. Schmitz, in: Proceedings of the International Conference
on ReConFigurable Computing and FPGAs (ReConFig), IEEE, 2012, pp. 1–8.'
date_created: 2017-10-17T12:42:47Z
date_updated: 2023-09-26T13:41:08Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1109/ReConFig.2012.6416773
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T08:33:18Z
date_updated: 2018-03-15T08:33:18Z
file_id: '1257'
file_name: 591-ReConFig2012Kenter_Schmitz_Plessl.pdf
file_size: 371235
relation: main_file
success: 1
file_date_updated: 2018-03-15T08:33:18Z
has_accepted_license: '1'
language:
- iso: eng
page: 1-8
project:
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '14'
grant_number: '160364472'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
- _id: '31'
grant_number: '257906'
name: Engineering Proprioception in Computing Systems
publication: Proceedings of the International Conference on ReConFigurable Computing
and FPGAs (ReConFig)
publisher: IEEE
quality_controlled: '1'
status: public
title: Pragma based parallelization - Trading hardware efficiency for ease of use?
type: conference
user_id: '15278'
year: '2012'
...
---
_id: '609'
abstract:
- lang: eng
text: Today's design and operation principles and methods do not scale well with
future reconfigurable computing systems due to an increased complexity in system
architectures and applications, run-time dynamics and corresponding requirements.
Hence, novel design and operation principles and methods are needed that possibly
break drastically with the static ones we have built into our systems and the
fixed abstraction layers we have cherished over the last decades. Thus, we propose
a HW/SW platform that collects and maintains information about its state and progress
which enables the system to reason about its behavior (self-awareness) and utilizes
its knowledge to effectively and autonomously adapt its behavior to changing requirements
(self-expression).To enable self-awareness, our compute nodes collect information
using a variety of sensors, i.e. performance counters and thermal diodes, and
use internal self-awareness models that process these information. For self-awareness,
on-line learning is crucial such that the node learns and continuously updates
its models at run-time to react to changing conditions. To enable self-expression,
we break with the classic design-time abstraction layers of hardware, operating
system and software. In contrast, our system is able to vertically migrate functionalities
between the layers at run-time to exploit trade-offs between abstraction and optimization.This
paper presents a heterogeneous multi-core architecture, that enables self-awareness
and self-expression, an operating system for our proposed hardware/software platform
and a novel self-expression method.
author:
- first_name: Markus
full_name: Happe, Markus
last_name: Happe
- first_name: Andreas
full_name: Agne, Andreas
last_name: Agne
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Happe M, Agne A, Plessl C, Platzner M. Hardware/Software Platform for Self-aware
Compute Nodes. In: Proceedings of the Workshop on Self-Awareness in Reconfigurable
Computing Systems (SRCS). ; 2012:8-9.'
apa: Happe, M., Agne, A., Plessl, C., & Platzner, M. (2012). Hardware/Software
Platform for Self-aware Compute Nodes. Proceedings of the Workshop on Self-Awareness
in Reconfigurable Computing Systems (SRCS), 8–9.
bibtex: '@inproceedings{Happe_Agne_Plessl_Platzner_2012, title={Hardware/Software
Platform for Self-aware Compute Nodes}, booktitle={Proceedings of the Workshop
on Self-Awareness in Reconfigurable Computing Systems (SRCS)}, author={Happe,
Markus and Agne, Andreas and Plessl, Christian and Platzner, Marco}, year={2012},
pages={8–9} }'
chicago: Happe, Markus, Andreas Agne, Christian Plessl, and Marco Platzner. “Hardware/Software
Platform for Self-Aware Compute Nodes.” In Proceedings of the Workshop on Self-Awareness
in Reconfigurable Computing Systems (SRCS), 8–9, 2012.
ieee: M. Happe, A. Agne, C. Plessl, and M. Platzner, “Hardware/Software Platform
for Self-aware Compute Nodes,” in Proceedings of the Workshop on Self-Awareness
in Reconfigurable Computing Systems (SRCS), 2012, pp. 8–9.
mla: Happe, Markus, et al. “Hardware/Software Platform for Self-Aware Compute Nodes.”
Proceedings of the Workshop on Self-Awareness in Reconfigurable Computing Systems
(SRCS), 2012, pp. 8–9.
short: 'M. Happe, A. Agne, C. Plessl, M. Platzner, in: Proceedings of the Workshop
on Self-Awareness in Reconfigurable Computing Systems (SRCS), 2012, pp. 8–9.'
date_created: 2017-10-17T12:42:50Z
date_updated: 2023-09-26T13:41:36Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
- _id: '78'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T08:14:17Z
date_updated: 2018-03-15T08:14:17Z
file_id: '1249'
file_name: 609-happe12_fpl_awareness.pdf
file_size: 146789
relation: main_file
success: 1
file_date_updated: 2018-03-15T08:14:17Z
has_accepted_license: '1'
language:
- iso: eng
page: 8-9
project:
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '14'
grant_number: '160364472'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
- _id: '31'
grant_number: '257906'
name: Engineering Proprioception in Computing Systems
publication: Proceedings of the Workshop on Self-Awareness in Reconfigurable Computing
Systems (SRCS)
quality_controlled: '1'
status: public
title: Hardware/Software Platform for Self-aware Compute Nodes
type: conference
user_id: '15278'
year: '2012'
...
---
_id: '567'
abstract:
- lang: eng
text: Heterogeneous machines are gaining momentum in the High Performance Computing
field, due to the theoretical speedups and power consumption. In practice, while
some applications meet the performance expectations, heterogeneous architectures
still require a tremendous effort from the application developers. This work presents
a code generation method to port codes into heterogeneous platforms, based on
transformations of the control flow into function calls. The results show that
the cost of the function-call mechanism is affordable for the tested HPC kernels.
The complete toolchain, based on the LLVM compiler infrastructure, is fully automated
once the sequential specification is provided.
author:
- first_name: Pablo
full_name: Barrio, Pablo
last_name: Barrio
- first_name: Carlos
full_name: Carreras, Carlos
last_name: Carreras
- first_name: Roberto
full_name: Sierra, Roberto
last_name: Sierra
- first_name: Tobias
full_name: Kenter, Tobias
id: '3145'
last_name: Kenter
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: 'Barrio P, Carreras C, Sierra R, Kenter T, Plessl C. Turning control flow graphs
into function calls: Code generation for heterogeneous architectures. In: Proceedings
of the International Conference on High Performance Computing and Simulation (HPCS).
IEEE; 2012:559-565. doi:10.1109/HPCSim.2012.6266973'
apa: 'Barrio, P., Carreras, C., Sierra, R., Kenter, T., & Plessl, C. (2012).
Turning control flow graphs into function calls: Code generation for heterogeneous
architectures. Proceedings of the International Conference on High Performance
Computing and Simulation (HPCS), 559–565. https://doi.org/10.1109/HPCSim.2012.6266973'
bibtex: '@inproceedings{Barrio_Carreras_Sierra_Kenter_Plessl_2012, title={Turning
control flow graphs into function calls: Code generation for heterogeneous architectures},
DOI={10.1109/HPCSim.2012.6266973},
booktitle={Proceedings of the International Conference on High Performance Computing
and Simulation (HPCS)}, publisher={IEEE}, author={Barrio, Pablo and Carreras,
Carlos and Sierra, Roberto and Kenter, Tobias and Plessl, Christian}, year={2012},
pages={559–565} }'
chicago: 'Barrio, Pablo, Carlos Carreras, Roberto Sierra, Tobias Kenter, and Christian
Plessl. “Turning Control Flow Graphs into Function Calls: Code Generation for
Heterogeneous Architectures.” In Proceedings of the International Conference
on High Performance Computing and Simulation (HPCS), 559–65. IEEE, 2012. https://doi.org/10.1109/HPCSim.2012.6266973.'
ieee: 'P. Barrio, C. Carreras, R. Sierra, T. Kenter, and C. Plessl, “Turning control
flow graphs into function calls: Code generation for heterogeneous architectures,”
in Proceedings of the International Conference on High Performance Computing
and Simulation (HPCS), 2012, pp. 559–565, doi: 10.1109/HPCSim.2012.6266973.'
mla: 'Barrio, Pablo, et al. “Turning Control Flow Graphs into Function Calls: Code
Generation for Heterogeneous Architectures.” Proceedings of the International
Conference on High Performance Computing and Simulation (HPCS), IEEE, 2012,
pp. 559–65, doi:10.1109/HPCSim.2012.6266973.'
short: 'P. Barrio, C. Carreras, R. Sierra, T. Kenter, C. Plessl, in: Proceedings
of the International Conference on High Performance Computing and Simulation (HPCS),
IEEE, 2012, pp. 559–565.'
date_created: 2017-10-17T12:42:42Z
date_updated: 2023-09-26T13:42:54Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1109/HPCSim.2012.6266973
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:20:24Z
date_updated: 2018-03-15T10:20:24Z
file_id: '1275'
file_name: 567-ba-ca-12a.pdf
file_size: 288508
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:20:24Z
has_accepted_license: '1'
language:
- iso: eng
page: 559-565
project:
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '14'
grant_number: '160364472'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the International Conference on High Performance Computing
and Simulation (HPCS)
publisher: IEEE
quality_controlled: '1'
status: public
title: 'Turning control flow graphs into function calls: Code generation for heterogeneous
architectures'
type: conference
user_id: '15278'
year: '2012'
...
---
_id: '612'
abstract:
- lang: eng
text: While numerous publications have presented ring oscillator designs for temperature
measurements a detailed study of the ring oscillator's design space is still missing.
In this work, we introduce metrics for comparing the performance and area efficiency
of ring oscillators and a methodology for determining these metrics. As a result,
we present a systematic study of the design space for ring oscillators for a Xilinx
Virtex-5 platform FPGA.
author:
- first_name: Christoph
full_name: Rüthing, Christoph
last_name: Rüthing
- first_name: Markus
full_name: Happe, Markus
last_name: Happe
- first_name: Andreas
full_name: Agne, Andreas
last_name: Agne
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: 'Rüthing C, Happe M, Agne A, Plessl C. Exploration of Ring Oscillator Design
Space for Temperature Measurements on FPGAs. In: Proceedings of the International
Conference on Field Programmable Logic and Applications (FPL). IEEE; 2012:559-562.
doi:10.1109/FPL.2012.6339370'
apa: Rüthing, C., Happe, M., Agne, A., & Plessl, C. (2012). Exploration of Ring
Oscillator Design Space for Temperature Measurements on FPGAs. Proceedings
of the International Conference on Field Programmable Logic and Applications (FPL),
559–562. https://doi.org/10.1109/FPL.2012.6339370
bibtex: '@inproceedings{Rüthing_Happe_Agne_Plessl_2012, title={Exploration of Ring
Oscillator Design Space for Temperature Measurements on FPGAs}, DOI={10.1109/FPL.2012.6339370},
booktitle={Proceedings of the International Conference on Field Programmable Logic
and Applications (FPL)}, publisher={IEEE}, author={Rüthing, Christoph and Happe,
Markus and Agne, Andreas and Plessl, Christian}, year={2012}, pages={559–562}
}'
chicago: Rüthing, Christoph, Markus Happe, Andreas Agne, and Christian Plessl. “Exploration
of Ring Oscillator Design Space for Temperature Measurements on FPGAs.” In Proceedings
of the International Conference on Field Programmable Logic and Applications (FPL),
559–62. IEEE, 2012. https://doi.org/10.1109/FPL.2012.6339370.
ieee: 'C. Rüthing, M. Happe, A. Agne, and C. Plessl, “Exploration of Ring Oscillator
Design Space for Temperature Measurements on FPGAs,” in Proceedings of the
International Conference on Field Programmable Logic and Applications (FPL),
2012, pp. 559–562, doi: 10.1109/FPL.2012.6339370.'
mla: Rüthing, Christoph, et al. “Exploration of Ring Oscillator Design Space for
Temperature Measurements on FPGAs.” Proceedings of the International Conference
on Field Programmable Logic and Applications (FPL), IEEE, 2012, pp. 559–62,
doi:10.1109/FPL.2012.6339370.
short: 'C. Rüthing, M. Happe, A. Agne, C. Plessl, in: Proceedings of the International
Conference on Field Programmable Logic and Applications (FPL), IEEE, 2012, pp.
559–562.'
date_created: 2017-10-17T12:42:51Z
date_updated: 2023-09-26T13:42:03Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1109/FPL.2012.6339370
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:49:03Z
date_updated: 2018-03-15T06:49:03Z
file_id: '1247'
file_name: 612-ruething_fpl12.pdf
file_size: 202923
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:49:03Z
has_accepted_license: '1'
language:
- iso: eng
page: 559-562
project:
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '14'
grant_number: '160364472'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
- _id: '31'
grant_number: '257906'
name: Engineering Proprioception in Computing Systems
publication: Proceedings of the International Conference on Field Programmable Logic
and Applications (FPL)
publisher: IEEE
quality_controlled: '1'
status: public
title: Exploration of Ring Oscillator Design Space for Temperature Measurements on
FPGAs
type: conference
user_id: '15278'
year: '2012'
...
---
_id: '2512'
abstract:
- lang: eng
text: "In this paper we introduce the concept of an overall power function that
is meant\r\nto combine two sources of a party’s power in a parliament. The first
source is based\r\non the possibilities for the party to be part of a majority
coalition and it is typically\r\nmodeled using a cooperative simple game. The
second source takes into account\r\nparties’ asymmetries outside the cooperative
game and it is displayed by a vector\r\nof exogenously given weights. We adopt
a normative point of view and provide an\r\naxiomatic characterization of a specific
overall power function, in which the weights\r\nenter in a proportional fashion."
author:
- first_name: Dinko
full_name: Dimitrov, Dinko
last_name: Dimitrov
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
citation:
ama: Dimitrov D, Haake C-J. Proportionality and the power of unequal parties. International
Journal of Economic Theory. 2011;7(2):189-200. doi:10.1111/j.1742-7363.2011.00158.x
apa: Dimitrov, D., & Haake, C.-J. (2011). Proportionality and the power of unequal
parties. International Journal of Economic Theory, 7(2), 189–200.
https://doi.org/10.1111/j.1742-7363.2011.00158.x
bibtex: '@article{Dimitrov_Haake_2011, title={Proportionality and the power of unequal
parties}, volume={7}, DOI={10.1111/j.1742-7363.2011.00158.x},
number={2}, journal={International Journal of Economic Theory}, publisher={Wiley-Blackwell},
author={Dimitrov, Dinko and Haake, Claus-Jochen}, year={2011}, pages={189–200}
}'
chicago: 'Dimitrov, Dinko, and Claus-Jochen Haake. “Proportionality and the Power
of Unequal Parties.” International Journal of Economic Theory 7, no. 2
(2011): 189–200. https://doi.org/10.1111/j.1742-7363.2011.00158.x.'
ieee: D. Dimitrov and C.-J. Haake, “Proportionality and the power of unequal parties,”
International Journal of Economic Theory, vol. 7, no. 2, pp. 189–200, 2011.
mla: Dimitrov, Dinko, and Claus-Jochen Haake. “Proportionality and the Power of
Unequal Parties.” International Journal of Economic Theory, vol. 7, no.
2, Wiley-Blackwell, 2011, pp. 189–200, doi:10.1111/j.1742-7363.2011.00158.x.
short: D. Dimitrov, C.-J. Haake, International Journal of Economic Theory 7 (2011)
189–200.
date_created: 2018-04-26T10:43:43Z
date_updated: 2022-01-06T06:56:51Z
ddc:
- '040'
department:
- _id: '205'
- _id: '475'
doi: 10.1111/j.1742-7363.2011.00158.x
file:
- access_level: closed
content_type: application/pdf
creator: stela
date_created: 2018-11-07T10:41:24Z
date_updated: 2018-11-07T10:41:24Z
file_id: '5408'
file_name: Proportionality and the power of unequal parties.pdf
file_size: 152349
relation: main_file
success: 1
file_date_updated: 2018-11-07T10:41:24Z
has_accepted_license: '1'
intvolume: ' 7'
issue: '2'
jel:
- C71
- D72
language:
- iso: eng
page: 189-200
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publication: International Journal of Economic Theory
publication_identifier:
issn:
- 1742-7355
publication_status: published
publisher: Wiley-Blackwell
status: public
title: Proportionality and the power of unequal parties
type: journal_article
user_id: '65453'
volume: 7
year: '2011'
...
---
_id: '17997'
author:
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: Setzer A. Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern
in Einem Peer-to-Peer Netzwerk. Universität Paderborn; 2011.
apa: Setzer, A. (2011). Lokale Online-Strategien zur linearen Anordnung von Teilnehmern
in einem Peer-to-Peer Netzwerk. Universität Paderborn.
bibtex: '@book{Setzer_2011, title={Lokale Online-Strategien zur linearen Anordnung
von Teilnehmern in einem Peer-to-Peer Netzwerk}, publisher={Universität Paderborn},
author={Setzer, Alexander}, year={2011} }'
chicago: Setzer, Alexander. Lokale Online-Strategien Zur Linearen Anordnung von
Teilnehmern in Einem Peer-to-Peer Netzwerk. Universität Paderborn, 2011.
ieee: A. Setzer, Lokale Online-Strategien zur linearen Anordnung von Teilnehmern
in einem Peer-to-Peer Netzwerk. Universität Paderborn, 2011.
mla: Setzer, Alexander. Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern
in Einem Peer-to-Peer Netzwerk. Universität Paderborn, 2011.
short: A. Setzer, Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern
in Einem Peer-to-Peer Netzwerk, Universität Paderborn, 2011.
date_created: 2020-08-17T08:08:13Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Lokale Online-Strategien zur linearen Anordnung von Teilnehmern in einem Peer-to-Peer
Netzwerk
type: bachelorsthesis
user_id: '477'
year: '2011'
...
---
_id: '642'
author:
- first_name: Matthias
full_name: Diehl, Matthias
last_name: Diehl
citation:
ama: 'Diehl M. Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler Zugang
zu Superadditivität. Universität Paderborn; 2011.'
apa: 'Diehl, M. (2011). Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler
Zugang zu Superadditivität. Universität Paderborn.'
bibtex: '@book{Diehl_2011, title={Vorteile der Paketbildung in Verhandlungen: Ein
prozeduraler Zugang zu Superadditivität}, publisher={Universität Paderborn}, author={Diehl,
Matthias}, year={2011} }'
chicago: 'Diehl, Matthias. Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler
Zugang zu Superadditivität. Universität Paderborn, 2011.'
ieee: 'M. Diehl, Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler
Zugang zu Superadditivität. Universität Paderborn, 2011.'
mla: 'Diehl, Matthias. Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler
Zugang zu Superadditivität. Universität Paderborn, 2011.'
short: 'M. Diehl, Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler Zugang
zu Superadditivität, Universität Paderborn, 2011.'
date_created: 2017-10-17T12:42:57Z
date_updated: 2022-01-06T07:03:04Z
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
title: 'Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler Zugang zu Superadditivität'
type: bachelorsthesis
user_id: '477'
year: '2011'
...
---
_id: '643'
author:
- first_name: Daniel
full_name: Welp, Daniel
last_name: Welp
citation:
ama: Welp D. User-Space Scheduling for Heterogeneous System under Linux.
Universität Paderborn; 2011.
apa: Welp, D. (2011). User-space Scheduling for Heterogeneous System under Linux.
Universität Paderborn.
bibtex: '@book{Welp_2011, title={User-space Scheduling for Heterogeneous System
under Linux}, publisher={Universität Paderborn}, author={Welp, Daniel}, year={2011}
}'
chicago: Welp, Daniel. User-Space Scheduling for Heterogeneous System under Linux.
Universität Paderborn, 2011.
ieee: D. Welp, User-space Scheduling for Heterogeneous System under Linux.
Universität Paderborn, 2011.
mla: Welp, Daniel. User-Space Scheduling for Heterogeneous System under Linux.
Universität Paderborn, 2011.
short: D. Welp, User-Space Scheduling for Heterogeneous System under Linux, Universität
Paderborn, 2011.
date_created: 2017-10-17T12:42:57Z
date_updated: 2022-01-06T07:03:04Z
project:
- _id: '1'
name: SFB 901
- _id: '14'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: User-space Scheduling for Heterogeneous System under Linux
type: mastersthesis
user_id: '15504'
year: '2011'
...
---
_id: '644'
abstract:
- lang: eng
text: In reverse engineering, dynamic pattern detection is accomplished by collecting
execution traces and comparing them to expected behavioral patterns. The traces
are collected by manually executing the program in question and therefore represent
only part of all relevant program behavior. This can lead to false conclusions
about the detected patterns. In this paper, we propose to generate all relevant
program traces by using symbolic execution. In order to reduce the created trace
data, we allow to limit the trace collection to a user-selectable subset of the
statically detected pattern candidates.
author:
- first_name: Markus
full_name: von Detten, Markus
last_name: von Detten
citation:
ama: 'von Detten M. Towards Systematic, Comprehensive Trace Generation for Behavioral
Pattern Detection through Symbolic Execution. In: Proceedings of the 10th ACM
SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering
(PASTE). ; 2011:17-20. doi:10.1145/2024569.2024573'
apa: von Detten, M. (2011). Towards Systematic, Comprehensive Trace Generation for
Behavioral Pattern Detection through Symbolic Execution. In Proceedings of
the 10th ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and
Engineering (PASTE) (pp. 17–20). https://doi.org/10.1145/2024569.2024573
bibtex: '@inproceedings{von Detten_2011, title={Towards Systematic, Comprehensive
Trace Generation for Behavioral Pattern Detection through Symbolic Execution},
DOI={10.1145/2024569.2024573},
booktitle={Proceedings of the 10th ACM SIGPLAN/SIGSOFT Workshop on Program Analysis
for Software Tools and Engineering (PASTE)}, author={von Detten, Markus}, year={2011},
pages={17–20} }'
chicago: Detten, Markus von. “Towards Systematic, Comprehensive Trace Generation
for Behavioral Pattern Detection through Symbolic Execution.” In Proceedings
of the 10th ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools
and Engineering (PASTE), 17–20, 2011. https://doi.org/10.1145/2024569.2024573.
ieee: M. von Detten, “Towards Systematic, Comprehensive Trace Generation for Behavioral
Pattern Detection through Symbolic Execution,” in Proceedings of the 10th ACM
SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering
(PASTE), 2011, pp. 17–20.
mla: von Detten, Markus. “Towards Systematic, Comprehensive Trace Generation for
Behavioral Pattern Detection through Symbolic Execution.” Proceedings of the
10th ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering
(PASTE), 2011, pp. 17–20, doi:10.1145/2024569.2024573.
short: 'M. von Detten, in: Proceedings of the 10th ACM SIGPLAN/SIGSOFT Workshop
on Program Analysis for Software Tools and Engineering (PASTE), 2011, pp. 17–20.'
date_created: 2017-10-17T12:42:57Z
date_updated: 2022-01-06T07:03:05Z
ddc:
- '040'
doi: 10.1145/2024569.2024573
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T14:08:32Z
date_updated: 2018-03-14T14:08:32Z
file_id: '1229'
file_name: 644-paste09s-vonDetten_01.pdf
file_size: 121611
relation: main_file
success: 1
file_date_updated: 2018-03-14T14:08:32Z
has_accepted_license: '1'
page: 17-20
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 10th ACM SIGPLAN/SIGSOFT Workshop on Program Analysis
for Software Tools and Engineering (PASTE)
status: public
title: Towards Systematic, Comprehensive Trace Generation for Behavioral Pattern Detection
through Symbolic Execution
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '645'
abstract:
- lang: eng
text: In the standard consensus problem there are n processes with possibly di®erent
input values and the goal is to eventually reach a point at which all processes
commit to exactly one of these values. We are studying a slight variant of the
consensus problem called the stabilizing consensus problem [2]. In this problem,
we do not require that each process commits to a ¯nal value at some point, but
that eventually they arrive at a common, stable value without necessarily being
aware of that. This should work irrespective of the states in which the processes
are starting. Our main result is a simple randomized algorithm called median rule
that, with high probability, just needs O(logmlog log n + log n) time and work
per process to arrive at an almost stable consensus for any set of m legal values
as long as an adversary can corrupt the states of at most p n processes at any
time. Without adversarial involvement, just O(log n) time and work is needed for
a stable consensus, with high probability. As a by-product, we obtain a simple
distributed algorithm for approximating the median of n numbers in time O(logmlog
log n + log n) under adversarial presence.
author:
- first_name: Benjamin
full_name: Doerr, Benjamin
last_name: Doerr
- first_name: Leslie Ann
full_name: Goldberg, Leslie Ann
last_name: Goldberg
- first_name: Lorenz
full_name: Minder, Lorenz
last_name: Minder
- first_name: Thomas
full_name: Sauerwald, Thomas
last_name: Sauerwald
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Doerr B, Goldberg LA, Minder L, Sauerwald T, Scheideler C. Stabilizing consensus
with the power of two choices. In: Proceedings of the 23rd ACM Symposium on
Parallelism in Algorithms and Architectures (SPAA). ; 2011:149-158. doi:10.1145/1989493.1989516'
apa: Doerr, B., Goldberg, L. A., Minder, L., Sauerwald, T., & Scheideler, C.
(2011). Stabilizing consensus with the power of two choices. In Proceedings
of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
(pp. 149–158). https://doi.org/10.1145/1989493.1989516
bibtex: '@inproceedings{Doerr_Goldberg_Minder_Sauerwald_Scheideler_2011, title={Stabilizing
consensus with the power of two choices}, DOI={10.1145/1989493.1989516},
booktitle={Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Doerr, Benjamin and Goldberg, Leslie Ann and
Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian}, year={2011},
pages={149–158} }'
chicago: Doerr, Benjamin, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald,
and Christian Scheideler. “Stabilizing Consensus with the Power of Two Choices.”
In Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), 149–58, 2011. https://doi.org/10.1145/1989493.1989516.
ieee: B. Doerr, L. A. Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, “Stabilizing
consensus with the power of two choices,” in Proceedings of the 23rd ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 2011, pp. 149–158.
mla: Doerr, Benjamin, et al. “Stabilizing Consensus with the Power of Two Choices.”
Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), 2011, pp. 149–58, doi:10.1145/1989493.1989516.
short: 'B. Doerr, L.A. Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Proceedings
of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
2011, pp. 149–158.'
date_created: 2017-10-17T12:42:57Z
date_updated: 2022-01-06T07:03:05Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1145/1989493.1989516
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T13:58:11Z
date_updated: 2018-03-14T13:58:11Z
file_id: '1228'
file_name: 645-spaa70-scheideler.pdf
file_size: 268500
relation: main_file
success: 1
file_date_updated: 2018-03-14T13:58:11Z
has_accepted_license: '1'
page: 149-158
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 23rd ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
status: public
title: Stabilizing consensus with the power of two choices
type: conference
user_id: '15504'
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'
...