TY - JOUR
AU - Bodenstein, Christian
AU - Schryen, Guido
AU - Neumann, Dirk
ID - 5688
IS - 1
JF - European Journal of Operational Research : EJOR
TI - Energy-Aware Workload Management Models for Operating Cost Reduction in Data Centers
VL - 222
ER -
TY - JOUR
AB - We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to achieve exact performance bounds. Tiara allows logarithmic searches and topology updates. It is based on a novel sparse 0-1 skip list. We then describe its extension to a ringed structure and to a skip-graph.Key words: Peer-to-peer networks, overlay networks, self-stabilization.
AU - Clouser, Thomas
AU - Nesterenko, Mikhail
AU - Scheideler, Christian
ID - 574
JF - Theoretical Computer Science
TI - Tiara: A self-stabilizing deterministic skip list and skip graph
ER -
TY - CONF
AU - Nagel, Benjamin
AU - Gerth, Christian
AU - Yigitbas, Enes
AU - Christ, Fabian
AU - Engels, Gregor
ID - 5753
T2 - Proceedings of the 1st International Workshop on Model-Driven Engineering for High Performance and CLoud computing co-located with 15th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012
TI - Model-driven specification of adaptive cloud-based systems
ER -
TY - GEN
AU - Yigitbas, Enes
ID - 5760
TI - Entwicklung eines Monitoring- und Adaptionskonzeptes für Geschäftsprozesse in service-orientierten Systemen
ER -
TY - JOUR
AB - A left-to-right maximum in a sequence of n numbers s_1, …, s_n is a number that is strictly larger than all preceding numbers. In this article we present a smoothed analysis of the number of left-to-right maxima in the presence of additive random noise. We show that for every sequence of n numbers s_i ∈ [0,1] that are perturbed by uniform noise from the interval [-ε,ε], the expected number of left-to-right maxima is Θ(&sqrt;n/ε + log n) for ε>1/n. For Gaussian noise with standard deviation σ we obtain a bound of O((log3/2 n)/σ + log n).We apply our results to the analysis of the smoothed height of binary search trees and the smoothed number of comparisons in the quicksort algorithm and prove bounds of Θ(&sqrt;n/ε + log n) and Θ(n/ε+1&sqrt;n/ε + n log n), respectively, for uniform random noise from the interval [-ε,ε]. Our results can also be applied to bound the smoothed number of points on a convex hull of points in the two-dimensional plane and to smoothed motion complexity, a concept we describe in this article. We bound how often one needs to update a data structure storing the smallest axis-aligned box enclosing a set of points moving in d-dimensional space.
AU - Damerow, Valentina
AU - Manthey, Bodo
AU - Meyer auf der Heide, Friedhelm
AU - Räcke, Harald
AU - Scheideler, Christian
AU - Sohler, Christian
AU - Tantau, Till
ID - 579
IS - 3
JF - Transactions on Algorithms
TI - Smoothed analysis of left-to-right maxima with applications
ER -
TY - JOUR
AU - Bodden, Eric
AU - Lam, Patrick
AU - Hendren, Laurie
ID - 5183
IS - 2
JF - ACM Transactions on Programming Languages and Systems
SN - 0164-0925
TI - Partially Evaluating Finite-State Runtime Monitors Ahead of Time
VL - 34
ER -
TY - THES
AB - FPGAs, systems on chip and embedded systems are nowadays irreplaceable. They combine the computational power of application specific hardware with software-like flexibility. At runtime, they can adjust their functionality by downloading new hardware modules and integrating their functionality. Due to their growing capabilities, the demands made to reconfigurable hardware grow. Their deployment in increasingly security critical scenarios requires new ways of enforcing security since a failure in security has severe consequences. Aside from financial losses, a loss of human life and risks to national security are possible. With this work I present the novel and groundbreaking concept of proof-carrying hardware. It is a method for the verification of properties of hardware modules to guarantee security for a target platform at runtime. The producer of a hardware module delivers based on the consumer's safety policy a safety proof in combination with the reconfiguration bitstream. The extensive computation of a proof is a contrast to the comparatively undemanding checking of the proof. I present a prototype based on open-source tools and an abstract FPGA architecture and bitstream format. The proof of the usability of proof-carrying hardware provides the evaluation of the prototype with the exemplary application of securing combinational and bounded sequential equivalence of reference monitor modules for memory safety.
AU - Drzevitzky, Stephanie
ID - 586
TI - Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security
ER -
TY - GEN
AU - Rojahn, Tobias
ID - 593
TI - Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten
ER -
TY - GEN
AU - Mammadov, Fuad
ID - 598
TI - Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen
ER -
TY - GEN
AU - Löken, Nils
ID - 606
TI - Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas
ER -