---
_id: '24'
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
citation:
ama: 'Kenter T, Plessl C. Microdisk Cavity FDTD Simulation on FPGA using OpenCL.
In: Proc. Workshop on Heterogeneous High-Performance Reconfigurable Computing
(H2RC). ; 2016.'
apa: Kenter, T., & Plessl, C. (2016). Microdisk Cavity FDTD Simulation on FPGA
using OpenCL. Proc. Workshop on Heterogeneous High-Performance Reconfigurable
Computing (H2RC).
bibtex: '@inproceedings{Kenter_Plessl_2016, title={Microdisk Cavity FDTD Simulation
on FPGA using OpenCL}, booktitle={Proc. Workshop on Heterogeneous High-performance
Reconfigurable Computing (H2RC)}, author={Kenter, Tobias and Plessl, Christian},
year={2016} }'
chicago: Kenter, Tobias, and Christian Plessl. “Microdisk Cavity FDTD Simulation
on FPGA Using OpenCL.” In Proc. Workshop on Heterogeneous High-Performance
Reconfigurable Computing (H2RC), 2016.
ieee: T. Kenter and C. Plessl, “Microdisk Cavity FDTD Simulation on FPGA using OpenCL,”
2016.
mla: Kenter, Tobias, and Christian Plessl. “Microdisk Cavity FDTD Simulation on
FPGA Using OpenCL.” Proc. Workshop on Heterogeneous High-Performance Reconfigurable
Computing (H2RC), 2016.
short: 'T. Kenter, C. Plessl, in: Proc. Workshop on Heterogeneous High-Performance
Reconfigurable Computing (H2RC), 2016.'
date_created: 2017-07-26T15:00:43Z
date_updated: 2023-09-26T13:26:17Z
ddc:
- '004'
department:
- _id: '27'
- _id: '518'
file:
- access_level: closed
content_type: application/pdf
creator: kenter
date_created: 2018-11-14T12:38:45Z
date_updated: 2018-11-14T12:38:45Z
file_id: '5602'
file_name: paper_26.pdf
file_size: 129552
relation: main_file
success: 1
file_date_updated: 2018-11-14T12:38:45Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '32'
grant_number: PL 595/2-1 / 320898746
name: Performance and Efficiency in HPC with Custom Computing
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '14'
grant_number: '160364472'
name: SFB 901 - Subproject C2
publication: Proc. Workshop on Heterogeneous High-performance Reconfigurable Computing
(H2RC)
quality_controlled: '1'
status: public
title: Microdisk Cavity FDTD Simulation on FPGA using OpenCL
type: conference
user_id: '15278'
year: '2016'
...
---
_id: '138'
abstract:
- lang: eng
text: Hardware accelerators are becoming popular in academia and industry. To move
one step further from the state-of-the-art multicore plus accelerator approaches,
we present in this paper our innovative SAVEHSA architecture. It comprises of
a heterogeneous hardware platform with three different high-end accelerators attached
over PCIe (GPGPU, FPGA and Intel MIC). Such systems can process parallel workloads
very efficiently whilst being more energy efficient than regular CPU systems.
To leverage the heterogeneity, the workload has to be distributed among the computing
units in a way that each unit is well-suited for the assigned task and executable
code must be available. To tackle this problem we present two software components;
the first can perform resource allocation at runtime while respecting system and
application goals (in terms of throughput, energy, latency, etc.) and the second
is able to analyze an application and generate executable code for an accelerator
at runtime. We demonstrate the first proof-of-concept implementation of our framework
on the heterogeneous platform, discuss different runtime policies and measure
the introduced overheads.
author:
- first_name: Heinrich
full_name: Riebler, Heinrich
id: '8961'
last_name: Riebler
- first_name: Gavin Francis
full_name: Vaz, Gavin Francis
id: '30332'
last_name: Vaz
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: 'Ettore M. G. '
full_name: 'Trainiti, Ettore M. G. '
last_name: Trainiti
- first_name: Gianluca C.
full_name: Durelli, Gianluca C.
last_name: Durelli
- first_name: Emanuele
full_name: Del Sozzo, Emanuele
last_name: Del Sozzo
- first_name: 'Marco D. '
full_name: 'Santambrogio, Marco D. '
last_name: Santambrogio
- first_name: Christina
full_name: Bolchini, Christina
last_name: Bolchini
citation:
ama: 'Riebler H, Vaz GF, Plessl C, et al. Using Just-in-Time Code Generation for
Transparent Resource Management in Heterogeneous Systems. In: Proceedings of
International Forum on Research and Technologies for Society and Industry (RTSI).
IEEE; 2016:1-5. doi:10.1109/RTSI.2016.7740545'
apa: Riebler, H., Vaz, G. F., Plessl, C., Trainiti, E. M. G., Durelli, G. C., Del
Sozzo, E., Santambrogio, M. D., & Bolchini, C. (2016). Using Just-in-Time
Code Generation for Transparent Resource Management in Heterogeneous Systems.
Proceedings of International Forum on Research and Technologies for Society
and Industry (RTSI), 1–5. https://doi.org/10.1109/RTSI.2016.7740545
bibtex: '@inproceedings{Riebler_Vaz_Plessl_Trainiti_Durelli_Del Sozzo_Santambrogio_Bolchini_2016,
title={Using Just-in-Time Code Generation for Transparent Resource Management
in Heterogeneous Systems}, DOI={10.1109/RTSI.2016.7740545},
booktitle={Proceedings of International Forum on Research and Technologies for
Society and Industry (RTSI)}, publisher={IEEE}, author={Riebler, Heinrich and
Vaz, Gavin Francis and Plessl, Christian and Trainiti, Ettore M. G. and Durelli,
Gianluca C. and Del Sozzo, Emanuele and Santambrogio, Marco D. and Bolchini,
Christina}, year={2016}, pages={1–5} }'
chicago: Riebler, Heinrich, Gavin Francis Vaz, Christian Plessl, Ettore M. G. Trainiti,
Gianluca C. Durelli, Emanuele Del Sozzo, Marco D. Santambrogio, and Christina
Bolchini. “Using Just-in-Time Code Generation for Transparent Resource Management
in Heterogeneous Systems.” In Proceedings of International Forum on Research
and Technologies for Society and Industry (RTSI), 1–5. IEEE, 2016. https://doi.org/10.1109/RTSI.2016.7740545.
ieee: 'H. Riebler et al., “Using Just-in-Time Code Generation for Transparent
Resource Management in Heterogeneous Systems,” in Proceedings of International
Forum on Research and Technologies for Society and Industry (RTSI), 2016,
pp. 1–5, doi: 10.1109/RTSI.2016.7740545.'
mla: Riebler, Heinrich, et al. “Using Just-in-Time Code Generation for Transparent
Resource Management in Heterogeneous Systems.” Proceedings of International
Forum on Research and Technologies for Society and Industry (RTSI), IEEE,
2016, pp. 1–5, doi:10.1109/RTSI.2016.7740545.
short: 'H. Riebler, G.F. Vaz, C. Plessl, E.M.G. Trainiti, G.C. Durelli, E. Del Sozzo,
M.D. Santambrogio, C. Bolchini, in: Proceedings of International Forum on Research
and Technologies for Society and Industry (RTSI), IEEE, 2016, pp. 1–5.'
date_created: 2017-10-17T12:41:18Z
date_updated: 2023-09-26T13:28:11Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
doi: 10.1109/RTSI.2016.7740545
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:01:09Z
date_updated: 2018-03-21T13:01:09Z
file_id: '1560'
file_name: 138-07740545.pdf
file_size: 184334
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:01:09Z
has_accepted_license: '1'
language:
- iso: eng
page: 1-5
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: '34'
grant_number: '610996'
name: Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous
System Architectures
publication: Proceedings of International Forum on Research and Technologies for Society
and Industry (RTSI)
publisher: IEEE
quality_controlled: '1'
status: public
title: Using Just-in-Time Code Generation for Transparent Resource Management in Heterogeneous
Systems
type: conference
user_id: '15278'
year: '2016'
...
---
_id: '156'
abstract:
- lang: eng
text: Many modern compute nodes are heterogeneous multi-cores that integrate several
CPU cores with fixed function or reconfigurable hardware cores. Such systems need
to adapt task scheduling and mapping to optimise for performance and energy under
varying workloads and, increasingly important, for thermal and fault management
and are thus relevant targets for self-aware computing. In this chapter, we take
up the generic reference architecture for designing self-aware and self-expressive
computing systems and refine it for heterogeneous multi-cores. We present ReconOS,
an architecture, programming model and execution environment for heterogeneous
multi-cores, and show how the components of the reference architecture can be
implemented on top of ReconOS. In particular, the unique feature of dynamic partial
reconfiguration supports self-expression through starting and terminating reconfigurable
hardware cores. We detail a case study that runs two applications on an architecture
with one CPU and 12 reconfigurable hardware cores and present self-expression
strategies for adapting under performance, temperature and even conflicting constraints.
The case study demonstrates that the reference architecture as a model for self-aware
computing is highly useful as it allows us to structure and simplify the design
process, which will be essential for designing complex future compute nodes. Furthermore,
ReconOS is used as a base technology for flexible protocol stacks in Chapter 10,
an approach for self-aware computing at the networking level.
author:
- first_name: Andreas
full_name: Agne, Andreas
last_name: Agne
- first_name: Markus
full_name: Happe, Markus
last_name: Happe
- first_name: Achim
full_name: Lösch, Achim
id: '43646'
last_name: Lösch
- 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: 'Agne A, Happe M, Lösch A, Plessl C, Platzner M. Self-aware Compute Nodes.
In: Self-Aware Computing Systems. Natural Computing Series (NCS). Springer
International Publishing; 2016:145-165. doi:10.1007/978-3-319-39675-0_8'
apa: Agne, A., Happe, M., Lösch, A., Plessl, C., & Platzner, M. (2016). Self-aware
Compute Nodes. In Self-aware Computing Systems (pp. 145–165). Springer
International Publishing. https://doi.org/10.1007/978-3-319-39675-0_8
bibtex: '@inbook{Agne_Happe_Lösch_Plessl_Platzner_2016, place={Cham}, series={Natural
Computing Series (NCS)}, title={Self-aware Compute Nodes}, DOI={10.1007/978-3-319-39675-0_8},
booktitle={Self-aware Computing Systems}, publisher={Springer International Publishing},
author={Agne, Andreas and Happe, Markus and Lösch, Achim and Plessl, Christian
and Platzner, Marco}, year={2016}, pages={145–165}, collection={Natural Computing
Series (NCS)} }'
chicago: 'Agne, Andreas, Markus Happe, Achim Lösch, Christian Plessl, and Marco
Platzner. “Self-Aware Compute Nodes.” In Self-Aware Computing Systems,
145–65. Natural Computing Series (NCS). Cham: Springer International Publishing,
2016. https://doi.org/10.1007/978-3-319-39675-0_8.'
ieee: 'A. Agne, M. Happe, A. Lösch, C. Plessl, and M. Platzner, “Self-aware Compute
Nodes,” in Self-aware Computing Systems, Cham: Springer International Publishing,
2016, pp. 145–165.'
mla: Agne, Andreas, et al. “Self-Aware Compute Nodes.” Self-Aware Computing Systems,
Springer International Publishing, 2016, pp. 145–65, doi:10.1007/978-3-319-39675-0_8.
short: 'A. Agne, M. Happe, A. Lösch, C. Plessl, M. Platzner, in: Self-Aware Computing
Systems, Springer International Publishing, Cham, 2016, pp. 145–165.'
date_created: 2017-10-17T12:41:22Z
date_updated: 2023-09-26T13:27:44Z
ddc:
- '040'
department:
- _id: '518'
- _id: '27'
- _id: '78'
doi: 10.1007/978-3-319-39675-0_8
file:
- access_level: closed
content_type: application/pdf
creator: aloesch
date_created: 2018-11-14T13:20:32Z
date_updated: 2018-11-14T13:20:32Z
file_id: '5613'
file_name: chapter8.pdf
file_size: 833054
relation: main_file
success: 1
file_date_updated: 2018-11-14T13:20:32Z
has_accepted_license: '1'
language:
- iso: eng
page: 145-165
place: Cham
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: Self-aware Computing Systems
publisher: Springer International Publishing
quality_controlled: '1'
series_title: Natural Computing Series (NCS)
status: public
title: Self-aware Compute Nodes
type: book_chapter
user_id: '15278'
year: '2016'
...
---
_id: '165'
abstract:
- lang: eng
text: A broad spectrum of applications can be accelerated by offloading computation
intensive parts to reconfigurable hardware. However, to achieve speedups, the
number of loop it- erations (trip count) needs to be sufficiently large to amortize
offloading overheads. Trip counts are frequently not known at compile time, but
only at runtime just before entering a loop. Therefore, we propose to generate
code for both the CPU and the coprocessor, and defer the offloading decision to
the application runtime. We demonstrate how a toolflow, based on the LLVM compiler
framework, can automatically embed dynamic offloading de- cisions into the application
code. We perform in-depth static and dynamic analysis of pop- ular benchmarks,
which confirm the general potential of such an approach. We also pro- pose to
optimize the offloading process by decoupling the runtime decision from the loop
execution (decision slack). The feasibility of our approach is demonstrated by
a toolflow that automatically identifies suitable data-parallel loops and generates
code for the FPGA coprocessor of a Convey HC-1. We evaluate the integrated toolflow
with representative loops executed for different input data sizes.
author:
- first_name: Gavin Francis
full_name: Vaz, Gavin Francis
id: '30332'
last_name: Vaz
- first_name: Heinrich
full_name: Riebler, Heinrich
id: '8961'
last_name: Riebler
- 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: Vaz GF, Riebler H, Kenter T, Plessl C. Potential and Methods for Embedding
Dynamic Offloading Decisions into Application Code. Computers and Electrical
Engineering. 2016;55:91-111. doi:10.1016/j.compeleceng.2016.04.021
apa: Vaz, G. F., Riebler, H., Kenter, T., & Plessl, C. (2016). Potential and
Methods for Embedding Dynamic Offloading Decisions into Application Code. Computers
and Electrical Engineering, 55, 91–111. https://doi.org/10.1016/j.compeleceng.2016.04.021
bibtex: '@article{Vaz_Riebler_Kenter_Plessl_2016, title={Potential and Methods for
Embedding Dynamic Offloading Decisions into Application Code}, volume={55}, DOI={10.1016/j.compeleceng.2016.04.021},
journal={Computers and Electrical Engineering}, publisher={Elsevier}, author={Vaz,
Gavin Francis and Riebler, Heinrich and Kenter, Tobias and Plessl, Christian},
year={2016}, pages={91–111} }'
chicago: 'Vaz, Gavin Francis, Heinrich Riebler, Tobias Kenter, and Christian Plessl.
“Potential and Methods for Embedding Dynamic Offloading Decisions into Application
Code.” Computers and Electrical Engineering 55 (2016): 91–111. https://doi.org/10.1016/j.compeleceng.2016.04.021.'
ieee: 'G. F. Vaz, H. Riebler, T. Kenter, and C. Plessl, “Potential and Methods for
Embedding Dynamic Offloading Decisions into Application Code,” Computers and
Electrical Engineering, vol. 55, pp. 91–111, 2016, doi: 10.1016/j.compeleceng.2016.04.021.'
mla: Vaz, Gavin Francis, et al. “Potential and Methods for Embedding Dynamic Offloading
Decisions into Application Code.” Computers and Electrical Engineering,
vol. 55, Elsevier, 2016, pp. 91–111, doi:10.1016/j.compeleceng.2016.04.021.
short: G.F. Vaz, H. Riebler, T. Kenter, C. Plessl, Computers and Electrical Engineering
55 (2016) 91–111.
date_created: 2017-10-17T12:41:24Z
date_updated: 2023-09-26T13:26:38Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
doi: 10.1016/j.compeleceng.2016.04.021
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:45:47Z
date_updated: 2018-03-21T12:45:47Z
file_id: '1544'
file_name: 165-1-s2.0-S0045790616301021-main.pdf
file_size: 3037854
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:45:47Z
has_accepted_license: '1'
intvolume: ' 55'
language:
- iso: eng
page: 91-111
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: '34'
grant_number: '610996'
name: Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous
System Architectures
publication: Computers and Electrical Engineering
publication_identifier:
issn:
- 0045-7906
publisher: Elsevier
quality_controlled: '1'
status: public
title: Potential and Methods for Embedding Dynamic Offloading Decisions into Application
Code
type: journal_article
user_id: '15278'
volume: 55
year: '2016'
...
---
_id: '168'
abstract:
- lang: eng
text: The use of heterogeneous computing resources, such as Graphic Processing Units
or other specialized coprocessors, has become widespread in recent years because
of their per- formance and energy efficiency advantages. Approaches for managing
and scheduling tasks to heterogeneous resources are still subject to research.
Although queuing systems have recently been extended to support accelerator resources,
a general solution that manages heterogeneous resources at the operating system-
level to exploit a global view of the system state is still missing.In this paper
we present a user space scheduler that enables task scheduling and migration on
heterogeneous processing resources in Linux. Using run queues for available resources
we perform scheduling decisions based on the system state and on task characterization
from earlier measurements. With a pro- gramming pattern that supports the integration
of checkpoints into applications, we preempt tasks and migrate them between three
very different compute resources. Considering static and dynamic workload scenarios,
we show that this approach can gain up to 17% performance, on average 7%, by effectively
avoiding idle resources. We demonstrate that a work-conserving strategy without
migration is no suitable alternative.
author:
- first_name: Achim
full_name: Lösch, Achim
id: '43646'
last_name: Lösch
- first_name: Tobias
full_name: Beisel, Tobias
last_name: Beisel
- 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: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Lösch A, Beisel T, Kenter T, Plessl C, Platzner M. Performance-centric scheduling
with task migration for a heterogeneous compute node in the data center. In: Proceedings
of the 2016 Design, Automation & Test in Europe Conference & Exhibition
(DATE). EDA Consortium / IEEE; 2016:912-917.'
apa: Lösch, A., Beisel, T., Kenter, T., Plessl, C., & Platzner, M. (2016). Performance-centric
scheduling with task migration for a heterogeneous compute node in the data center.
Proceedings of the 2016 Design, Automation & Test in Europe Conference
& Exhibition (DATE), 912–917.
bibtex: '@inproceedings{Lösch_Beisel_Kenter_Plessl_Platzner_2016, title={Performance-centric
scheduling with task migration for a heterogeneous compute node in the data center},
booktitle={Proceedings of the 2016 Design, Automation & Test in Europe Conference
& Exhibition (DATE)}, publisher={EDA Consortium / IEEE}, author={Lösch, Achim
and Beisel, Tobias and Kenter, Tobias and Plessl, Christian and Platzner, Marco},
year={2016}, pages={912–917} }'
chicago: Lösch, Achim, Tobias Beisel, Tobias Kenter, Christian Plessl, and Marco
Platzner. “Performance-Centric Scheduling with Task Migration for a Heterogeneous
Compute Node in the Data Center.” In Proceedings of the 2016 Design, Automation
& Test in Europe Conference & Exhibition (DATE), 912–17. EDA Consortium
/ IEEE, 2016.
ieee: A. Lösch, T. Beisel, T. Kenter, C. Plessl, and M. Platzner, “Performance-centric
scheduling with task migration for a heterogeneous compute node in the data center,”
in Proceedings of the 2016 Design, Automation & Test in Europe Conference
& Exhibition (DATE), 2016, pp. 912–917.
mla: Lösch, Achim, et al. “Performance-Centric Scheduling with Task Migration for
a Heterogeneous Compute Node in the Data Center.” Proceedings of the 2016 Design,
Automation & Test in Europe Conference & Exhibition (DATE), EDA Consortium
/ IEEE, 2016, pp. 912–17.
short: 'A. Lösch, T. Beisel, T. Kenter, C. Plessl, M. Platzner, in: Proceedings
of the 2016 Design, Automation & Test in Europe Conference & Exhibition
(DATE), EDA Consortium / IEEE, 2016, pp. 912–917.'
date_created: 2017-10-17T12:41:24Z
date_updated: 2023-09-26T13:27:00Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
- _id: '78'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:41:55Z
date_updated: 2018-03-21T12:41:55Z
file_id: '1541'
file_name: 168-07459438.pdf
file_size: 261356
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:41:55Z
has_accepted_license: '1'
language:
- iso: eng
page: 912-917
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: '30'
grant_number: 01|H11004A
name: Enabling Heterogeneous Hardware Acceleration using Novel Programming and Scheduling
Models
publication: Proceedings of the 2016 Design, Automation & Test in Europe Conference
& Exhibition (DATE)
publisher: EDA Consortium / IEEE
quality_controlled: '1'
status: public
title: Performance-centric scheduling with task migration for a heterogeneous compute
node in the data center
type: conference
user_id: '15278'
year: '2016'
...
---
_id: '171'
author:
- first_name: Tobias
full_name: Kenter, Tobias
id: '3145'
last_name: Kenter
- first_name: Gavin Francis
full_name: Vaz, Gavin Francis
id: '30332'
last_name: Vaz
- first_name: Heinrich
full_name: Riebler, Heinrich
id: '8961'
last_name: Riebler
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: 'Kenter T, Vaz GF, Riebler H, Plessl C. Opportunities for deferring application
partitioning and accelerator synthesis to runtime (extended abstract). In: Workshop
on Reconfigurable Computing (WRC). ; 2016.'
apa: Kenter, T., Vaz, G. F., Riebler, H., & Plessl, C. (2016). Opportunities
for deferring application partitioning and accelerator synthesis to runtime (extended
abstract). Workshop on Reconfigurable Computing (WRC).
bibtex: '@inproceedings{Kenter_Vaz_Riebler_Plessl_2016, title={Opportunities for
deferring application partitioning and accelerator synthesis to runtime (extended
abstract)}, booktitle={Workshop on Reconfigurable Computing (WRC)}, author={Kenter,
Tobias and Vaz, Gavin Francis and Riebler, Heinrich and Plessl, Christian}, year={2016}
}'
chicago: Kenter, Tobias, Gavin Francis Vaz, Heinrich Riebler, and Christian Plessl.
“Opportunities for Deferring Application Partitioning and Accelerator Synthesis
to Runtime (Extended Abstract).” In Workshop on Reconfigurable Computing (WRC),
2016.
ieee: T. Kenter, G. F. Vaz, H. Riebler, and C. Plessl, “Opportunities for deferring
application partitioning and accelerator synthesis to runtime (extended abstract),”
2016.
mla: Kenter, Tobias, et al. “Opportunities for Deferring Application Partitioning
and Accelerator Synthesis to Runtime (Extended Abstract).” Workshop on Reconfigurable
Computing (WRC), 2016.
short: 'T. Kenter, G.F. Vaz, H. Riebler, C. Plessl, in: Workshop on Reconfigurable
Computing (WRC), 2016.'
date_created: 2017-10-17T12:41:25Z
date_updated: 2023-09-26T13:27:21Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:39:46Z
date_updated: 2018-03-21T12:39:46Z
file_id: '1538'
file_name: 171-plessl16_fpl_wrc.pdf
file_size: 54421
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:39:46Z
has_accepted_license: '1'
language:
- iso: eng
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: '34'
grant_number: '610996'
name: Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous
System Architectures
publication: Workshop on Reconfigurable Computing (WRC)
quality_controlled: '1'
status: public
title: Opportunities for deferring application partitioning and accelerator synthesis
to runtime (extended abstract)
type: conference
user_id: '15278'
year: '2016'
...
---
_id: '248'
author:
- first_name: Thomas
full_name: John, Thomas
id: '3952'
last_name: John
citation:
ama: 'John T. Supporting Business Model Idea Generation Through Machine-generated
Ideas - Towards a Design Theory. In: AIS SIGPRAG Pre-ICIS Workshop: Practice-Based
Design and Innovation of Digital Artifacts. ; 2015.'
apa: 'John, T. (2015). Supporting Business Model Idea Generation Through Machine-generated
Ideas - Towards a Design Theory. In AIS SIGPRAG Pre-ICIS Workshop: Practice-based
Design and Innovation of Digital Artifacts. Fort Worth, USA.'
bibtex: '@inproceedings{John_2015, title={Supporting Business Model Idea Generation
Through Machine-generated Ideas - Towards a Design Theory}, booktitle={AIS SIGPRAG
Pre-ICIS Workshop: Practice-based Design and Innovation of Digital Artifacts},
author={John, Thomas}, year={2015} }'
chicago: 'John, Thomas. “Supporting Business Model Idea Generation Through Machine-Generated
Ideas - Towards a Design Theory.” In AIS SIGPRAG Pre-ICIS Workshop: Practice-Based
Design and Innovation of Digital Artifacts, 2015.'
ieee: 'T. John, “Supporting Business Model Idea Generation Through Machine-generated
Ideas - Towards a Design Theory,” in AIS SIGPRAG Pre-ICIS Workshop: Practice-based
Design and Innovation of Digital Artifacts, Fort Worth, USA, 2015.'
mla: 'John, Thomas. “Supporting Business Model Idea Generation Through Machine-Generated
Ideas - Towards a Design Theory.” AIS SIGPRAG Pre-ICIS Workshop: Practice-Based
Design and Innovation of Digital Artifacts, 2015.'
short: 'T. John, in: AIS SIGPRAG Pre-ICIS Workshop: Practice-Based Design and Innovation
of Digital Artifacts, 2015.'
conference:
location: Fort Worth, USA
name: 'AIS SIGPRAG Pre-ICIS Workshop: Practice-based Design and Innovation of Digital
Artifacts'
date_created: 2017-10-17T12:41:40Z
date_updated: 2022-01-06T06:56:36Z
ddc:
- '000'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:13:37Z
date_updated: 2018-11-02T15:13:37Z
file_id: '5295'
file_name: John-Supporting-Business-Model-Idea-Generation.pdf
file_size: 652902
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:13:37Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: http://sigprag.net/workshop-programme/
project:
- _id: '1'
name: SFB 901
- _id: '17'
name: SFB 901 - Subprojekt C5
- _id: '4'
name: SFB 901 - Project Area C
publication: 'AIS SIGPRAG Pre-ICIS Workshop: Practice-based Design and Innovation
of Digital Artifacts'
status: public
title: Supporting Business Model Idea Generation Through Machine-generated Ideas -
Towards a Design Theory
type: conference_abstract
user_id: '477'
year: '2015'
...
---
_id: '249'
abstract:
- lang: eng
text: 'We analyze the stability of networks when two intermediaries strategically
form costly links to customers. We interpret these links as customer relationships
that enable trade to sell a product. Equilibrium prices and equilibrium quantities
on the output as well as on the input market are determined endogenously for a
given network of customer relationships. We investigate in how far the substitutability
of the intermediaries'' products and the costs of link formation influence the
intermediaries'' equilibrium profits and thus have an impact on the incentives
to strategically form relationships to customers. For networks with three customers
we characterize locally stable networks, in particular existence is guaranteed
for any degree of substitutability. Moreover for the special cases of perfect
complements, independent products and perfect substitutes, local stability coincides
with the stronger concept of Nash stability. Additionally, for networks with n
customers we analyze stability regions for selected networks and determine their
limits when n goes to infinity. It turns out that the shape of the stability regions
for those networks does not significantly change compared to a setting with a
small number of customers. '
author:
- first_name: Sonja
full_name: Brangewitz, Sonja
last_name: Brangewitz
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
- first_name: Philipp
full_name: Möhlmeier, Philipp
last_name: Möhlmeier
citation:
ama: Brangewitz S, Haake C-J, Möhlmeier P. Strategic Formation of Customer Relationship
Networks. Vol 91. Universität Paderborn; 2015.
apa: Brangewitz, S., Haake, C.-J., & Möhlmeier, P. (2015). Strategic Formation
of Customer Relationship Networks (Vol. 91). Universität Paderborn.
bibtex: '@book{Brangewitz_Haake_Möhlmeier_2015, series={Working Papers CIE}, title={Strategic
Formation of Customer Relationship Networks}, volume={91}, publisher={Universität
Paderborn}, author={Brangewitz, Sonja and Haake, Claus-Jochen and Möhlmeier, Philipp},
year={2015}, collection={Working Papers CIE} }'
chicago: Brangewitz, Sonja, Claus-Jochen Haake, and Philipp Möhlmeier. Strategic
Formation of Customer Relationship Networks. Vol. 91. Working Papers CIE.
Universität Paderborn, 2015.
ieee: S. Brangewitz, C.-J. Haake, and P. Möhlmeier, Strategic Formation of Customer
Relationship Networks, vol. 91. Universität Paderborn, 2015.
mla: Brangewitz, Sonja, et al. Strategic Formation of Customer Relationship Networks.
Vol. 91, Universität Paderborn, 2015.
short: S. Brangewitz, C.-J. Haake, P. Möhlmeier, Strategic Formation of Customer
Relationship Networks, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:40Z
date_updated: 2022-01-06T06:56:40Z
ddc:
- '040'
department:
- _id: '205'
- _id: '475'
file:
- access_level: closed
content_type: application/pdf
creator: cjhaake
date_created: 2018-08-09T09:10:34Z
date_updated: 2018-08-09T09:13:36Z
file_id: '3865'
file_name: WP - Strategic Formation of Customer Relationship Networks.pdf
file_size: 908865
relation: main_file
title: Strategic Formation of Customer Relationship Networks
file_date_updated: 2018-08-09T09:13:36Z
has_accepted_license: '1'
intvolume: ' 91'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
series_title: Working Papers CIE
status: public
title: Strategic Formation of Customer Relationship Networks
type: working_paper
urn: '2499'
user_id: '65453'
volume: 91
year: '2015'
...
---
_id: '250'
abstract:
- lang: eng
text: Before execution, users should formally validate the correctness of software
received from untrusted providers. To accelerate this validation, in the proof
carrying code (PCC) paradigm the provider delivers the software together with
a certificate, a formal proof of the software’s correctness. Thus, the user only
checks if the attached certificate shows correctness of the delivered software.Recently,
we introduced configurable program certification, a generic, PCC based framework
supporting various software analyses and safety properties. Evaluation of our
framework revealed that validation suffers from certificate reading. In this paper,
we present two orthogonal approaches which improve certificate validation, both
reducing the impact of certificate reading. The first approach reduces the certificate
size, storing information only if it cannot easily be recomputed. The second approach
partitions the certificate into independently checkable parts. The trick is to
read parts of the certificate while already checking read parts. Our experiments
show that validation highly benefits from our improvements.
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
citation:
ama: 'Jakobs M-C. Speed Up Configurable Certificate Validation by Certificate Reduction
and Partitioning. In: Proceedings of the 13th International Conference on Software
Engineering and Formal Methods (SEFM). LNCS. ; 2015:159--174. doi:10.1007/978-3-319-22969-0_12'
apa: Jakobs, M.-C. (2015). Speed Up Configurable Certificate Validation by Certificate
Reduction and Partitioning. In Proceedings of the 13th International Conference
on Software Engineering and Formal Methods (SEFM) (pp. 159--174). https://doi.org/10.1007/978-3-319-22969-0_12
bibtex: '@inproceedings{Jakobs_2015, series={LNCS}, title={Speed Up Configurable
Certificate Validation by Certificate Reduction and Partitioning}, DOI={10.1007/978-3-319-22969-0_12},
booktitle={Proceedings of the 13th International Conference on Software Engineering
and Formal Methods (SEFM)}, author={Jakobs, Marie-Christine}, year={2015}, pages={159--174},
collection={LNCS} }'
chicago: Jakobs, Marie-Christine. “Speed Up Configurable Certificate Validation
by Certificate Reduction and Partitioning.” In Proceedings of the 13th International
Conference on Software Engineering and Formal Methods (SEFM), 159--174. LNCS,
2015. https://doi.org/10.1007/978-3-319-22969-0_12.
ieee: M.-C. Jakobs, “Speed Up Configurable Certificate Validation by Certificate
Reduction and Partitioning,” in Proceedings of the 13th International Conference
on Software Engineering and Formal Methods (SEFM), 2015, pp. 159--174.
mla: Jakobs, Marie-Christine. “Speed Up Configurable Certificate Validation by Certificate
Reduction and Partitioning.” Proceedings of the 13th International Conference
on Software Engineering and Formal Methods (SEFM), 2015, pp. 159--174, doi:10.1007/978-3-319-22969-0_12.
short: 'M.-C. Jakobs, in: Proceedings of the 13th International Conference on Software
Engineering and Formal Methods (SEFM), 2015, pp. 159--174.'
date_created: 2017-10-17T12:41:40Z
date_updated: 2022-01-06T06:56:43Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-319-22969-0_12
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:45:15Z
date_updated: 2018-03-21T09:45:15Z
file_id: '1489'
file_name: 250-Jakobs2015.pdf
file_size: 724308
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:45:15Z
has_accepted_license: '1'
language:
- iso: eng
page: 159--174
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 13th International Conference on Software Engineering
and Formal Methods (SEFM)
series_title: LNCS
status: public
title: Speed Up Configurable Certificate Validation by Certificate Reduction and Partitioning
type: conference
user_id: '477'
year: '2015'
...
---
_id: '251'
author:
- first_name: Karlson
full_name: Pfannschmidt, Karlson
last_name: Pfannschmidt
citation:
ama: Pfannschmidt K. Solving the Aggregated Bandits Problem. Universität
Paderborn; 2015.
apa: Pfannschmidt, K. (2015). Solving the aggregated bandits problem. Universität
Paderborn.
bibtex: '@book{Pfannschmidt_2015, title={Solving the aggregated bandits problem},
publisher={Universität Paderborn}, author={Pfannschmidt, Karlson}, year={2015}
}'
chicago: Pfannschmidt, Karlson. Solving the Aggregated Bandits Problem. Universität
Paderborn, 2015.
ieee: K. Pfannschmidt, Solving the aggregated bandits problem. Universität
Paderborn, 2015.
mla: Pfannschmidt, Karlson. Solving the Aggregated Bandits Problem. Universität
Paderborn, 2015.
short: K. Pfannschmidt, Solving the Aggregated Bandits Problem, Universität Paderborn,
2015.
date_created: 2017-10-17T12:41:41Z
date_updated: 2022-01-06T06:56:50Z
department:
- _id: '63'
- _id: '541'
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Solving the aggregated bandits problem
type: mastersthesis
user_id: '14052'
year: '2015'
...
---
_id: '253'
abstract:
- lang: eng
text: Group signatures, introduced by Chaum and van Heyst [15], are an important
primitive in cryptography. In group signature schemes every group member can anonymously
sign messages on behalf of the group. In case of disputes a dedicated opening
manager is able to trace signatures - he can extract the identity of the producer
of a given signature. A formal model for static group signatures schemes and their
security is defined by Bellare, Micciancio, and Warinschi [4], the case of dynamic
groups is considered by Bellare, Shi, and Zhang [5]. Both models define group
signature schemes with a single opening manager. The main difference between these
models is that the number of group members in static schemes is fixed, while in
dynamic schemes group members can join the group over time.
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Jakob
full_name: Juhnke, Jakob
id: '48090'
last_name: Juhnke
- first_name: Nils
full_name: Löken, Nils
id: '13703'
last_name: Löken
citation:
ama: 'Blömer J, Juhnke J, Löken N. Short Group Signatures with Distributed Traceability.
In: Proceedings of the Sixth International Conference on Mathematical Aspects
of Computer and Information Sciences (MACIS). LNCS. ; 2015:166-180. doi:10.1007/978-3-319-32859-1_14'
apa: Blömer, J., Juhnke, J., & Löken, N. (2015). Short Group Signatures with
Distributed Traceability. In Proceedings of the Sixth International Conference
on Mathematical Aspects of Computer and Information Sciences (MACIS) (pp.
166–180). https://doi.org/10.1007/978-3-319-32859-1_14
bibtex: '@inproceedings{Blömer_Juhnke_Löken_2015, series={LNCS}, title={Short Group
Signatures with Distributed Traceability}, DOI={10.1007/978-3-319-32859-1_14},
booktitle={Proceedings of the Sixth International Conference on Mathematical Aspects
of Computer and Information Sciences (MACIS)}, author={Blömer, Johannes and Juhnke,
Jakob and Löken, Nils}, year={2015}, pages={166–180}, collection={LNCS} }'
chicago: Blömer, Johannes, Jakob Juhnke, and Nils Löken. “Short Group Signatures
with Distributed Traceability.” In Proceedings of the Sixth International Conference
on Mathematical Aspects of Computer and Information Sciences (MACIS), 166–80.
LNCS, 2015. https://doi.org/10.1007/978-3-319-32859-1_14.
ieee: J. Blömer, J. Juhnke, and N. Löken, “Short Group Signatures with Distributed
Traceability,” in Proceedings of the Sixth International Conference on Mathematical
Aspects of Computer and Information Sciences (MACIS), 2015, pp. 166–180.
mla: Blömer, Johannes, et al. “Short Group Signatures with Distributed Traceability.”
Proceedings of the Sixth International Conference on Mathematical Aspects of
Computer and Information Sciences (MACIS), 2015, pp. 166–80, doi:10.1007/978-3-319-32859-1_14.
short: 'J. Blömer, J. Juhnke, N. Löken, in: Proceedings of the Sixth International
Conference on Mathematical Aspects of Computer and Information Sciences (MACIS),
2015, pp. 166–180.'
date_created: 2017-10-17T12:41:41Z
date_updated: 2022-01-06T06:59:07Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1007/978-3-319-32859-1_14
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:08:23Z
date_updated: 2018-11-02T14:08:23Z
file_id: '5262'
file_name: ShortGroupSignaturesWithDistri.pdf
file_size: 262436
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:08:23Z
has_accepted_license: '1'
language:
- iso: eng
page: 166-180
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '44'
name: KogniHome - die mitdenkende Wohnung
publication: Proceedings of the Sixth International Conference on Mathematical Aspects
of Computer and Information Sciences (MACIS)
related_material:
record:
- id: '325'
relation: other
status: public
series_title: LNCS
status: public
title: Short Group Signatures with Distributed Traceability
type: conference
user_id: '13703'
year: '2015'
...
---
_id: '254'
abstract:
- lang: eng
text: We empirically investigate how hosts on Airbnb, a popular peer-to-peer website
for fee-based sharing of under-utilized space, adjust their prices once their
offering gets a visible star rating for the first time. We use data for over 14,000
offerings from Airbnb which we collected for New York City. Our findings indicate
that hosts whose offerings achieve star rating visibility significantly increase
their prices by an average of 2.69 € more than hosts with comparable offerings
who do not experience this rating visibility during the time of observation. Out
of all offerings who achieve rating visibility, we identify the upper quartile
of hosts to be the main driver of this price increase, whereas the first 75% percent
show only a marginal price reaction. These results can serve as a first step towards
understanding the motivation of people to provide assets to the sharing economy.
author:
- first_name: Dominik
full_name: Gutt, Dominik
id: '14368'
last_name: Gutt
- first_name: Philipp
full_name: Herrmann, Philipp
last_name: Herrmann
citation:
ama: 'Gutt D, Herrmann P. Sharing Means Caring? Hosts’ Price Reactions to Rating
Visibility. In: Proceedings of the 23rd European Conference on Information
Systems (ECIS), Münster. ; 2015.'
apa: Gutt, D., & Herrmann, P. (2015). Sharing Means Caring? Hosts’ Price Reactions
to Rating Visibility. In Proceedings of the 23rd European Conference on Information
Systems (ECIS), Münster. Münster, Germany.
bibtex: '@inproceedings{Gutt_Herrmann_2015, title={Sharing Means Caring? Hosts’
Price Reactions to Rating Visibility}, booktitle={Proceedings of the 23rd European
Conference on Information Systems (ECIS), Münster}, author={Gutt, Dominik and
Herrmann, Philipp}, year={2015} }'
chicago: Gutt, Dominik, and Philipp Herrmann. “Sharing Means Caring? Hosts’ Price
Reactions to Rating Visibility.” In Proceedings of the 23rd European Conference
on Information Systems (ECIS), Münster, 2015.
ieee: D. Gutt and P. Herrmann, “Sharing Means Caring? Hosts’ Price Reactions to
Rating Visibility,” in Proceedings of the 23rd European Conference on Information
Systems (ECIS), Münster, Münster, Germany, 2015.
mla: Gutt, Dominik, and Philipp Herrmann. “Sharing Means Caring? Hosts’ Price Reactions
to Rating Visibility.” Proceedings of the 23rd European Conference on Information
Systems (ECIS), Münster, 2015.
short: 'D. Gutt, P. Herrmann, in: Proceedings of the 23rd European Conference on
Information Systems (ECIS), Münster, 2015.'
conference:
location: Münster, Germany
name: 23rd European Conference on Information Systems (ECIS)
date_created: 2017-10-17T12:41:41Z
date_updated: 2022-01-06T06:57:03Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:43:15Z
date_updated: 2018-03-21T09:43:15Z
file_id: '1486'
file_name: 254-RIP_ECIS2015-Sharing_means_caring_2594_final.pdf
file_size: 707962
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:43:15Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '8'
name: SFB 901 - Subprojekt A4
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 23rd European Conference on Information Systems (ECIS),
Münster
status: public
title: Sharing Means Caring? Hosts' Price Reactions to Rating Visibility
type: conference
user_id: '16205'
year: '2015'
...
---
_id: '255'
author:
- first_name: Matthias
full_name: Trykacz, Matthias
last_name: Trykacz
citation:
ama: Trykacz M. Share Economy - Identifikation von konstituierenden Merkmalen
anhand einer vergleichenden Betrachtung von Geschäftsmodellen. Universität
Paderborn; 2015.
apa: Trykacz, M. (2015). Share Economy - Identifikation von konstituierenden
Merkmalen anhand einer vergleichenden Betrachtung von Geschäftsmodellen. Universität
Paderborn.
bibtex: '@book{Trykacz_2015, title={Share Economy - Identifikation von konstituierenden
Merkmalen anhand einer vergleichenden Betrachtung von Geschäftsmodellen}, publisher={Universität
Paderborn}, author={Trykacz, Matthias}, year={2015} }'
chicago: Trykacz, Matthias. Share Economy - Identifikation von konstituierenden
Merkmalen anhand einer vergleichenden Betrachtung von Geschäftsmodellen. Universität
Paderborn, 2015.
ieee: M. Trykacz, Share Economy - Identifikation von konstituierenden Merkmalen
anhand einer vergleichenden Betrachtung von Geschäftsmodellen. Universität
Paderborn, 2015.
mla: Trykacz, Matthias. Share Economy - Identifikation von konstituierenden Merkmalen
anhand einer vergleichenden Betrachtung von Geschäftsmodellen. Universität
Paderborn, 2015.
short: M. Trykacz, Share Economy - Identifikation von konstituierenden Merkmalen
anhand einer vergleichenden Betrachtung von Geschäftsmodellen, Universität Paderborn,
2015.
date_created: 2017-10-17T12:41:41Z
date_updated: 2022-01-06T06:57:06Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '8'
name: SFB 901 - Subprojekt A4
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Share Economy - Identifikation von konstituierenden Merkmalen anhand einer
vergleichenden Betrachtung von Geschäftsmodellen
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '256'
author:
- first_name: Finn
full_name: Zindler, Finn
last_name: Zindler
citation:
ama: Zindler F. Selektive Vertriebssysteme am Fallbeispiel der Adidas AG - eine
wettbewerbspolitische Beurteilung. Universität Paderborn; 2015.
apa: Zindler, F. (2015). Selektive Vertriebssysteme am Fallbeispiel der Adidas
AG - eine wettbewerbspolitische Beurteilung. Universität Paderborn.
bibtex: '@book{Zindler_2015, title={Selektive Vertriebssysteme am Fallbeispiel der
Adidas AG - eine wettbewerbspolitische Beurteilung}, publisher={Universität Paderborn},
author={Zindler, Finn}, year={2015} }'
chicago: Zindler, Finn. Selektive Vertriebssysteme am Fallbeispiel der Adidas
AG - eine wettbewerbspolitische Beurteilung. Universität Paderborn, 2015.
ieee: F. Zindler, Selektive Vertriebssysteme am Fallbeispiel der Adidas AG -
eine wettbewerbspolitische Beurteilung. Universität Paderborn, 2015.
mla: Zindler, Finn. Selektive Vertriebssysteme am Fallbeispiel der Adidas AG
- eine wettbewerbspolitische Beurteilung. Universität Paderborn, 2015.
short: F. Zindler, Selektive Vertriebssysteme am Fallbeispiel der Adidas AG - eine
wettbewerbspolitische Beurteilung, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:42Z
date_updated: 2022-01-06T06:57:07Z
department:
- _id: '280'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
title: Selektive Vertriebssysteme am Fallbeispiel der Adidas AG - eine wettbewerbspolitische
Beurteilung
type: bachelorsthesis
user_id: '42447'
year: '2015'
...
---
_id: '280'
abstract:
- lang: eng
text: The Collaborative Research Centre "On-The-Fly Computing" works on foundations
and principles for the vision of the Future Internet. It proposes the paradigm
of On-The-Fly Computing, which tackles emerging worldwide service markets. In
these markets, service providers trade software, platform, and infrastructure
as a service. Service requesters state requirements on services. To satisfy these
requirements, the new role of brokers, who are (human) actors building service
compositions on the fly, is introduced. Brokers have to specify service compositions
formally and comprehensively using a domain-specific language (DSL), and to use
service matching for the discovery of the constituent services available in the
market. The broker's choice of the DSL and matching approaches influences her
success of building compositions as distinctive properties of different service
markets play a significant role. In this paper, we propose a new approach of engineering
a situation-specific DSL by customizing a comprehensive, modular DSL and its matching
for given service market properties. This enables the broker to create market-specific
composition specifications and to perform market-specific service matching. As
a result, the broker builds service compositions satisfying the requester's requirements
more accurately. We evaluated the presented concepts using case studies in service
markets for tourism and university management.
author:
- first_name: Svetlana
full_name: Arifulina, Svetlana
last_name: Arifulina
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
- first_name: Wilhelm
full_name: Schäfer, Wilhelm
last_name: Schäfer
citation:
ama: 'Arifulina S, Platenius MC, Mohr F, Engels G, Schäfer W. Market-Specific Service
Compositions: Specification and Matching. In: Proceedings of the IEEE 11th
World Congress on Services (SERVICES), Visionary Track: Service Composition for
the Future Internet. ; 2015:333--340. doi:10.1109/SERVICES.2015.58'
apa: 'Arifulina, S., Platenius, M. C., Mohr, F., Engels, G., & Schäfer, W. (2015).
Market-Specific Service Compositions: Specification and Matching. In Proceedings
of the IEEE 11th World Congress on Services (SERVICES), Visionary Track: Service
Composition for the Future Internet (pp. 333--340). https://doi.org/10.1109/SERVICES.2015.58'
bibtex: '@inproceedings{Arifulina_Platenius_Mohr_Engels_Schäfer_2015, title={Market-Specific
Service Compositions: Specification and Matching}, DOI={10.1109/SERVICES.2015.58},
booktitle={Proceedings of the IEEE 11th World Congress on Services (SERVICES),
Visionary Track: Service Composition for the Future Internet}, author={Arifulina,
Svetlana and Platenius, Marie Christin and Mohr, Felix and Engels, Gregor and
Schäfer, Wilhelm}, year={2015}, pages={333--340} }'
chicago: 'Arifulina, Svetlana, Marie Christin Platenius, Felix Mohr, Gregor Engels,
and Wilhelm Schäfer. “Market-Specific Service Compositions: Specification and
Matching.” In Proceedings of the IEEE 11th World Congress on Services (SERVICES),
Visionary Track: Service Composition for the Future Internet, 333--340, 2015.
https://doi.org/10.1109/SERVICES.2015.58.'
ieee: 'S. Arifulina, M. C. Platenius, F. Mohr, G. Engels, and W. Schäfer, “Market-Specific
Service Compositions: Specification and Matching,” in Proceedings of the IEEE
11th World Congress on Services (SERVICES), Visionary Track: Service Composition
for the Future Internet, 2015, pp. 333--340.'
mla: 'Arifulina, Svetlana, et al. “Market-Specific Service Compositions: Specification
and Matching.” Proceedings of the IEEE 11th World Congress on Services (SERVICES),
Visionary Track: Service Composition for the Future Internet, 2015, pp. 333--340,
doi:10.1109/SERVICES.2015.58.'
short: 'S. Arifulina, M.C. Platenius, F. Mohr, G. Engels, W. Schäfer, in: Proceedings
of the IEEE 11th World Congress on Services (SERVICES), Visionary Track: Service
Composition for the Future Internet, 2015, pp. 333--340.'
date_created: 2017-10-17T12:41:46Z
date_updated: 2022-01-06T06:57:49Z
ddc:
- '040'
department:
- _id: '66'
- _id: '76'
- _id: '355'
doi: 10.1109/SERVICES.2015.58
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:26:04Z
date_updated: 2018-03-21T09:26:04Z
file_id: '1470'
file_name: 280-07196546.pdf
file_size: 234260
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:26:04Z
has_accepted_license: '1'
language:
- iso: eng
page: 333--340
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '10'
name: SFB 901 - Subproject B2
- _id: '3'
name: SFB 901 - Project Area B
publication: 'Proceedings of the IEEE 11th World Congress on Services (SERVICES),
Visionary Track: Service Composition for the Future Internet'
status: public
title: 'Market-Specific Service Compositions: Specification and Matching'
type: conference
user_id: '477'
year: '2015'
...
---
_id: '281'
author:
- first_name: Tobias
full_name: Rojahn, Tobias
last_name: Rojahn
citation:
ama: Rojahn T. Load Balancing for Range Queries in a Dimension Invariant Peer-to-Peer
Network. Universität Paderborn; 2015.
apa: Rojahn, T. (2015). Load Balancing for Range Queries in a Dimension Invariant
Peer-to-Peer Network. Universität Paderborn.
bibtex: '@book{Rojahn_2015, title={Load Balancing for Range Queries in a Dimension
Invariant Peer-to-Peer Network}, publisher={Universität Paderborn}, author={Rojahn,
Tobias}, year={2015} }'
chicago: Rojahn, Tobias. Load Balancing for Range Queries in a Dimension Invariant
Peer-to-Peer Network. Universität Paderborn, 2015.
ieee: T. Rojahn, Load Balancing for Range Queries in a Dimension Invariant Peer-to-Peer
Network. Universität Paderborn, 2015.
mla: Rojahn, Tobias. Load Balancing for Range Queries in a Dimension Invariant
Peer-to-Peer Network. Universität Paderborn, 2015.
short: T. Rojahn, Load Balancing for Range Queries in a Dimension Invariant Peer-to-Peer
Network, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:46Z
date_updated: 2022-01-06T06:57:51Z
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Load Balancing for Range Queries in a Dimension Invariant Peer-to-Peer Network
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '282'
author:
- first_name: Michelle
full_name: Kirsch, Michelle
last_name: Kirsch
citation:
ama: Kirsch M. Koordinierter Patentschutz in einer globalisierten Welt - Effizienz-
und Anreizwirkungen auf die Arzneimittelversorgung in Entwicklungsländern.
Universität Paderborn; 2015.
apa: Kirsch, M. (2015). Koordinierter Patentschutz in einer globalisierten Welt
- Effizienz- und Anreizwirkungen auf die Arzneimittelversorgung in Entwicklungsländern.
Universität Paderborn.
bibtex: '@book{Kirsch_2015, title={Koordinierter Patentschutz in einer globalisierten
Welt - Effizienz- und Anreizwirkungen auf die Arzneimittelversorgung in Entwicklungsländern},
publisher={Universität Paderborn}, author={Kirsch, Michelle}, year={2015} }'
chicago: Kirsch, Michelle. Koordinierter Patentschutz in einer globalisierten
Welt - Effizienz- und Anreizwirkungen auf die Arzneimittelversorgung in Entwicklungsländern.
Universität Paderborn, 2015.
ieee: M. Kirsch, Koordinierter Patentschutz in einer globalisierten Welt - Effizienz-
und Anreizwirkungen auf die Arzneimittelversorgung in Entwicklungsländern.
Universität Paderborn, 2015.
mla: Kirsch, Michelle. Koordinierter Patentschutz in einer globalisierten Welt
- Effizienz- und Anreizwirkungen auf die Arzneimittelversorgung in Entwicklungsländern.
Universität Paderborn, 2015.
short: M. Kirsch, Koordinierter Patentschutz in einer globalisierten Welt - Effizienz-
und Anreizwirkungen auf die Arzneimittelversorgung in Entwicklungsländern, Universität
Paderborn, 2015.
date_created: 2017-10-17T12:41:47Z
date_updated: 2022-01-06T06:57:53Z
department:
- _id: '280'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
title: Koordinierter Patentschutz in einer globalisierten Welt - Effizienz- und Anreizwirkungen
auf die Arzneimittelversorgung in Entwicklungsländern
type: bachelorsthesis
user_id: '42447'
year: '2015'
...
---
_id: '283'
abstract:
- lang: eng
text: Today, software verification is an established analysis method which can provide
high guarantees for software safety. However, the resources (time and/or memory)
for an exhaustive verification are not always available, and analysis then has
to resort to other techniques, like testing. Most often, the already achieved
partial verification results arediscarded in this case, and testing has to start
from scratch.In this paper, we propose a method for combining verification and
testing in which testing only needs to check the residual fraction of an uncompleted
verification. To this end, the partial results of a verification run are used
to construct a residual program (and residual assertions to be checked on it).
The residual program can afterwards be fed into standardtesting tools. The proposed
technique is sound modulo the soundness of the testing procedure. Experimental
results show that this combinedusage of verification and testing can significantly
reduce the effort for the subsequent testing.
author:
- first_name: Mike
full_name: Czech, Mike
last_name: Czech
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Czech M, Jakobs M-C, Wehrheim H. Just test what you cannot verify! In: Egyed
A, Schaefer I, eds. Fundamental Approaches to Software Engineering. Lecture
Notes in Computer Science. ; 2015:100-114. doi:10.1007/978-3-662-46675-9_7'
apa: Czech, M., Jakobs, M.-C., & Wehrheim, H. (2015). Just test what you cannot
verify! In A. Egyed & I. Schaefer (Eds.), Fundamental Approaches to Software
Engineering (pp. 100–114). https://doi.org/10.1007/978-3-662-46675-9_7
bibtex: '@inproceedings{Czech_Jakobs_Wehrheim_2015, series={Lecture Notes in Computer
Science}, title={Just test what you cannot verify!}, DOI={10.1007/978-3-662-46675-9_7},
booktitle={Fundamental Approaches to Software Engineering}, author={Czech, Mike
and Jakobs, Marie-Christine and Wehrheim, Heike}, editor={Egyed, Alexander and
Schaefer, InaEditors}, year={2015}, pages={100–114}, collection={Lecture Notes
in Computer Science} }'
chicago: Czech, Mike, Marie-Christine Jakobs, and Heike Wehrheim. “Just Test What
You Cannot Verify!” In Fundamental Approaches to Software Engineering,
edited by Alexander Egyed and Ina Schaefer, 100–114. Lecture Notes in Computer
Science, 2015. https://doi.org/10.1007/978-3-662-46675-9_7.
ieee: M. Czech, M.-C. Jakobs, and H. Wehrheim, “Just test what you cannot verify!,”
in Fundamental Approaches to Software Engineering, 2015, pp. 100–114.
mla: Czech, Mike, et al. “Just Test What You Cannot Verify!” Fundamental Approaches
to Software Engineering, edited by Alexander Egyed and Ina Schaefer, 2015,
pp. 100–14, doi:10.1007/978-3-662-46675-9_7.
short: 'M. Czech, M.-C. Jakobs, H. Wehrheim, in: A. Egyed, I. Schaefer (Eds.), Fundamental
Approaches to Software Engineering, 2015, pp. 100–114.'
date_created: 2017-10-17T12:41:47Z
date_updated: 2022-01-06T06:58:00Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-662-46675-9_7
editor:
- first_name: Alexander
full_name: Egyed, Alexander
last_name: Egyed
- first_name: Ina
full_name: Schaefer, Ina
last_name: Schaefer
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:25:36Z
date_updated: 2018-03-21T09:25:36Z
file_id: '1469'
file_name: 283-FASEsubmission38_01.pdf
file_size: 391253
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:25:36Z
has_accepted_license: '1'
language:
- iso: eng
page: 100-114
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Fundamental Approaches to Software Engineering
series_title: Lecture Notes in Computer Science
status: public
title: Just test what you cannot verify!
type: conference
user_id: '477'
year: '2015'
...
---
_id: '284'
abstract:
- lang: eng
text: In this work, we present the first scalable distributed information system,
that is, a system with low storage overhead, that is provably robust against denial-of-service
(DoS) attacks by a current insider. We allow a current insider to have complete
knowledge about the information system and to have the power to block any ϵ-fraction
of its servers by a DoS attack, where ϵ can be chosen up to a constant. The task
of the system is to serve any collection of lookup requests with at most one per
nonblocked server in an efficient way despite this attack. Previously, scalable
solutions were only known for DoS attacks of past insiders, where a past insider
only has complete knowledge about some past time point t0 of the information system.
Scheideler et al. [Awerbuch and Scheideler 2007; Baumgart et al. 2009] showed
that in this case, it is possible to design an information system so that any
information that was inserted or last updated after t0 is safe against a DoS attack.
But their constructions would not work at all for a current insider. The key idea
behind our IRIS system is to make extensive use of coding. More precisely, we
present two alternative distributed coding strategies with an at most logarithmic
storage overhead that can handle up to a constant fraction of blocked servers.
author:
- first_name: Martina
full_name: Eikel, Martina
last_name: Eikel
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Eikel M, Scheideler C. IRIS: A Robust Information System Against Insider DoS
Attacks. Transactions on Parallel Computing. 2015;(3):18:1--18:33. doi:10.1145/2809806'
apa: 'Eikel, M., & Scheideler, C. (2015). IRIS: A Robust Information System
Against Insider DoS Attacks. Transactions on Parallel Computing, (3), 18:1--18:33.
https://doi.org/10.1145/2809806'
bibtex: '@article{Eikel_Scheideler_2015, title={IRIS: A Robust Information System
Against Insider DoS Attacks}, DOI={10.1145/2809806},
number={3}, journal={Transactions on Parallel Computing}, publisher={ACM}, author={Eikel,
Martina and Scheideler, Christian}, year={2015}, pages={18:1--18:33} }'
chicago: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information
System Against Insider DoS Attacks.” Transactions on Parallel Computing,
no. 3 (2015): 18:1--18:33. https://doi.org/10.1145/2809806.'
ieee: 'M. Eikel and C. Scheideler, “IRIS: A Robust Information System Against Insider
DoS Attacks,” Transactions on Parallel Computing, no. 3, pp. 18:1--18:33,
2015.'
mla: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System
Against Insider DoS Attacks.” Transactions on Parallel Computing, no. 3,
ACM, 2015, pp. 18:1--18:33, doi:10.1145/2809806.'
short: M. Eikel, C. Scheideler, Transactions on Parallel Computing (2015) 18:1--18:33.
date_created: 2017-10-17T12:41:47Z
date_updated: 2022-01-06T06:58:03Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1145/2809806
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:25:04Z
date_updated: 2018-03-21T09:25:04Z
file_id: '1468'
file_name: 284-Eikel-Scheideler-ACM2015.pdf
file_size: 651726
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:25:04Z
has_accepted_license: '1'
issue: '3'
page: 18:1--18:33
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Transactions on Parallel Computing
publisher: ACM
status: public
title: 'IRIS: A Robust Information System Against Insider DoS Attacks'
type: journal_article
user_id: '477'
year: '2015'
...
---
_id: '285'
abstract:
- lang: eng
text: We propose an incremental workflow for the verification of parameterized systems
modeled as symmetric networks of timed automata. Starting with a small number
of timed automata in the network, a safety property is verified using IC3, a state-of-the-art
algorithm based on induction.The result of the verification, an inductive strengthening,
is reused proposing a candidate inductive strengthening for a larger network.If
the candidate is valid, our main theorem states that the safety property holds
for all sizes of the network of timed automata. Otherwise the number of automata
is increased and the next iteration is started with a new run of IC3.We propose
and thoroughly examine optimizations to our workflow, e.g. Feedback mechanisms
to speed up the run of IC3.
author:
- first_name: Tobias
full_name: Isenberg, Tobias
last_name: Isenberg
citation:
ama: 'Isenberg T. Incremental Inductive Verification of Parameterized Timed Systems.
In: Proceedings of the 15th International Conference on Application of Concurrency
to System Design (ACSD). ; 2015:1-9. doi:10.1109/ACSD.2015.13'
apa: Isenberg, T. (2015). Incremental Inductive Verification of Parameterized Timed
Systems. In Proceedings of the 15th International Conference on Application
of Concurrency to System Design (ACSD) (pp. 1–9). https://doi.org/10.1109/ACSD.2015.13
bibtex: '@inproceedings{Isenberg_2015, title={Incremental Inductive Verification
of Parameterized Timed Systems}, DOI={10.1109/ACSD.2015.13},
booktitle={Proceedings of the 15th International Conference on Application of
Concurrency to System Design (ACSD)}, author={Isenberg, Tobias}, year={2015},
pages={1–9} }'
chicago: Isenberg, Tobias. “Incremental Inductive Verification of Parameterized
Timed Systems.” In Proceedings of the 15th International Conference on Application
of Concurrency to System Design (ACSD), 1–9, 2015. https://doi.org/10.1109/ACSD.2015.13.
ieee: T. Isenberg, “Incremental Inductive Verification of Parameterized Timed Systems,”
in Proceedings of the 15th International Conference on Application of Concurrency
to System Design (ACSD), 2015, pp. 1–9.
mla: Isenberg, Tobias. “Incremental Inductive Verification of Parameterized Timed
Systems.” Proceedings of the 15th International Conference on Application of
Concurrency to System Design (ACSD), 2015, pp. 1–9, doi:10.1109/ACSD.2015.13.
short: 'T. Isenberg, in: Proceedings of the 15th International Conference on Application
of Concurrency to System Design (ACSD), 2015, pp. 1–9.'
date_created: 2017-10-17T12:41:47Z
date_updated: 2022-01-06T06:58:07Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1109/ACSD.2015.13
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:23:45Z
date_updated: 2018-03-21T09:23:45Z
file_id: '1466'
file_name: 285-07352419.pdf
file_size: 479808
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:23:45Z
has_accepted_license: '1'
language:
- iso: eng
page: '1-9 '
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 15th International Conference on Application of Concurrency
to System Design (ACSD)
status: public
title: Incremental Inductive Verification of Parameterized Timed Systems
type: conference
user_id: '477'
year: '2015'
...