@misc{3365, author = {{Schnuer, Jan-Philip}}, publisher = {{Universität Paderborn}}, title = {{{Static Scheduling Algorithms for Heterogeneous Compute Nodes}}}, year = {{2018}}, } @misc{3366, author = {{Croce, Marcel}}, publisher = {{Universität Paderborn}}, title = {{{Evaluation of OpenCL-based Compilation for FPGAs}}}, year = {{2018}}, } @inproceedings{3422, abstract = {{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. Our 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 = {{Robinson, Peter and Scheideler, Christian and Setzer, Alexander}}, booktitle = {{Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}}, isbn = {{978-1-4503-5799-9/18/07}}, keywords = {{distributed consensus, randomized algorithm, adaptive adversary, complexity lower bound}}, location = {{Wien}}, title = {{{Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary}}}, doi = {{10.1145/3210377.3210399}}, year = {{2018}}, } @inproceedings{3550, abstract = {{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 = {{Jazayeri, Bahar and Zimmermann, Olaf and Engels, Gregor and Küster, Jochen and Kundisch, Dennis and Szopinski, Daniel}}, booktitle = {{Proceeding of International Symposium on Business Modeling and Software Design}}, isbn = {{9783319942131}}, issn = {{1865-1348}}, pages = {{390--400}}, publisher = {{Springer}}, title = {{{Design Options of Store-Oriented Software Ecosystems: An Investigation of Business Decisions}}}, doi = {{10.1007/978-3-319-94214-8_30}}, volume = {{319}}, year = {{2018}}, } @article{3551, author = {{König, Jürgen and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören}}, journal = {{Journal of Combinatorial Optimization}}, number = {{4}}, pages = {{1356--1379}}, title = {{{Scheduling with interjob communication on parallel processors}}}, doi = {{10.1007/s10878-018-0325-3}}, volume = {{36}}, year = {{2018}}, } @inproceedings{2965, author = {{Blömer, Johannes and Löken, Nils}}, booktitle = {{Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018}}, isbn = {{978-1-4503-6448-5}}, location = {{Hamburg, Germany}}, pages = {{25:1----25:10}}, publisher = {{ACM}}, title = {{{Cloud Architectures for Searchable Encryption}}}, doi = {{10.1145/3230833.3230853}}, year = {{2018}}, } @article{3152, abstract = {{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.}}, author = {{Dräxler, Sevil and Karl, Holger and Mann, Zoltan Adam}}, journal = {{IEEE Transactions on Network and Service Management}}, publisher = {{IEEE}}, title = {{{JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services}}}, doi = {{10.1109/TNSM.2018.2846572}}, year = {{2018}}, } @phdthesis{1138, author = {{Gmyr, Robert}}, publisher = {{Universität Paderborn}}, title = {{{Distributed Algorithms for Overlay Networks and Programmable Matter}}}, doi = {{10.17619/UNIPB/1-265}}, year = {{2018}}, } @misc{2320, author = {{Funke, Lars Christian}}, title = {{{Eignungsbewertung eines Enterprise Architecture Frameworks für das IT-Alignment zwischen Unternehmensstrategie und IT-Landschaft am Beispiel der Arvato SCM}}}, year = {{2018}}, } @techreport{5820, abstract = {{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. For 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. In 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. Our techniques are very general and can be used as a basis for future constructions with similar goals.}}, author = {{Blömer, Johannes and Bobolz, Jan and Scheideler, Christian and Setzer, Alexander}}, title = {{{Provably Anonymous Communication Based on Trusted Execution Environments}}}, year = {{2018}}, } @inproceedings{5985, author = {{Scheideler, Christian}}, 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}}, pages = {{1--2}}, title = {{{Relays: Towards a Link Layer for Robust and Secure Fog Computing}}}, doi = {{10.1145/3229774.3229781}}, year = {{2018}}, } @inproceedings{6016, author = {{Peuster, Manuel and Karl, Holger}}, booktitle = {{IEEE/IFIP 14th International Conference on Network and Service Management (CNSM)}}, location = {{Rome}}, publisher = {{IEEE/IFIP}}, title = {{{Understand your chains and keep your deadlines: Introducing time-constrained profiling for NFV}}}, year = {{2018}}, } @article{63, 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}}, journal = {{Journal of Scheduling}}, number = {{1}}, pages = {{77--92}}, publisher = {{Springer}}, title = {{{Scheduling Shared Continuous Resources on Many-Cores}}}, doi = {{10.1007/s10951-017-0518-0}}, volume = {{21}}, year = {{2018}}, } @inproceedings{4577, author = {{Bohn, Nicolai and Kundisch, Dennis}}, booktitle = {{Proceedings of the 39th International Conference on Information Systems (ICIS)}}, location = {{San Francisco, USA}}, title = {{{An Extended Perspective of Technology Pivots in Software Startups: Towards a Theoretical Model}}}, year = {{2018}}, } @inproceedings{4373, author = {{Szopinski, Daniel}}, booktitle = {{Bosch Business Model Innovation Summit 2018}}, location = {{Renningen, Germany}}, title = {{{Towards software-based tools for business model development: Using external stimuli for business model idea generation}}}, year = {{2018}}, } @inproceedings{5216, abstract = {{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 = {{Scheideler, Christian and Setzer, Alexander}}, booktitle = {{Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)}}, location = {{Tokyo, Japan}}, title = {{{Relays: A New Approach for the Finite Departure Problem in Overlay Networks}}}, doi = {{10.1007/978-3-030-03232-6_16}}, year = {{2018}}, } @misc{5414, author = {{Filmwala, Tasneem}}, publisher = {{Universität Paderborn}}, title = {{{Study Effects of Approximation on Conjugate Gradient Algorithm and Accelerate it on FPGA Platform}}}, year = {{2018}}, } @misc{5421, author = {{Gadewar, Onkar}}, publisher = {{Universität Paderborn}}, title = {{{Programmable Programs? - Designing FPGA Overlay Architectures with OpenCL}}}, year = {{2018}}, } @inproceedings{5530, abstract = {{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 = {{Jazayeri, Bahar and Zimmermann, Olaf and Küster, Jochen and Engels, Gregor and Kundisch, Dennis and Szopinski, Daniel}}, booktitle = {{The Latin American Conference on Pattern Languages of Programs (SLPLoP)}}, publisher = {{ACM. To appear}}, title = {{{Patterns of Store-oriented Software Ecosystems: Detection, Classification, and Analysis of Design Options}}}, year = {{2018}}, } @inproceedings{5547, author = {{Lösch, Achim and Platzner, Marco}}, booktitle = {{2018 IEEE 29th International Conference on Application-specific Systems, Architectures and Processors (ASAP)}}, isbn = {{9781538674796}}, location = {{Milan, Italy}}, publisher = {{IEEE}}, title = {{{A Highly Accurate Energy Model for Task Execution on Heterogeneous Compute Nodes}}}, doi = {{10.1109/asap.2018.8445098}}, year = {{2018}}, }