TY - THES
AB - Handling run-time dynamics on embedded system-on-chip architectures has become more challenging over the years. On the one hand, the impact of workload and physical dynamics on the system behavior has dramatically increased. On the other hand, embedded architectures have become more complex as they have evolved from single-processor systems over multi-processor systems to hybrid multi-core platforms.Static design-time techniques no longer provide suitable solutions to deal with the run-time dynamics of today's embedded systems. Therefore, system designers have to apply run-time solutions, which have hardly been investigated for hybrid multi-core platforms.In this thesis, we present fundamental work in the new area of run-time management on hybrid multi-core platforms. We propose a novel architecture, a self-adaptive hybrid multi-core system, that combines heterogeneous processors, reconfigurable hardware cores, and monitoring cores on a single chip. Using self-adaptation on thread-level, our hybrid multi-core systems can effectively perform performance and thermal management autonomously at run-time.
AU - Happe, Markus
ID - 501
SN - 978-3-8325-3425-7
TI - Performance and thermal management on self-adaptive hybrid multi-cores
ER -
TY - JOUR
AU - Guo, Zhichao
AU - Feng, Yuanhua
ID - 4600
JF - Economic Modelling
SN - 0264-9993
TI - Modeling of the impact of the financial crisis and China's accession to WTO on China's exports to Germany
VL - 31
ER -
TY - CONF
AU - Gregor, Shirley
AU - Müller, Oliver
AU - Seidel, Stefan
ID - 4698
KW - Abstraction
KW - Affordances
KW - Design Science Research
KW - Design Theory
KW - Information Systems Development
KW - Reflection
KW - Theorizing
T2 - European Conference on Information Systems
TI - Reflection, abstraction and theorizing in design and development research
ER -
TY - GEN
AB - Suppose some individuals are allowed to engage in different groups at the same time and they generate a certain welfare by cooperation. Finding appropriate ways for distributing this welfare is a non-trivial issue. The purpose of this work is to analyze two-stage allocation procedures where first each group receives a share of the welfare which is then, subsequently, distributed among the corresponding members. To study these procedures in a structured way, cooperative games and network games are combined in a general framework by using mathematical hypergraphs. Moreover, several convincing requirements on allocation procedures are discussed and formalized. Thereby it will be shown, for example, that the Position Value and iteratively applying the Myerson Value can be characterized by similar axiomatizations.
AU - Röhl, Nils
ID - 474
TI - Two-Stage Allocation Procedures
ER -
TY - CONF
AB - Cloud computing offers high availability, dynamic scalability, and elasticity requiring only very little administration. However, this service comes with financial costs. Peer-to-peer systems, in contrast, operate at very low costs but cannot match the quality of service of the cloud. This paper focuses on the case study of Wikipedia and presents an approach to reduce the operational costs of hosting similar websites in the cloud by using a practical peer-to-peer approach. The visitors of the site are joining a Chord overlay, which acts as first cache for article lookups. Simulation results show, that up to 72% of the article lookups in Wikipedia could be answered by other visitors instead of using the cloud.
AU - Graffi, Kalman
AU - Bremer, Lars
ID - 481
T2 - Proceedings of the International Conference on Communications (ICC'13)
TI - Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case
ER -
TY - JOUR
AU - Haas, Alexander
AU - Eggert, Andreas
AU - Terho, Harri
AU - Ulaga, Wolfgang
ID - 4852
IS - 4
JF - Marketing Review St. Gallen
TI - Erfolgsfaktor Value-Based Selling—Verkaufen, wenn Kundenorientierung nicht zum Erfolg führt
ER -
TY - GEN
AU - Otte, Oliver
ID - 486
TI - Seitenkanalresistenz paarungsbasierter Kryptographie
ER -
TY - GEN
AU - Mir Djawadi, Behnud
AU - Fahr, Rene
ID - 4915
TI - The impact of risk perception and risk attitudes on corrupt behavior: Evidence from a petty corruption experiment
ER -
TY - GEN
AU - Terentjew, Artjom
ID - 493
TI - Reputationssysteme und Gerichtsverfahren als Wekzeuge zur Sicherstellung von Qualitätsstandards in Transaktionen
ER -
TY - CONF
AB - Dominating set based virtual backbones are used for rou-ting in wireless ad-hoc networks. Such backbones receive and transmit messages from/to every node in the network. Existing distributed algorithms only consider undirected graphs, which model symmetric networks with uniform transmission ranges. We are particularly interested in the well-established disk graphs, which model asymmetric networks with non-uniform transmission ranges. The corresponding graph theoretic problem seeks a strongly connected dominating-absorbent set of minimum cardinality in a digraph. A subset of nodes in a digraph is a strongly connected dominating-absorbent set if the subgraph induced by these nodes is strongly connected and each node in the graph is either in the set or has both an in-neighbor and an out-neighbor in it. We introduce the first distributed algorithm for this problem in disk graphs. The algorithm gives an O(k^4) -approximation ratio and has a runtime bound of O(Diam) where Diam is the diameter of the graph and k denotes the transmission ratio r_{max}/r_{min} with r_{max} and r_{min} being the maximum and minimum transmission range, respectively. Moreover, we apply our algorithm on the subgraph of disk graphs consisting of only bidirectional edges. Our algorithm gives an O(ln k) -approximation and a runtime bound of O(k^8 log^∗ n) , which, for bounded k , is an optimal approximation for the problem, following Lenzen and Wattenhofer’s Ω(log^∗ n) runtime lower bound for distributed constant approximation in disk graphs.
AU - Markarian, Christine
AU - Meyer auf der Heide, Friedhelm
AU - Schubert, Michael
ID - 563
T2 - Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS)
TI - A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks
ER -