---
_id: '3365'
author:
- first_name: Jan-Philip
full_name: Schnuer, Jan-Philip
last_name: Schnuer
citation:
ama: Schnuer J-P. Static Scheduling Algorithms for Heterogeneous Compute Nodes.
Universität Paderborn; 2018.
apa: Schnuer, J.-P. (2018). Static Scheduling Algorithms for Heterogeneous Compute
Nodes. Universität Paderborn.
bibtex: '@book{Schnuer_2018, title={Static Scheduling Algorithms for Heterogeneous
Compute Nodes}, publisher={Universität Paderborn}, author={Schnuer, Jan-Philip},
year={2018} }'
chicago: Schnuer, Jan-Philip. Static Scheduling Algorithms for Heterogeneous
Compute Nodes. Universität Paderborn, 2018.
ieee: J.-P. Schnuer, Static Scheduling Algorithms for Heterogeneous Compute Nodes.
Universität Paderborn, 2018.
mla: Schnuer, Jan-Philip. Static Scheduling Algorithms for Heterogeneous Compute
Nodes. Universität Paderborn, 2018.
short: J.-P. Schnuer, Static Scheduling Algorithms for Heterogeneous Compute Nodes,
Universität Paderborn, 2018.
date_created: 2018-06-26T14:10:18Z
date_updated: 2022-01-06T06:59:13Z
department:
- _id: '78'
language:
- iso: eng
project:
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Achim
full_name: Lösch, Achim
id: '43646'
last_name: Lösch
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
title: Static Scheduling Algorithms for Heterogeneous Compute Nodes
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '3366'
author:
- first_name: Marcel
full_name: Croce, Marcel
last_name: Croce
citation:
ama: Croce M. Evaluation of OpenCL-Based Compilation for FPGAs. Universität
Paderborn; 2018.
apa: Croce, M. (2018). Evaluation of OpenCL-based Compilation for FPGAs.
Universität Paderborn.
bibtex: '@book{Croce_2018, title={Evaluation of OpenCL-based Compilation for FPGAs},
publisher={Universität Paderborn}, author={Croce, Marcel}, year={2018} }'
chicago: Croce, Marcel. Evaluation of OpenCL-Based Compilation for FPGAs.
Universität Paderborn, 2018.
ieee: M. Croce, Evaluation of OpenCL-based Compilation for FPGAs. Universität
Paderborn, 2018.
mla: Croce, Marcel. Evaluation of OpenCL-Based Compilation for FPGAs. Universität
Paderborn, 2018.
short: M. Croce, Evaluation of OpenCL-Based Compilation for FPGAs, Universität Paderborn,
2018.
date_created: 2018-06-26T14:12:00Z
date_updated: 2022-01-06T06:59:13Z
department:
- _id: '78'
language:
- iso: eng
project:
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Achim
full_name: Lösch, Achim
id: '43646'
last_name: Lösch
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
title: Evaluation of OpenCL-based Compilation for FPGAs
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '3422'
abstract:
- lang: eng
text: "We study the consensus problem in a synchronous distributed system of n nodes
under an adaptive adversary that has a slightly outdated view of the system and
can block all incoming and outgoing communication of a constant fraction of the
nodes in each round. Motivated by a result of Ben-Or and Bar-Joseph (1998), showing
that any consensus algorithm that is resilient against a linear number of crash
faults requires $\\tilde \\Omega(\\sqrt n)$ rounds in an n-node network against
an adaptive adversary, we consider a late adaptive adversary, who has full knowledge
of the network state at the beginning of the previous round and unlimited computational
power, but is oblivious to the current state of the nodes. \r\n\r\nOur main contributions
are randomized distributed algorithms that achieve consensus with high probability
among all except a small constant fraction of the nodes (i.e., \"almost-everywhere'')
against a late adaptive adversary who can block up to ε n$ nodes in each round,
for a small constant ε >0$. Our first protocol achieves binary almost-everywhere
consensus and also guarantees a decision on the majority input value, thus ensuring
plurality consensus. We also present an algorithm that achieves the same time
complexity for multi-value consensus. Both of our algorithms succeed in $O(log
n)$ rounds with high probability, thus showing an exponential gap to the $\\tilde\\Omega(\\sqrt
n)$ lower bound of Ben-Or and Bar-Joseph for strongly adaptive crash-failure adversaries,
which can be strengthened to $\\Omega(n)$ when allowing the adversary to block
nodes instead of permanently crashing them. Our algorithms are scalable to large
systems as each node contacts only an (amortized) constant number of peers in
each communication round. We show that our algorithms are optimal up to constant
(resp.\\ sub-logarithmic) factors by proving that every almost-everywhere consensus
protocol takes $\\Omega(log_d n)$ rounds in the worst case, where d is an upper
bound on the number of communication requests initiated per node in each round.
We complement our theoretical results with an experimental evaluation of the binary
almost-everywhere consensus protocol revealing a short convergence time even against
an adversary blocking a large fraction of nodes."
author:
- first_name: Peter
full_name: Robinson, Peter
last_name: Robinson
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: 'Robinson P, Scheideler C, Setzer A. Breaking the $\tilde\Omega(\sqrt{n})$
Barrier: Fast Consensus under a Late Adversary. In: Proceedings of the 30th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). doi:10.1145/3210377.3210399'
apa: 'Robinson, P., Scheideler, C., & Setzer, A. (n.d.). Breaking the $\tilde\Omega(\sqrt{n})$
Barrier: Fast Consensus under a Late Adversary. In Proceedings of the 30th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). Wien.
https://doi.org/10.1145/3210377.3210399'
bibtex: '@inproceedings{Robinson_Scheideler_Setzer, title={Breaking the $\tilde\Omega(\sqrt{n})$
Barrier: Fast Consensus under a Late Adversary}, DOI={10.1145/3210377.3210399},
booktitle={Proceedings of the 30th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Robinson, Peter and Scheideler, Christian and
Setzer, Alexander} }'
chicago: 'Robinson, Peter, Christian Scheideler, and Alexander Setzer. “Breaking
the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary.”
In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), n.d. https://doi.org/10.1145/3210377.3210399.'
ieee: 'P. Robinson, C. Scheideler, and A. Setzer, “Breaking the $\tilde\Omega(\sqrt{n})$
Barrier: Fast Consensus under a Late Adversary,” in Proceedings of the 30th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien.'
mla: 'Robinson, Peter, et al. “Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast
Consensus under a Late Adversary.” Proceedings of the 30th ACM Symposium on
Parallelism in Algorithms and Architectures (SPAA), doi:10.1145/3210377.3210399.'
short: 'P. Robinson, C. Scheideler, A. Setzer, in: Proceedings of the 30th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), n.d.'
conference:
end_date: 2018-07-18
location: Wien
name: 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
start_date: 2018-07-16
date_created: 2018-07-04T08:55:45Z
date_updated: 2022-01-06T06:59:16Z
ddc:
- '040'
department:
- _id: '79'
- _id: '34'
- _id: '7'
doi: 10.1145/3210377.3210399
file:
- access_level: closed
content_type: application/pdf
creator: asetzer
date_created: 2018-10-31T13:30:40Z
date_updated: 2018-10-31T13:30:40Z
file_id: '5215'
file_name: p173-robinson.pdf
file_size: 1675407
relation: main_file
success: 1
file_date_updated: 2018-10-31T13:30:40Z
has_accepted_license: '1'
keyword:
- distributed consensus
- randomized algorithm
- adaptive adversary
- complexity lower bound
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
publication_identifier:
isbn:
- 978-1-4503-5799-9/18/07
publication_status: accepted
status: public
title: 'Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late
Adversary'
type: conference
user_id: '11108'
year: '2018'
...
---
_id: '3550'
abstract:
- lang: eng
text: Nowadays companies like Apple create ecosystems of third- party providers
and users around their software platforms. Often online stores like Apple App
Store are created to directly market third-party solutions. We call such ecosystems
store-oriented software ecosystems. While the architecture of these ecosystems
is mainly derived from busi- ness decisions of their owners, ecosystems with greatly
different archi- tectural designs have been created. This diversity makes it challenging
for future ecosystem providers to understand which architectural design is suitable
to fulfill certain business decisions. In turn, opening a plat- form becomes risky
while endangering intellectual property or scarifying quality of services. In
this paper, we identify three main design options of store-oriented software ecosystems
by classifying existing ecosystems based on similarities in their business decisions.
We elaborate on the design options, discuss their main contributions, and provide
exemplary ecosystems. Our work provides aspiring ecosystem providers with the
reusable knowledge of existing ecosystems and helps them to take more informed
architectural decisions and reduce risks in future.
author:
- first_name: Bahar
full_name: Jazayeri, Bahar
id: '36399'
last_name: Jazayeri
- first_name: Olaf
full_name: Zimmermann, Olaf
last_name: Zimmermann
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
- first_name: Jochen
full_name: Küster, Jochen
last_name: Küster
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
- first_name: Daniel
full_name: Szopinski, Daniel
id: '36372'
last_name: Szopinski
citation:
ama: 'Jazayeri B, Zimmermann O, Engels G, Küster J, Kundisch D, Szopinski D. Design
Options of Store-Oriented Software Ecosystems: An Investigation of Business Decisions.
In: Proceeding of International Symposium on Business Modeling and Software
Design. Vol 319. Lecture Notes in Business Information Processing (LNBIP).
Wien, Austria: Springer; 2018:390-400. doi:10.1007/978-3-319-94214-8_30'
apa: 'Jazayeri, B., Zimmermann, O., Engels, G., Küster, J., Kundisch, D., &
Szopinski, D. (2018). Design Options of Store-Oriented Software Ecosystems: An
Investigation of Business Decisions. In Proceeding of International Symposium
on Business Modeling and Software Design (Vol. 319, pp. 390–400). Wien, Austria:
Springer. https://doi.org/10.1007/978-3-319-94214-8_30'
bibtex: '@inproceedings{Jazayeri_Zimmermann_Engels_Küster_Kundisch_Szopinski_2018,
place={Wien, Austria}, series={Lecture Notes in Business Information Processing
(LNBIP)}, title={Design Options of Store-Oriented Software Ecosystems: An Investigation
of Business Decisions}, volume={319}, DOI={10.1007/978-3-319-94214-8_30},
booktitle={Proceeding of International Symposium on Business Modeling and Software
Design}, publisher={Springer}, author={Jazayeri, Bahar and Zimmermann, Olaf and
Engels, Gregor and Küster, Jochen and Kundisch, Dennis and Szopinski, Daniel},
year={2018}, pages={390–400}, collection={Lecture Notes in Business Information
Processing (LNBIP)} }'
chicago: 'Jazayeri, Bahar, Olaf Zimmermann, Gregor Engels, Jochen Küster, Dennis
Kundisch, and Daniel Szopinski. “Design Options of Store-Oriented Software Ecosystems:
An Investigation of Business Decisions.” In Proceeding of International Symposium
on Business Modeling and Software Design, 319:390–400. Lecture Notes in Business
Information Processing (LNBIP). Wien, Austria: Springer, 2018. https://doi.org/10.1007/978-3-319-94214-8_30.'
ieee: 'B. Jazayeri, O. Zimmermann, G. Engels, J. Küster, D. Kundisch, and D. Szopinski,
“Design Options of Store-Oriented Software Ecosystems: An Investigation of Business
Decisions,” in Proceeding of International Symposium on Business Modeling and
Software Design, 2018, vol. 319, pp. 390–400.'
mla: 'Jazayeri, Bahar, et al. “Design Options of Store-Oriented Software Ecosystems:
An Investigation of Business Decisions.” Proceeding of International Symposium
on Business Modeling and Software Design, vol. 319, Springer, 2018, pp. 390–400,
doi:10.1007/978-3-319-94214-8_30.'
short: 'B. Jazayeri, O. Zimmermann, G. Engels, J. Küster, D. Kundisch, D. Szopinski,
in: Proceeding of International Symposium on Business Modeling and Software Design,
Springer, Wien, Austria, 2018, pp. 390–400.'
date_created: 2018-07-12T10:59:16Z
date_updated: 2022-01-06T06:59:24Z
ddc:
- '040'
department:
- _id: '66'
- _id: '276'
doi: 10.1007/978-3-319-94214-8_30
file:
- access_level: closed
content_type: application/pdf
creator: bahareh
date_created: 2018-11-12T19:01:06Z
date_updated: 2018-11-12T19:01:06Z
file_id: '5533'
file_name: Jazayeri_BMSD2018.pdf
file_size: 408509
relation: main_file
success: 1
file_date_updated: 2018-11-12T19:01:06Z
has_accepted_license: '1'
intvolume: ' 319'
language:
- iso: eng
page: 390-400
place: Wien, Austria
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
publication: Proceeding of International Symposium on Business Modeling and Software
Design
publication_identifier:
isbn:
- '9783319942131'
- '9783319942148'
issn:
- 1865-1348
- 1865-1356
publication_status: published
publisher: Springer
series_title: Lecture Notes in Business Information Processing (LNBIP)
status: public
title: 'Design Options of Store-Oriented Software Ecosystems: An Investigation of
Business Decisions'
type: conference
user_id: '16205'
volume: 319
year: '2018'
...
---
_id: '3551'
author:
- first_name: Jürgen
full_name: König, Jürgen
id: '22358'
last_name: König
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: König J, Mäcker A, Meyer auf der Heide F, Riechers S. Scheduling with interjob
communication on parallel processors. Journal of Combinatorial Optimization.
2018;36(4):1356-1379. doi:10.1007/s10878-018-0325-3
apa: König, J., Mäcker, A., Meyer auf der Heide, F., & Riechers, S. (2018).
Scheduling with interjob communication on parallel processors. Journal of Combinatorial
Optimization, 36(4), 1356–1379. https://doi.org/10.1007/s10878-018-0325-3
bibtex: '@article{König_Mäcker_Meyer auf der Heide_Riechers_2018, title={Scheduling
with interjob communication on parallel processors}, volume={36}, DOI={10.1007/s10878-018-0325-3},
number={4}, journal={Journal of Combinatorial Optimization}, author={König, Jürgen
and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören},
year={2018}, pages={1356–1379} }'
chicago: 'König, Jürgen, Alexander Mäcker, Friedhelm Meyer auf der Heide, and Sören
Riechers. “Scheduling with Interjob Communication on Parallel Processors.” Journal
of Combinatorial Optimization 36, no. 4 (2018): 1356–79. https://doi.org/10.1007/s10878-018-0325-3.'
ieee: J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling
with interjob communication on parallel processors,” Journal of Combinatorial
Optimization, vol. 36, no. 4, pp. 1356–1379, 2018.
mla: König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.”
Journal of Combinatorial Optimization, vol. 36, no. 4, 2018, pp. 1356–79,
doi:10.1007/s10878-018-0325-3.
short: J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, Journal of Combinatorial
Optimization 36 (2018) 1356–1379.
date_created: 2018-07-13T09:57:48Z
date_updated: 2022-01-06T06:59:24Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/s10878-018-0325-3
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:20:24Z
date_updated: 2018-11-02T15:20:24Z
file_id: '5299'
file_name: SchedulingWithInterjobCommunic.pdf
file_size: 745708
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:20:24Z
has_accepted_license: '1'
intvolume: ' 36'
issue: '4'
language:
- iso: eng
page: 1356-1379
project:
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
publication: Journal of Combinatorial Optimization
status: public
title: Scheduling with interjob communication on parallel processors
type: journal_article
user_id: '477'
volume: 36
year: '2018'
...
---
_id: '2965'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Nils
full_name: Löken, Nils
id: '13703'
last_name: Löken
citation:
ama: 'Blömer J, Löken N. Cloud Architectures for Searchable Encryption. In: Proceedings
of the 13th International Conference on Availability, Reliability and Security,
ARES 2018. New York, NY, USA: ACM; :25:1--25:10. doi:10.1145/3230833.3230853'
apa: 'Blömer, J., & Löken, N. (n.d.). Cloud Architectures for Searchable Encryption.
In Proceedings of the 13th International Conference on Availability, Reliability
and Security, ARES 2018 (pp. 25:1--25:10). New York, NY, USA: ACM. https://doi.org/10.1145/3230833.3230853'
bibtex: '@inproceedings{Blömer_Löken, place={New York, NY, USA}, title={Cloud Architectures
for Searchable Encryption}, DOI={10.1145/3230833.3230853},
booktitle={Proceedings of the 13th International Conference on Availability, Reliability
and Security, ARES 2018}, publisher={ACM}, author={Blömer, Johannes and Löken,
Nils}, pages={25:1--25:10} }'
chicago: 'Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable
Encryption.” In Proceedings of the 13th International Conference on Availability,
Reliability and Security, ARES 2018, 25:1--25:10. New York, NY, USA: ACM,
n.d. https://doi.org/10.1145/3230833.3230853.'
ieee: J. Blömer and N. Löken, “Cloud Architectures for Searchable Encryption,” in
Proceedings of the 13th International Conference on Availability, Reliability
and Security, ARES 2018, Hamburg, Germany, pp. 25:1--25:10.
mla: Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable Encryption.”
Proceedings of the 13th International Conference on Availability, Reliability
and Security, ARES 2018, ACM, pp. 25:1--25:10, doi:10.1145/3230833.3230853.
short: 'J. Blömer, N. Löken, in: Proceedings of the 13th International Conference
on Availability, Reliability and Security, ARES 2018, ACM, New York, NY, USA,
n.d., pp. 25:1--25:10.'
conference:
location: Hamburg, Germany
name: ARES 2018
date_created: 2018-06-04T11:33:15Z
date_updated: 2022-01-06T06:58:49Z
ddc:
- '000'
department:
- _id: '64'
- _id: '568'
doi: 10.1145/3230833.3230853
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:39:46Z
date_updated: 2018-11-02T14:39:46Z
file_id: '5278'
file_name: a25-Blomer.pdf
file_size: 769807
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:39:46Z
has_accepted_license: '1'
language:
- iso: eng
page: 25:1--25:10
place: New York, NY, USA
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Proceedings of the 13th International Conference on Availability, Reliability
and Security, ARES 2018
publication_identifier:
isbn:
- 978-1-4503-6448-5
publication_status: accepted
publisher: ACM
quality_controlled: '1'
status: public
title: Cloud Architectures for Searchable Encryption
type: conference
user_id: '13703'
year: '2018'
...
---
_id: '3152'
abstract:
- lang: eng
text: To adapt to continuously changing workloads in networks, components of the
running network services may need to be replicated (scaling the network service)
and allocated to physical resources (placement) dynamically, also necessitating
dynamic re-routing of flows between service components. In this paper, we propose
JASPER, a fully automated approach to jointly optimizing scaling, placement, and
routing for complex network services, consisting of multiple (virtualized) components.
JASPER handles multiple network services that share the same substrate network;
services can be dynamically added or removed and dynamic workload changes are
handled. Our approach lets service designers specify their services on a high
level of abstraction using service templates. JASPER automatically makes scaling,
placement and routing decisions, enabling quick reaction to changes. We formalize
the problem, analyze its complexity, and develop two algorithms to solve it. Extensive
empirical results show the applicability and effectiveness of the proposed approach.
article_type: original
author:
- first_name: Sevil
full_name: Dräxler, Sevil
id: '31764'
last_name: Dräxler
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Zoltan Adam
full_name: Mann, Zoltan Adam
last_name: Mann
citation:
ama: 'Dräxler S, Karl H, Mann ZA. JASPER: Joint Optimization of Scaling, Placement,
and Routing of Virtual Network Services. IEEE Transactions on Network and Service
Management. 2018. doi:10.1109/TNSM.2018.2846572'
apa: 'Dräxler, S., Karl, H., & Mann, Z. A. (2018). JASPER: Joint Optimization
of Scaling, Placement, and Routing of Virtual Network Services. IEEE Transactions
on Network and Service Management. https://doi.org/10.1109/TNSM.2018.2846572'
bibtex: '@article{Dräxler_Karl_Mann_2018, title={JASPER: Joint Optimization of Scaling,
Placement, and Routing of Virtual Network Services}, DOI={10.1109/TNSM.2018.2846572},
journal={IEEE Transactions on Network and Service Management}, publisher={IEEE},
author={Dräxler, Sevil and Karl, Holger and Mann, Zoltan Adam}, year={2018} }'
chicago: 'Dräxler, Sevil, Holger Karl, and Zoltan Adam Mann. “JASPER: Joint Optimization
of Scaling, Placement, and Routing of Virtual Network Services.” IEEE Transactions
on Network and Service Management, 2018. https://doi.org/10.1109/TNSM.2018.2846572.'
ieee: 'S. Dräxler, H. Karl, and Z. A. Mann, “JASPER: Joint Optimization of Scaling,
Placement, and Routing of Virtual Network Services,” IEEE Transactions on Network
and Service Management, 2018.'
mla: 'Dräxler, Sevil, et al. “JASPER: Joint Optimization of Scaling, Placement,
and Routing of Virtual Network Services.” IEEE Transactions on Network and
Service Management, IEEE, 2018, doi:10.1109/TNSM.2018.2846572.'
short: S. Dräxler, H. Karl, Z.A. Mann, IEEE Transactions on Network and Service
Management (2018).
date_created: 2018-06-11T06:55:05Z
date_updated: 2022-01-06T06:59:00Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/TNSM.2018.2846572
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:25:49Z
date_updated: 2018-11-02T15:25:49Z
file_id: '5302'
file_name: 08382313.pdf
file_size: 1767054
relation: main_file
success: 1
- access_level: open_access
content_type: application/pdf
creator: sevilmeh
date_created: 2019-01-21T16:12:36Z
date_updated: 2019-01-21T16:12:36Z
file_id: '6950'
file_name: TNSM2846572_RIS.pdf
file_size: 2878350
relation: main_file
file_date_updated: 2019-01-21T16:12:36Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1711.10839
oa: '1'
project:
- _id: '23'
grant_number: '762057'
name: 5G Programmable Infrastructure Converging disaggregated neTwork and compUte
Resources
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: IEEE Transactions on Network and Service Management
publisher: IEEE
status: public
title: 'JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network
Services'
type: journal_article
urn: '31522'
user_id: '31764'
year: '2018'
...
---
_id: '1138'
author:
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
citation:
ama: Gmyr R. Distributed Algorithms for Overlay Networks and Programmable Matter.
Universität Paderborn; 2018. doi:10.17619/UNIPB/1-265
apa: Gmyr, R. (2018). Distributed Algorithms for Overlay Networks and Programmable
Matter. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-265
bibtex: '@book{Gmyr_2018, title={Distributed Algorithms for Overlay Networks and
Programmable Matter}, DOI={10.17619/UNIPB/1-265},
publisher={Universität Paderborn}, author={Gmyr, Robert}, year={2018} }'
chicago: Gmyr, Robert. Distributed Algorithms for Overlay Networks and Programmable
Matter. Universität Paderborn, 2018. https://doi.org/10.17619/UNIPB/1-265.
ieee: R. Gmyr, Distributed Algorithms for Overlay Networks and Programmable Matter.
Universität Paderborn, 2018.
mla: Gmyr, Robert. Distributed Algorithms for Overlay Networks and Programmable
Matter. Universität Paderborn, 2018, doi:10.17619/UNIPB/1-265.
short: R. Gmyr, Distributed Algorithms for Overlay Networks and Programmable Matter,
Universität Paderborn, 2018.
date_created: 2018-01-31T06:04:03Z
date_updated: 2022-01-06T06:51:00Z
department:
- _id: '79'
doi: 10.17619/UNIPB/1-265
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
- _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: Distributed Algorithms for Overlay Networks and Programmable Matter
type: dissertation
user_id: '477'
year: '2018'
...
---
_id: '2320'
author:
- first_name: Lars Christian
full_name: Funke, Lars Christian
last_name: Funke
citation:
ama: Funke LC. Eignungsbewertung eines Enterprise Architecture Frameworks für
das IT-Alignment zwischen Unternehmensstrategie und IT-Landschaft am Beispiel
der Arvato SCM. Universität Paderborn; 2018.
apa: Funke, L. C. (2018). Eignungsbewertung eines Enterprise Architecture Frameworks
für das IT-Alignment zwischen Unternehmensstrategie und IT-Landschaft am Beispiel
der Arvato SCM. Universität Paderborn.
bibtex: '@book{Funke_2018, place={Universität Paderborn}, title={Eignungsbewertung
eines Enterprise Architecture Frameworks für das IT-Alignment zwischen Unternehmensstrategie
und IT-Landschaft am Beispiel der Arvato SCM}, author={Funke, Lars Christian},
year={2018} }'
chicago: Funke, Lars Christian. Eignungsbewertung eines Enterprise Architecture
Frameworks für das IT-Alignment zwischen Unternehmensstrategie und IT-Landschaft
am Beispiel der Arvato SCM. Universität Paderborn, 2018.
ieee: L. C. Funke, Eignungsbewertung eines Enterprise Architecture Frameworks
für das IT-Alignment zwischen Unternehmensstrategie und IT-Landschaft am Beispiel
der Arvato SCM. Universität Paderborn, 2018.
mla: Funke, Lars Christian. Eignungsbewertung eines Enterprise Architecture Frameworks
für das IT-Alignment zwischen Unternehmensstrategie und IT-Landschaft am Beispiel
der Arvato SCM. 2018.
short: L.C. Funke, Eignungsbewertung eines Enterprise Architecture Frameworks für
das IT-Alignment zwischen Unternehmensstrategie und IT-Landschaft am Beispiel
der Arvato SCM, Universität Paderborn, 2018.
date_created: 2018-04-12T12:47:45Z
date_updated: 2022-01-06T06:55:47Z
language:
- iso: ger
place: Universität Paderborn
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
status: public
supervisor:
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
title: Eignungsbewertung eines Enterprise Architecture Frameworks für das IT-Alignment
zwischen Unternehmensstrategie und IT-Landschaft am Beispiel der Arvato SCM
type: mastersthesis
user_id: '16205'
year: '2018'
...
---
_id: '5820'
abstract:
- lang: eng
text: "In this paper, we investigate the use of trusted execution environments (TEEs,
such as Intel's SGX) for an anonymous communication infrastructure over untrusted
networks.\r\nFor this, we present the general idea of exploiting trusted execution
environments for the purpose of anonymous communication, including a continuous-time
security framework that models strong anonymity guarantees in the presence of
an adversary that observes all network traffic and can adaptively corrupt a constant
fraction of participating nodes.\r\nIn our framework, a participating node can
generate a number of unlinkable pseudonyms. Messages are sent from and to pseudonyms,
allowing both senders and receivers of messages to remain anonymous. We introduce
a concrete construction, which shows viability of our TEE-based approach to anonymous
communication. The construction draws from techniques from cryptography and overlay
networks. \r\nOur techniques are very general and can be used as a basis for future
constructions with similar goals."
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Jan
full_name: Bobolz, Jan
id: '27207'
last_name: Bobolz
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: Blömer J, Bobolz J, Scheideler C, Setzer A. Provably Anonymous Communication
Based on Trusted Execution Environments.
apa: Blömer, J., Bobolz, J., Scheideler, C., & Setzer, A. (n.d.). Provably
Anonymous Communication Based on Trusted Execution Environments.
bibtex: '@book{Blömer_Bobolz_Scheideler_Setzer, title={Provably Anonymous Communication
Based on Trusted Execution Environments}, author={Blömer, Johannes and Bobolz,
Jan and Scheideler, Christian and Setzer, Alexander} }'
chicago: Blömer, Johannes, Jan Bobolz, Christian Scheideler, and Alexander Setzer.
Provably Anonymous Communication Based on Trusted Execution Environments,
n.d.
ieee: J. Blömer, J. Bobolz, C. Scheideler, and A. Setzer, Provably Anonymous
Communication Based on Trusted Execution Environments. .
mla: Blömer, Johannes, et al. Provably Anonymous Communication Based on Trusted
Execution Environments.
short: J. Blömer, J. Bobolz, C. Scheideler, A. Setzer, Provably Anonymous Communication
Based on Trusted Execution Environments, n.d.
date_created: 2018-11-25T08:08:40Z
date_updated: 2022-01-06T07:02:43Z
ddc:
- '000'
department:
- _id: '7'
- _id: '64'
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: jbobolz
date_created: 2018-12-31T09:55:30Z
date_updated: 2018-12-31T09:55:30Z
file_id: '6435'
file_name: draft-2018.pdf
file_size: 470968
relation: main_file
success: 1
file_date_updated: 2018-12-31T09:55:30Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication_status: draft
status: public
title: Provably Anonymous Communication Based on Trusted Execution Environments
type: working_paper
user_id: '27207'
year: '2018'
...
---
_id: '5985'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Scheideler C. Relays: Towards a Link Layer for Robust and Secure Fog Computing.
In: Proceedings of the 2018 Workshop on Theory and Practice for Integrated
Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom,
July 27, 2018. ; 2018:1-2. doi:10.1145/3229774.3229781'
apa: 'Scheideler, C. (2018). Relays: Towards a Link Layer for Robust and Secure
Fog Computing. In Proceedings of the 2018 Workshop on Theory and Practice for
Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United
Kingdom, July 27, 2018 (pp. 1–2). https://doi.org/10.1145/3229774.3229781'
bibtex: '@inproceedings{Scheideler_2018, title={Relays: Towards a Link Layer for
Robust and Secure Fog Computing}, DOI={10.1145/3229774.3229781},
booktitle={Proceedings of the 2018 Workshop on Theory and Practice for Integrated
Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom,
July 27, 2018}, author={Scheideler, Christian}, year={2018}, pages={1–2} }'
chicago: 'Scheideler, Christian. “Relays: Towards a Link Layer for Robust and Secure
Fog Computing.” In Proceedings of the 2018 Workshop on Theory and Practice
for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham,
United Kingdom, July 27, 2018, 1–2, 2018. https://doi.org/10.1145/3229774.3229781.'
ieee: 'C. Scheideler, “Relays: Towards a Link Layer for Robust and Secure Fog Computing,”
in Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud,
Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July
27, 2018, 2018, pp. 1–2.'
mla: 'Scheideler, Christian. “Relays: Towards a Link Layer for Robust and Secure
Fog Computing.” Proceedings of the 2018 Workshop on Theory and Practice for
Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United
Kingdom, July 27, 2018, 2018, pp. 1–2, doi:10.1145/3229774.3229781.'
short: 'C. Scheideler, in: Proceedings of the 2018 Workshop on Theory and Practice
for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham,
United Kingdom, July 27, 2018, 2018, pp. 1–2.'
date_created: 2018-11-30T08:11:27Z
date_updated: 2022-01-06T07:02:49Z
ddc:
- '004'
department:
- _id: '79'
doi: 10.1145/3229774.3229781
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-12-12T15:12:02Z
date_updated: 2018-12-12T15:12:02Z
file_id: '6194'
file_name: p1-scheideler.pdf
file_size: 1420210
relation: main_file
file_date_updated: 2018-12-12T15:12:02Z
has_accepted_license: '1'
language:
- iso: eng
page: 1-2
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Proceedings of the 2018 Workshop on Theory and Practice for Integrated
Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom,
July 27, 2018
status: public
title: 'Relays: Towards a Link Layer for Robust and Secure Fog Computing'
type: conference
user_id: '477'
year: '2018'
...
---
_id: '6016'
author:
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Peuster M, Karl H. Understand your chains and keep your deadlines: Introducing
time-constrained profiling for NFV. In: IEEE/IFIP 14th International Conference
on Network and Service Management (CNSM). Rome: IEEE/IFIP.'
apa: 'Peuster, M., & Karl, H. (n.d.). Understand your chains and keep your deadlines:
Introducing time-constrained profiling for NFV. In IEEE/IFIP 14th International
Conference on Network and Service Management (CNSM). Rome: IEEE/IFIP.'
bibtex: '@inproceedings{Peuster_Karl, place={Rome}, title={Understand your chains
and keep your deadlines: Introducing time-constrained profiling for NFV}, booktitle={IEEE/IFIP
14th International Conference on Network and Service Management (CNSM)}, publisher={IEEE/IFIP},
author={Peuster, Manuel and Karl, Holger} }'
chicago: 'Peuster, Manuel, and Holger Karl. “Understand Your Chains and Keep Your
Deadlines: Introducing Time-Constrained Profiling for NFV.” In IEEE/IFIP 14th
International Conference on Network and Service Management (CNSM). Rome: IEEE/IFIP,
n.d.'
ieee: 'M. Peuster and H. Karl, “Understand your chains and keep your deadlines:
Introducing time-constrained profiling for NFV,” in IEEE/IFIP 14th International
Conference on Network and Service Management (CNSM), Rome.'
mla: 'Peuster, Manuel, and Holger Karl. “Understand Your Chains and Keep Your Deadlines:
Introducing Time-Constrained Profiling for NFV.” IEEE/IFIP 14th International
Conference on Network and Service Management (CNSM), IEEE/IFIP.'
short: 'M. Peuster, H. Karl, in: IEEE/IFIP 14th International Conference on Network
and Service Management (CNSM), IEEE/IFIP, Rome, n.d.'
conference:
end_date: 2018-11-09
location: Rome
name: IEEE/IFIP 14th International Conference on Network and Service Management
(CNSM)
start_date: 2018-11-05
date_created: 2018-12-06T12:06:14Z
date_updated: 2022-01-06T07:02:50Z
ddc:
- '000'
department:
- _id: '75'
file:
- access_level: open_access
content_type: application/pdf
creator: peuster
date_created: 2018-12-06T12:05:37Z
date_updated: 2018-12-06T12:05:37Z
file_id: '6017'
file_name: main_copy_for_ris.pdf
file_size: 961004
relation: main_file
file_date_updated: 2018-12-06T12:05:37Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/abstract/document/8584974
oa: '1'
place: Rome
project:
- _id: '28'
grant_number: '761493'
name: 5G Development and validation platform for global industry-specific network
services and Apps
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '15'
name: SFB 901 - Subproject C3
publication: IEEE/IFIP 14th International Conference on Network and Service Management
(CNSM)
publication_status: accepted
publisher: IEEE/IFIP
status: public
title: 'Understand your chains and keep your deadlines: Introducing time-constrained
profiling for NFV'
type: conference
user_id: '13271'
year: '2018'
...
---
_id: '63'
author:
- first_name: Ernst
full_name: Althaus, Ernst
last_name: Althaus
- first_name: Andre
full_name: Brinkmann, Andre
last_name: Brinkmann
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Lars
full_name: Nagel, Lars
last_name: Nagel
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: Jiri
full_name: Sgall, Jiri
last_name: Sgall
- first_name: Tim
full_name: Suess, Tim
last_name: Suess
citation:
ama: Althaus E, Brinkmann A, Kling P, et al. Scheduling Shared Continuous Resources
on Many-Cores. Journal of Scheduling. 2018;21(1):77-92. doi:10.1007/s10951-017-0518-0
apa: Althaus, E., Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L.,
Riechers, S., Sgall, J., & Suess, T. (2018). Scheduling Shared Continuous
Resources on Many-Cores. Journal of Scheduling, 21(1), 77–92. https://doi.org/10.1007/s10951-017-0518-0
bibtex: '@article{Althaus_Brinkmann_Kling_Meyer auf der Heide_Nagel_Riechers_Sgall_Suess_2018,
title={Scheduling Shared Continuous Resources on Many-Cores}, volume={21}, DOI={10.1007/s10951-017-0518-0},
number={1}, journal={Journal of Scheduling}, publisher={Springer}, author={Althaus,
Ernst and Brinkmann, Andre and Kling, Peter and Meyer auf der Heide, Friedhelm
and Nagel, Lars and Riechers, Sören and Sgall, Jiri and Suess, Tim}, year={2018},
pages={77–92} }'
chicago: 'Althaus, Ernst, Andre Brinkmann, Peter Kling, Friedhelm Meyer auf der
Heide, Lars Nagel, Sören Riechers, Jiri Sgall, and Tim Suess. “Scheduling Shared
Continuous Resources on Many-Cores.” Journal of Scheduling 21, no. 1 (2018):
77–92. https://doi.org/10.1007/s10951-017-0518-0.'
ieee: 'E. Althaus et al., “Scheduling Shared Continuous Resources on Many-Cores,”
Journal of Scheduling, vol. 21, no. 1, pp. 77–92, 2018, doi: 10.1007/s10951-017-0518-0.'
mla: Althaus, Ernst, et al. “Scheduling Shared Continuous Resources on Many-Cores.”
Journal of Scheduling, vol. 21, no. 1, Springer, 2018, pp. 77–92, doi:10.1007/s10951-017-0518-0.
short: E. Althaus, A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S.
Riechers, J. Sgall, T. Suess, Journal of Scheduling 21 (2018) 77–92.
date_created: 2017-10-17T12:41:03Z
date_updated: 2022-01-06T07:03:00Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/s10951-017-0518-0
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:16:59Z
date_updated: 2018-03-21T13:16:59Z
file_id: '1577'
file_name: 63-main_05.pdf
file_size: 466808
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:16:59Z
has_accepted_license: '1'
intvolume: ' 21'
issue: '1'
language:
- iso: eng
page: 77-92
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publication: Journal of Scheduling
publisher: Springer
status: public
title: Scheduling Shared Continuous Resources on Many-Cores
type: journal_article
user_id: '15415'
volume: 21
year: '2018'
...
---
_id: '4577'
author:
- first_name: Nicolai
full_name: Bohn, Nicolai
id: '10342'
last_name: Bohn
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
citation:
ama: 'Bohn N, Kundisch D. An Extended Perspective of Technology Pivots in Software
Startups: Towards a Theoretical Model. In: Proceedings of the 39th International
Conference on Information Systems (ICIS). ; 2018.'
apa: 'Bohn, N., & Kundisch, D. (2018). An Extended Perspective of Technology
Pivots in Software Startups: Towards a Theoretical Model. In Proceedings of
the 39th International Conference on Information Systems (ICIS). San Francisco,
USA.'
bibtex: '@inproceedings{Bohn_Kundisch_2018, title={An Extended Perspective of Technology
Pivots in Software Startups: Towards a Theoretical Model}, booktitle={Proceedings
of the 39th International Conference on Information Systems (ICIS)}, author={Bohn,
Nicolai and Kundisch, Dennis}, year={2018} }'
chicago: 'Bohn, Nicolai, and Dennis Kundisch. “An Extended Perspective of Technology
Pivots in Software Startups: Towards a Theoretical Model.” In Proceedings of
the 39th International Conference on Information Systems (ICIS), 2018.'
ieee: 'N. Bohn and D. Kundisch, “An Extended Perspective of Technology Pivots in
Software Startups: Towards a Theoretical Model,” in Proceedings of the 39th
International Conference on Information Systems (ICIS), San Francisco, USA,
2018.'
mla: 'Bohn, Nicolai, and Dennis Kundisch. “An Extended Perspective of Technology
Pivots in Software Startups: Towards a Theoretical Model.” Proceedings of the
39th International Conference on Information Systems (ICIS), 2018.'
short: 'N. Bohn, D. Kundisch, in: Proceedings of the 39th International Conference
on Information Systems (ICIS), 2018.'
conference:
location: San Francisco, USA
name: 39th International Conference on Information Systems (ICIS)
date_created: 2018-10-02T13:05:12Z
date_updated: 2022-01-06T07:01:13Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: abursig
date_created: 2018-12-03T15:17:56Z
date_updated: 2018-12-03T15:17:56Z
file_id: '5988'
file_name: An Extended Perspective of Technology Pivots in Software Startups.pdf
file_size: 808601
relation: main_file
success: 1
file_date_updated: 2018-12-03T15:17:56Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
publication: Proceedings of the 39th International Conference on Information Systems
(ICIS)
status: public
title: 'An Extended Perspective of Technology Pivots in Software Startups: Towards
a Theoretical Model'
type: conference
user_id: '16205'
year: '2018'
...
---
_id: '4373'
author:
- first_name: Daniel
full_name: Szopinski, Daniel
id: '36372'
last_name: Szopinski
citation:
ama: 'Szopinski D. Towards software-based tools for business model development:
Using external stimuli for business model idea generation. In: Bosch Business
Model Innovation Summit 2018. ; 2018.'
apa: 'Szopinski, D. (2018). Towards software-based tools for business model development:
Using external stimuli for business model idea generation. In Bosch Business
Model Innovation Summit 2018. Renningen, Germany.'
bibtex: '@inproceedings{Szopinski_2018, title={Towards software-based tools for
business model development: Using external stimuli for business model idea generation},
booktitle={Bosch Business Model Innovation Summit 2018}, author={Szopinski, Daniel},
year={2018} }'
chicago: 'Szopinski, Daniel. “Towards Software-Based Tools for Business Model Development:
Using External Stimuli for Business Model Idea Generation.” In Bosch Business
Model Innovation Summit 2018, 2018.'
ieee: 'D. Szopinski, “Towards software-based tools for business model development:
Using external stimuli for business model idea generation,” in Bosch Business
Model Innovation Summit 2018, Renningen, Germany, 2018.'
mla: 'Szopinski, Daniel. “Towards Software-Based Tools for Business Model Development:
Using External Stimuli for Business Model Idea Generation.” Bosch Business
Model Innovation Summit 2018, 2018.'
short: 'D. Szopinski, in: Bosch Business Model Innovation Summit 2018, 2018.'
conference:
location: Renningen, Germany
name: Bosch Business Model Innovation Summit 2018
date_created: 2018-09-10T12:26:14Z
date_updated: 2022-01-06T07:00:59Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: dsz
date_created: 2018-11-29T15:03:20Z
date_updated: 2018-11-29T15:03:20Z
file_id: '5982'
file_name: Bosch BMI Summit 2018.pdf
file_size: 1180782
relation: main_file
success: 1
file_date_updated: 2018-11-29T15:03:20Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
publication: Bosch Business Model Innovation Summit 2018
quality_controlled: '1'
status: public
title: 'Towards software-based tools for business model development: Using external
stimuli for business model idea generation'
type: conference_abstract
user_id: '477'
year: '2018'
...
---
_id: '5216'
abstract:
- lang: eng
text: A fundamental problem for overlay networks is to safely exclude leaving nodes,
i.e., the nodes requesting to leave the overlay network are excluded from it without
affecting its connectivity. To rigorously study self-stabilizing solutions to
this problem, the Finite Departure Problem (FDP) has been proposed [9]. In the
FDP we are given a network of processes in an arbitrary state, and the goal is
to eventually arrive at (and stay in) a state in which all leaving processes irrevocably
decided to leave the system while for all weakly-connected components in the initial
overlay network, all staying processes in that component will still form a weakly
connected component. In the standard interconnection model, the FDP is known to
be unsolvable by local control protocols, so oracles have been investigated that
allow the problem to be solved [9]. To avoid the use of oracles, we introduce
a new interconnection model based on relays. Despite the relay model appearing
to be rather restrictive, we show that it is universal, i.e., it is possible to
transform any weakly-connected topology into any other weakly-connected topology,
which is important for being a useful interconnection model for overlay networks.
Apart from this, our model allows processes to grant and revoke access rights,
which is why we believe it to be of interest beyond the scope of this paper. We
show how to implement the relay layer in a self-stabilizing way and identify properties
protocols need to satisfy so that the relay layer can recover while serving protocol
requests.
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: 'Scheideler C, Setzer A. Relays: A New Approach for the Finite Departure Problem
in Overlay Networks. In: Proceedings of the 20th International Symposium on
Stabilization, Safety, and Security of Distributed Systems (SSS 2018). ; 2018.
doi:10.1007/978-3-030-03232-6_16'
apa: 'Scheideler, C., & Setzer, A. (2018). Relays: A New Approach for the Finite
Departure Problem in Overlay Networks. In Proceedings of the 20th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018).
Tokyo, Japan. https://doi.org/10.1007/978-3-030-03232-6_16'
bibtex: '@inproceedings{Scheideler_Setzer_2018, title={Relays: A New Approach for
the Finite Departure Problem in Overlay Networks}, DOI={10.1007/978-3-030-03232-6_16},
booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS 2018)}, author={Scheideler, Christian
and Setzer, Alexander}, year={2018} }'
chicago: 'Scheideler, Christian, and Alexander Setzer. “Relays: A New Approach for
the Finite Departure Problem in Overlay Networks.” In Proceedings of the 20th
International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS 2018), 2018. https://doi.org/10.1007/978-3-030-03232-6_16.'
ieee: 'C. Scheideler and A. Setzer, “Relays: A New Approach for the Finite Departure
Problem in Overlay Networks,” in Proceedings of the 20th International Symposium
on Stabilization, Safety, and Security of Distributed Systems (SSS 2018),
Tokyo, Japan, 2018.'
mla: 'Scheideler, Christian, and Alexander Setzer. “Relays: A New Approach for the
Finite Departure Problem in Overlay Networks.” Proceedings of the 20th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018),
2018, doi:10.1007/978-3-030-03232-6_16.'
short: 'C. Scheideler, A. Setzer, in: Proceedings of the 20th International Symposium
on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 2018.'
conference:
location: Tokyo, Japan
name: 20th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS 2018)
date_created: 2018-10-31T13:33:05Z
date_updated: 2022-01-06T07:01:47Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-030-03232-6_16
file:
- access_level: closed
content_type: application/pdf
creator: asetzer
date_created: 2018-10-31T15:51:45Z
date_updated: 2018-10-31T16:09:48Z
file_id: '5223'
file_name: Scheideler-Setzer2018_Chapter_RelaysANewApproachForTheFinite.pdf
file_size: 369818
relation: main_file
file_date_updated: 2018-10-31T16:09:48Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS 2018)
publication_status: published
status: public
title: 'Relays: A New Approach for the Finite Departure Problem in Overlay Networks'
type: conference
user_id: '11108'
year: '2018'
...
---
_id: '5414'
author:
- first_name: Tasneem
full_name: Filmwala, Tasneem
last_name: Filmwala
citation:
ama: Filmwala T. Study Effects of Approximation on Conjugate Gradient Algorithm
and Accelerate It on FPGA Platform. Universität Paderborn; 2018.
apa: Filmwala, T. (2018). Study Effects of Approximation on Conjugate Gradient
Algorithm and Accelerate it on FPGA Platform. Universität Paderborn.
bibtex: '@book{Filmwala_2018, title={Study Effects of Approximation on Conjugate
Gradient Algorithm and Accelerate it on FPGA Platform}, publisher={Universität
Paderborn}, author={Filmwala, Tasneem}, year={2018} }'
chicago: Filmwala, Tasneem. Study Effects of Approximation on Conjugate Gradient
Algorithm and Accelerate It on FPGA Platform. Universität Paderborn, 2018.
ieee: T. Filmwala, Study Effects of Approximation on Conjugate Gradient Algorithm
and Accelerate it on FPGA Platform. Universität Paderborn, 2018.
mla: Filmwala, Tasneem. Study Effects of Approximation on Conjugate Gradient
Algorithm and Accelerate It on FPGA Platform. Universität Paderborn, 2018.
short: T. Filmwala, Study Effects of Approximation on Conjugate Gradient Algorithm
and Accelerate It on FPGA Platform, Universität Paderborn, 2018.
date_created: 2018-11-07T15:14:26Z
date_updated: 2022-01-06T07:01:52Z
department:
- _id: '27'
- _id: '518'
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: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
title: Study Effects of Approximation on Conjugate Gradient Algorithm and Accelerate
it on FPGA Platform
type: mastersthesis
user_id: '477'
year: '2018'
...
---
_id: '5421'
author:
- first_name: Onkar
full_name: Gadewar, Onkar
last_name: Gadewar
citation:
ama: Gadewar O. Programmable Programs? - Designing FPGA Overlay Architectures
with OpenCL. Universität Paderborn; 2018.
apa: Gadewar, O. (2018). Programmable Programs? - Designing FPGA Overlay Architectures
with OpenCL. Universität Paderborn.
bibtex: '@book{Gadewar_2018, title={Programmable Programs? - Designing FPGA Overlay
Architectures with OpenCL}, publisher={Universität Paderborn}, author={Gadewar,
Onkar}, year={2018} }'
chicago: Gadewar, Onkar. Programmable Programs? - Designing FPGA Overlay Architectures
with OpenCL. Universität Paderborn, 2018.
ieee: O. Gadewar, Programmable Programs? - Designing FPGA Overlay Architectures
with OpenCL. Universität Paderborn, 2018.
mla: Gadewar, Onkar. Programmable Programs? - Designing FPGA Overlay Architectures
with OpenCL. Universität Paderborn, 2018.
short: O. Gadewar, Programmable Programs? - Designing FPGA Overlay Architectures
with OpenCL, Universität Paderborn, 2018.
date_created: 2018-11-07T16:16:56Z
date_updated: 2022-01-06T07:01:53Z
department:
- _id: '27'
- _id: '518'
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: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
title: Programmable Programs? - Designing FPGA Overlay Architectures with OpenCL
type: mastersthesis
user_id: '477'
year: '2018'
...
---
_id: '5530'
abstract:
- lang: eng
text: Software companies nowadays create ecosystems of users and third-party providers
around their platforms. They often provide online stores so that the third-party
developments can be exposed to users directly. The resulting ecosystems differ
significantly from each other in their architectural designs because their providers
differ in terms of business goals and contexts. Until now, this architectural
diversity and rationale behind it are not well-understood. Therefore, it is not
clear which software features contribute to ecosystem’s success with respect to
certain business goals and context. This hinders systematic creation of ecosystems
in the future. Thus, decision-making becomes too risky; for future ecosystem providers,
which may lead to creation of inefficient ecosystems that lack critical features,
and for third-party providers to rely on ad-hoc choices while deciding on suitability
of an ecosystem for their future career. In this paper, we introduce three design
patterns for store- oriented software ecosystems by classifying the design decisions,
business goals, and context of 111 store-oriented software ecosystems. Each design
pattern provides an architectural solution to achieve a different business goal
while supporting a different context. We discuss how the design patterns are applied
together in order to achieve more business goals. Our work supports ecosystem
and third-party providers by sharing practice-proven architectural solutions,
helping them to take informed architectural decisions and reduce technical risks.
author:
- first_name: Bahar
full_name: Jazayeri, Bahar
id: '36399'
last_name: Jazayeri
- first_name: Olaf
full_name: Zimmermann, Olaf
last_name: Zimmermann
- first_name: Jochen
full_name: Küster, Jochen
last_name: Küster
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
- first_name: Daniel
full_name: Szopinski, Daniel
id: '36372'
last_name: Szopinski
citation:
ama: 'Jazayeri B, Zimmermann O, Küster J, Engels G, Kundisch D, Szopinski D. Patterns
of Store-oriented Software Ecosystems: Detection, Classification, and Analysis
of Design Options. In: The Latin American Conference on Pattern Languages of
Programs (SLPLoP). To appear. Valparaíso, Chile: ACM. To appear; 2018.'
apa: 'Jazayeri, B., Zimmermann, O., Küster, J., Engels, G., Kundisch, D., &
Szopinski, D. (2018). Patterns of Store-oriented Software Ecosystems: Detection,
Classification, and Analysis of Design Options. In The Latin American Conference
on Pattern Languages of Programs (SLPLoP). Valparaíso, Chile: ACM. To appear.'
bibtex: '@inproceedings{Jazayeri_Zimmermann_Küster_Engels_Kundisch_Szopinski_2018,
place={Valparaíso, Chile}, series={To appear}, title={Patterns of Store-oriented
Software Ecosystems: Detection, Classification, and Analysis of Design Options},
booktitle={The Latin American Conference on Pattern Languages of Programs (SLPLoP)},
publisher={ACM. To appear}, author={Jazayeri, Bahar and Zimmermann, Olaf and Küster,
Jochen and Engels, Gregor and Kundisch, Dennis and Szopinski, Daniel}, year={2018},
collection={To appear} }'
chicago: 'Jazayeri, Bahar, Olaf Zimmermann, Jochen Küster, Gregor Engels, Dennis
Kundisch, and Daniel Szopinski. “Patterns of Store-Oriented Software Ecosystems:
Detection, Classification, and Analysis of Design Options.” In The Latin American
Conference on Pattern Languages of Programs (SLPLoP). To Appear. Valparaíso,
Chile: ACM. To appear, 2018.'
ieee: 'B. Jazayeri, O. Zimmermann, J. Küster, G. Engels, D. Kundisch, and D. Szopinski,
“Patterns of Store-oriented Software Ecosystems: Detection, Classification, and
Analysis of Design Options,” in The Latin American Conference on Pattern Languages
of Programs (SLPLoP), 2018.'
mla: 'Jazayeri, Bahar, et al. “Patterns of Store-Oriented Software Ecosystems: Detection,
Classification, and Analysis of Design Options.” The Latin American Conference
on Pattern Languages of Programs (SLPLoP), ACM. To appear, 2018.'
short: 'B. Jazayeri, O. Zimmermann, J. Küster, G. Engels, D. Kundisch, D. Szopinski,
in: The Latin American Conference on Pattern Languages of Programs (SLPLoP), ACM.
To appear, Valparaíso, Chile, 2018.'
conference:
end_date: 2018-11-23
start_date: 2018-11-20
date_created: 2018-11-12T16:02:14Z
date_updated: 2022-01-06T07:01:57Z
ddc:
- '000'
department:
- _id: '66'
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: bahareh
date_created: 2018-11-29T23:41:07Z
date_updated: 2018-11-29T23:41:07Z
file_id: '5983'
file_name: Jazayerietal-SLPLoP18.pdf
file_size: 514038
relation: main_file
success: 1
file_date_updated: 2018-11-29T23:41:07Z
has_accepted_license: '1'
language:
- iso: eng
place: Valparaíso, Chile
project:
- _id: '1'
name: SFB 901
- _id: '17'
name: SFB 901 - Subproject C5
- _id: '4'
name: SFB 901 - Project Area C
publication: The Latin American Conference on Pattern Languages of Programs (SLPLoP)
publisher: ACM. To appear
series_title: To appear
status: public
title: 'Patterns of Store-oriented Software Ecosystems: Detection, Classification,
and Analysis of Design Options'
type: conference
user_id: '36399'
year: '2018'
...
---
_id: '5547'
author:
- first_name: Achim
full_name: Lösch, Achim
id: '43646'
last_name: Lösch
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Lösch A, Platzner M. A Highly Accurate Energy Model for Task Execution on
Heterogeneous Compute Nodes. In: 2018 IEEE 29th International Conference on
Application-Specific Systems, Architectures and Processors (ASAP). IEEE; 2018.
doi:10.1109/asap.2018.8445098'
apa: 'Lösch, A., & Platzner, M. (2018). A Highly Accurate Energy Model for Task
Execution on Heterogeneous Compute Nodes. In 2018 IEEE 29th International Conference
on Application-specific Systems, Architectures and Processors (ASAP). Milan,
Italy: IEEE. https://doi.org/10.1109/asap.2018.8445098'
bibtex: '@inproceedings{Lösch_Platzner_2018, title={A Highly Accurate Energy Model
for Task Execution on Heterogeneous Compute Nodes}, DOI={10.1109/asap.2018.8445098},
booktitle={2018 IEEE 29th International Conference on Application-specific Systems,
Architectures and Processors (ASAP)}, publisher={IEEE}, author={Lösch, Achim and
Platzner, Marco}, year={2018} }'
chicago: Lösch, Achim, and Marco Platzner. “A Highly Accurate Energy Model for Task
Execution on Heterogeneous Compute Nodes.” In 2018 IEEE 29th International
Conference on Application-Specific Systems, Architectures and Processors (ASAP).
IEEE, 2018. https://doi.org/10.1109/asap.2018.8445098.
ieee: A. Lösch and M. Platzner, “A Highly Accurate Energy Model for Task Execution
on Heterogeneous Compute Nodes,” in 2018 IEEE 29th International Conference
on Application-specific Systems, Architectures and Processors (ASAP), Milan,
Italy, 2018.
mla: Lösch, Achim, and Marco Platzner. “A Highly Accurate Energy Model for Task
Execution on Heterogeneous Compute Nodes.” 2018 IEEE 29th International Conference
on Application-Specific Systems, Architectures and Processors (ASAP), IEEE,
2018, doi:10.1109/asap.2018.8445098.
short: 'A. Lösch, M. Platzner, in: 2018 IEEE 29th International Conference on Application-Specific
Systems, Architectures and Processors (ASAP), IEEE, 2018.'
conference:
end_date: 2018-07-12
location: Milan, Italy
name: The 29th Annual IEEE International Conference on Application-specific Systems,
Architectures and Processors
start_date: 2018-07-10
date_created: 2018-11-14T09:26:53Z
date_updated: 2022-01-06T07:01:59Z
ddc:
- '040'
department:
- _id: '78'
doi: 10.1109/asap.2018.8445098
file:
- access_level: closed
content_type: application/pdf
creator: aloesch
date_created: 2018-11-14T09:40:42Z
date_updated: 2018-11-14T09:40:42Z
file_id: '5552'
file_name: loesch_asap2018.pdf
file_size: 2464949
relation: main_file
success: 1
file_date_updated: 2018-11-14T09:40:42Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '4'
name: SFB 901 - Project Area C
- _id: '1'
name: SFB 901
publication: 2018 IEEE 29th International Conference on Application-specific Systems,
Architectures and Processors (ASAP)
publication_identifier:
isbn:
- '9781538674796'
publication_status: published
publisher: IEEE
status: public
title: A Highly Accurate Energy Model for Task Execution on Heterogeneous Compute
Nodes
type: conference
user_id: '43646'
year: '2018'
...