---
_id: '607'
author:
- first_name: Thomas
full_name: Haarhoff, Thomas
last_name: Haarhoff
citation:
ama: Haarhoff T. Identitätsbasierte Kryptographie - Implementierung von Paarungen
für Körper der Charakteristik 2. Universität Paderborn; 2012.
apa: Haarhoff, T. (2012). Identitätsbasierte Kryptographie - Implementierung
von Paarungen für Körper der Charakteristik 2. Universität Paderborn.
bibtex: '@book{Haarhoff_2012, title={Identitätsbasierte Kryptographie - Implementierung
von Paarungen für Körper der Charakteristik 2}, publisher={Universität Paderborn},
author={Haarhoff, Thomas}, year={2012} }'
chicago: Haarhoff, Thomas. Identitätsbasierte Kryptographie - Implementierung
von Paarungen für Körper der Charakteristik 2. Universität Paderborn, 2012.
ieee: T. Haarhoff, Identitätsbasierte Kryptographie - Implementierung von Paarungen
für Körper der Charakteristik 2. Universität Paderborn, 2012.
mla: Haarhoff, Thomas. Identitätsbasierte Kryptographie - Implementierung von
Paarungen für Körper der Charakteristik 2. Universität Paderborn, 2012.
short: T. Haarhoff, Identitätsbasierte Kryptographie - Implementierung von Paarungen
für Körper der Charakteristik 2, Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:50Z
date_updated: 2022-01-06T07:02:51Z
department:
- _id: '64'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper
der Charakteristik 2
type: bachelorsthesis
user_id: '477'
year: '2012'
...
---
_id: '611'
author:
- first_name: Hendrik
full_name: Hangmann, Hendrik
last_name: Hangmann
citation:
ama: Hangmann H. Generating Adjustable Temperature Gradients on Modern FPGAs.
Universität Paderborn; 2012.
apa: Hangmann, H. (2012). Generating Adjustable Temperature Gradients on modern
FPGAs. Universität Paderborn.
bibtex: '@book{Hangmann_2012, title={Generating Adjustable Temperature Gradients
on modern FPGAs}, publisher={Universität Paderborn}, author={Hangmann, Hendrik},
year={2012} }'
chicago: Hangmann, Hendrik. Generating Adjustable Temperature Gradients on Modern
FPGAs. Universität Paderborn, 2012.
ieee: H. Hangmann, Generating Adjustable Temperature Gradients on modern FPGAs.
Universität Paderborn, 2012.
mla: Hangmann, Hendrik. Generating Adjustable Temperature Gradients on Modern
FPGAs. Universität Paderborn, 2012.
short: H. Hangmann, Generating Adjustable Temperature Gradients on Modern FPGAs,
Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:51Z
date_updated: 2022-01-06T07:02:53Z
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: Generating Adjustable Temperature Gradients on modern FPGAs
type: bachelorsthesis
user_id: '15504'
year: '2012'
...
---
_id: '613'
author:
- first_name: Stefan
full_name: Wohlfarth, Stefan
last_name: Wohlfarth
citation:
ama: Wohlfarth S. Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung
mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens.
Universität Paderborn; 2012.
apa: Wohlfarth, S. (2012). Erweiterung von d3fact um die Domäne Wasserversorgung
in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens.
Universität Paderborn.
bibtex: '@book{Wohlfarth_2012, title={Erweiterung von d3fact um die Domäne Wasserversorgung
in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens},
publisher={Universität Paderborn}, author={Wohlfarth, Stefan}, year={2012} }'
chicago: Wohlfarth, Stefan. Erweiterung von d3fact um die Domäne Wasserversorgung
in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens.
Universität Paderborn, 2012.
ieee: S. Wohlfarth, Erweiterung von d3fact um die Domäne Wasserversorgung in
Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens.
Universität Paderborn, 2012.
mla: Wohlfarth, Stefan. Erweiterung von d3fact um die Domäne Wasserversorgung
in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens.
Universität Paderborn, 2012.
short: S. Wohlfarth, Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung
mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens,
Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:51Z
date_updated: 2022-01-06T07:02:53Z
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: Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der
Analyse und Implementierung eines hydraulischen Simulationsverfahrens
type: mastersthesis
user_id: '477'
year: '2012'
...
---
_id: '620'
author:
- first_name: Robert
full_name: Mittendorf, Robert
last_name: Mittendorf
citation:
ama: Mittendorf R. Datenschutzgerechtes DRM im Cloud Computing. Universität
Paderborn; 2012.
apa: Mittendorf, R. (2012). Datenschutzgerechtes DRM im Cloud Computing.
Universität Paderborn.
bibtex: '@book{Mittendorf_2012, title={Datenschutzgerechtes DRM im Cloud Computing},
publisher={Universität Paderborn}, author={Mittendorf, Robert}, year={2012} }'
chicago: Mittendorf, Robert. Datenschutzgerechtes DRM im Cloud Computing.
Universität Paderborn, 2012.
ieee: R. Mittendorf, Datenschutzgerechtes DRM im Cloud Computing. Universität
Paderborn, 2012.
mla: Mittendorf, Robert. Datenschutzgerechtes DRM im Cloud Computing. Universität
Paderborn, 2012.
short: R. Mittendorf, Datenschutzgerechtes DRM im Cloud Computing, Universität Paderborn,
2012.
date_created: 2017-10-17T12:42:52Z
date_updated: 2022-01-06T07:02:56Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Datenschutzgerechtes DRM im Cloud Computing
type: bachelorsthesis
user_id: '477'
year: '2012'
...
---
_id: '621'
author:
- first_name: Stephan
full_name: Sekula, Stephan
last_name: Sekula
citation:
ama: Sekula S. Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing.
Universität Paderborn; 2012.
apa: Sekula, S. (2012). Datenschutzgerechte E-Payment-Schemata im On-The-Fly
Computing. Universität Paderborn.
bibtex: '@book{Sekula_2012, title={Datenschutzgerechte E-Payment-Schemata im On-The-Fly
Computing}, publisher={Universität Paderborn}, author={Sekula, Stephan}, year={2012}
}'
chicago: Sekula, Stephan. Datenschutzgerechte E-Payment-Schemata im On-The-Fly
Computing. Universität Paderborn, 2012.
ieee: S. Sekula, Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing.
Universität Paderborn, 2012.
mla: Sekula, Stephan. Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing.
Universität Paderborn, 2012.
short: S. Sekula, Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing,
Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:53Z
date_updated: 2022-01-06T07:02:57Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing
type: bachelorsthesis
user_id: '477'
year: '2012'
...
---
_id: '623'
abstract:
- lang: eng
text: 'This paper initiates the formal study of a fundamental problem: How to efficiently
allocate a shared communication medium among a set of K co-existing networks in
the presence of arbitrary external interference? While most literature on medium
access focuses on how to share a medium among nodes, these approaches are often
either not directly applicable to co-existing networks as they would violate the
independence requirement, or they yield a low throughput if applied to multiple
networks. We present the randomized medium access (MAC) protocol COMAC which guarantees
that a given communication channel is shared fairly among competing and independent
networks, and that the available bandwidth is used efficiently. These performance
guarantees hold in the presence of arbitrary external interference or even under
adversarial jamming. Concretely, we show that the co-existing networks can use
a Ω(ε2 min{ε, 1/poly(K)})-fraction of the non-jammed time steps for successful
message transmissions, where ε is the (arbitrarily distributed) fraction of time
which is not jammed.'
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
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: 'Jin '
full_name: 'Zhang, Jin '
last_name: Zhang
citation:
ama: 'Richa AW, Scheideler C, Schmid S, Zhang J. Competitive and fair throughput
for co-existing networks under adversarial interference. In: Proceedings of
the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing
(PODC). ; 2012:291-300. doi:10.1145/2332432.2332488'
apa: Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2012). Competitive
and fair throughput for co-existing networks under adversarial interference. In
Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and
Distributed Computing (PODC) (pp. 291–300). https://doi.org/10.1145/2332432.2332488
bibtex: '@inproceedings{Richa_Scheideler_Schmid_Zhang_2012, title={Competitive and
fair throughput for co-existing networks under adversarial interference}, DOI={10.1145/2332432.2332488}, booktitle={Proceedings
of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing
(PODC)}, author={Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan
and Zhang, Jin }, year={2012}, pages={291–300} }'
chicago: Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin Zhang.
“Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.”
In Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles
and Distributed Computing (PODC), 291–300, 2012. https://doi.org/10.1145/2332432.2332488.
ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive and fair
throughput for co-existing networks under adversarial interference,” in Proceedings
of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing
(PODC), 2012, pp. 291–300.
mla: Richa, Andrea W., et al. “Competitive and Fair Throughput for Co-Existing Networks
under Adversarial Interference.” Proceedings of the 31st Annual ACM SIGACT-SIGOPS
Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300,
doi:10.1145/2332432.2332488.
short: 'A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 31st
Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC),
2012, pp. 291–300.'
date_created: 2017-10-17T12:42:53Z
date_updated: 2022-01-06T07:02:58Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1145/2332432.2332488
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:45:25Z
date_updated: 2018-03-15T06:45:25Z
file_id: '1241'
file_name: 623-PODC-2012_01.pdf
file_size: 210382
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:45:25Z
has_accepted_license: '1'
page: 291-300
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 31st Annual ACM SIGACT-SIGOPS Symposium on Principles
and Distributed Computing (PODC)
status: public
title: Competitive and fair throughput for co-existing networks under adversarial
interference
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '629'
author:
- first_name: Patrick
full_name: Schleiter, Patrick
last_name: Schleiter
citation:
ama: Schleiter P. Attribute-basierte Verschlüsselung. Universität Paderborn;
2012.
apa: Schleiter, P. (2012). Attribute-basierte Verschlüsselung. Universität
Paderborn.
bibtex: '@book{Schleiter_2012, title={Attribute-basierte Verschlüsselung}, publisher={Universität
Paderborn}, author={Schleiter, Patrick}, year={2012} }'
chicago: Schleiter, Patrick. Attribute-basierte Verschlüsselung. Universität
Paderborn, 2012.
ieee: P. Schleiter, Attribute-basierte Verschlüsselung. Universität Paderborn,
2012.
mla: Schleiter, Patrick. Attribute-basierte Verschlüsselung. Universität
Paderborn, 2012.
short: P. Schleiter, Attribute-basierte Verschlüsselung, Universität Paderborn,
2012.
date_created: 2017-10-17T12:42:54Z
date_updated: 2022-01-06T07:03:00Z
department:
- _id: '64'
language:
- iso: ger
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: Attribute-basierte Verschlüsselung
type: bachelorsthesis
user_id: '477'
year: '2012'
...
---
_id: '633'
author:
- first_name: Daniel
full_name: Pischel, Daniel
last_name: Pischel
citation:
ama: Pischel D. Analyse, Konzeption und Implementierung von Aggregationsverfahren
für Trinkwasserversorgungsnetze. Universität Paderborn; 2012.
apa: Pischel, D. (2012). Analyse, Konzeption und Implementierung von Aggregationsverfahren
für Trinkwasserversorgungsnetze. Universität Paderborn.
bibtex: '@book{Pischel_2012, title={Analyse, Konzeption und Implementierung von
Aggregationsverfahren für Trinkwasserversorgungsnetze}, publisher={Universität
Paderborn}, author={Pischel, Daniel}, year={2012} }'
chicago: Pischel, Daniel. Analyse, Konzeption und Implementierung von Aggregationsverfahren
für Trinkwasserversorgungsnetze. Universität Paderborn, 2012.
ieee: D. Pischel, Analyse, Konzeption und Implementierung von Aggregationsverfahren
für Trinkwasserversorgungsnetze. Universität Paderborn, 2012.
mla: Pischel, Daniel. Analyse, Konzeption und Implementierung von Aggregationsverfahren
für Trinkwasserversorgungsnetze. Universität Paderborn, 2012.
short: D. Pischel, Analyse, Konzeption und Implementierung von Aggregationsverfahren
für Trinkwasserversorgungsnetze, Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:55Z
date_updated: 2022-01-06T07:03:01Z
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: Analyse, Konzeption und Implementierung von Aggregationsverfahren für Trinkwasserversorgungsnetze
type: mastersthesis
user_id: '477'
year: '2012'
...
---
_id: '634'
author:
- first_name: Julian
full_name: Kratzmann, Julian
last_name: Kratzmann
citation:
ama: Kratzmann J. Analyse und Simulation von energieeffizienten Online-Scheduling
Algorithmen. Universität Paderborn; 2012.
apa: Kratzmann, J. (2012). Analyse und Simulation von energieeffizienten Online-Scheduling
Algorithmen. Universität Paderborn.
bibtex: '@book{Kratzmann_2012, title={Analyse und Simulation von energieeffizienten
Online-Scheduling Algorithmen}, publisher={Universität Paderborn}, author={Kratzmann,
Julian}, year={2012} }'
chicago: Kratzmann, Julian. Analyse und Simulation von energieeffizienten Online-Scheduling
Algorithmen. Universität Paderborn, 2012.
ieee: J. Kratzmann, Analyse und Simulation von energieeffizienten Online-Scheduling
Algorithmen. Universität Paderborn, 2012.
mla: Kratzmann, Julian. Analyse und Simulation von energieeffizienten Online-Scheduling
Algorithmen. Universität Paderborn, 2012.
short: J. Kratzmann, Analyse und Simulation von energieeffizienten Online-Scheduling
Algorithmen, Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:55Z
date_updated: 2022-01-06T07:03:01Z
language:
- iso: ger
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: Analyse und Simulation von energieeffizienten Online-Scheduling Algorithmen
type: bachelorsthesis
user_id: '477'
year: '2012'
...
---
_id: '635'
abstract:
- lang: eng
text: In Germany, the optimization of water supply systems has gained more and more
attention due to a growing cost pressure for German municipal utilities. In this
work, a model is presented which optimizes the usage of water tanks. On the one
hand locations of new tanks are identified, and on the other hand the size of
existing tanks is optimized, subject to satisfying the demand of clients and providing
the necessary amount of fire water during all time periods. The main difficulty
is the consideration of the head loss equation which is required to model the
hydraulic properties of a water supply system. As this equation is non-convex
and quadratic the optimization model becomes a non-convex Mixed Integer Quadratically
Constrained Program (MIQCP). To solve this MIQCP different solution methods are
applied.
author:
- first_name: Corinna
full_name: 'Dohle (married name: Hallmann) , Corinna'
last_name: 'Dohle (married name: Hallmann) '
- first_name: Leena
full_name: Suhl, Leena
last_name: Suhl
citation:
ama: 'Dohle (married name: Hallmann) C, Suhl L. An Optimization Model for the optimal
Usage of Water Tanks in Water Supply Systems. In: Proceedings of the International
Conference on Applied Mathematical Optimization and Modelling (APMOD). ; 2012:404-408.'
apa: 'Dohle (married name: Hallmann) , C., & Suhl, L. (2012). An Optimization
Model for the optimal Usage of Water Tanks in Water Supply Systems. In Proceedings
of the International Conference on Applied Mathematical Optimization and Modelling
(APMOD) (pp. 404–408).'
bibtex: '@inproceedings{Dohle (married name: Hallmann) _Suhl_2012, title={An Optimization
Model for the optimal Usage of Water Tanks in Water Supply Systems}, booktitle={Proceedings
of the International Conference on Applied Mathematical Optimization and Modelling
(APMOD)}, author={Dohle (married name: Hallmann) , Corinna and Suhl, Leena}, year={2012},
pages={404–408} }'
chicago: 'Dohle (married name: Hallmann) , Corinna, and Leena Suhl. “An Optimization
Model for the Optimal Usage of Water Tanks in Water Supply Systems.” In Proceedings
of the International Conference on Applied Mathematical Optimization and Modelling
(APMOD), 404–8, 2012.'
ieee: 'C. Dohle (married name: Hallmann) and L. Suhl, “An Optimization Model for
the optimal Usage of Water Tanks in Water Supply Systems,” in Proceedings of
the International Conference on Applied Mathematical Optimization and Modelling
(APMOD), 2012, pp. 404–408.'
mla: 'Dohle (married name: Hallmann) , Corinna, and Leena Suhl. “An Optimization
Model for the Optimal Usage of Water Tanks in Water Supply Systems.” Proceedings
of the International Conference on Applied Mathematical Optimization and Modelling
(APMOD), 2012, pp. 404–08.'
short: 'C. Dohle (married name: Hallmann) , L. Suhl, in: Proceedings of the International
Conference on Applied Mathematical Optimization and Modelling (APMOD), 2012, pp.
404–408.'
date_created: 2017-10-17T12:42:55Z
date_updated: 2022-01-06T07:03:02Z
ddc:
- '040'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T14:15:10Z
date_updated: 2018-03-14T14:15:10Z
file_id: '1233'
file_name: 635-Dohle_Apmod_2012.pdf
file_size: 164455
relation: main_file
success: 1
file_date_updated: 2018-03-14T14:15:10Z
has_accepted_license: '1'
page: 404-408
project:
- _id: '1'
name: SFB 901
- _id: '15'
name: SFB 901 - Subprojekt C3
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the International Conference on Applied Mathematical Optimization
and Modelling (APMOD)
status: public
title: An Optimization Model for the optimal Usage of Water Tanks in Water Supply
Systems
type: conference
user_id: '15504'
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: '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: '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: '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'
...