TY - CHAP
AU - Krimphove, Dieter
ED - Schmeisser, Wilhelm
ED - Zündorf, Horst
ED - Eckstein, Peter
ED - Krimphove, Dieter
ID - 1966
T2 - Finanzwirtschaft Finanzdienstleistungen Empirische Wirtschaftsforschung
TI - Rechtsfragen des Personalcontrollings – Eine Übersicht
ER -
TY - CONF
AU - Briest, Patrick
AU - Krysta, Piotr
ID - 19690
T2 - Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA)
TI - Single-Minded Unlimited Supply Pricing on Sparse Instances
ER -
TY - CONF
AU - Briest, Patrick
AU - Gunia, Christian
ID - 19691
T2 - Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC)
TI - Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels
ER -
TY - CHAP
AU - Büker, Petra
ED - Kammler, Clemens
ID - 19697
T2 - Literarische Kompetenzen – Standards im Literaturunterricht. Modelle für die Primar- und Sekundarstufe
TI - Qualitätssicherung ästhetischen Lernens durch prozessorientierte Evaluation. Zu Mascha Kaléko „Der Frühling“ (2./3. Schuljahr)
ER -
TY - JOUR
AU - Büker, Petra
ID - 19698
IS - H. 2
JF - Beiträge Jugendliteratur und Medien
TI - Hier kommt Lola! Die unkonventionelle bikulturelle Familie in Isabel Abedis neuer Kinderbuchreihe
VL - 58, H. 2
ER -
TY - JOUR
AU - Büker, Petra
ID - 19699
JF - Praxis Deutsch
TI - „Alles ist gut, so lange du wild bist!“ – Fußball, Abenteuer und starke Kids in Joachim Massaneks Wilden Fußballkerlen
VL - 33, H.196
ER -
TY - GEN
AU - Degener, Bastian
ID - 19718
TI - Die Analyse von Estimation-of-Distribution-Algorithmen auf ausgewählten Funktionen
ER -
TY - CONF
AB - We study the problem of designing an adaptive hash table for redundant data storage in a system of storage devices with arbitrary capacities. Ideally, such a hash table should make sure that (a) a storage device with x% of the available capacity should get x% of the data, (b) the copies of each data item are distributed among the storage devices so that no two copies are stored at the same device, and (c) only a near-minimum amount of data replacements is necessary to preserve (a) and (b) under any change in the system. Hash tables satisfying (a) and (c) are already known, and it is not difficult to construct hash tables satisfying (a) and (b). However, no hash table is known so far that can satisfy all three properties as long as this is in principle possible. We present a strategy called SPREAD that solves this problem for the first time. As long as (a) and (b) can in principle be satisfied, SPREAD preserves (a) for every storage device nearly optimal, with high probability, guarantees (b) for every data item, and only needs a constant factor more data replacements than minimum possible in order to preserve (a) and (b).
AU - Mahlmann, Peter
AU - Schindelhauer, Christian
ID - 19808
SN - 1595934529
T2 - Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '06
TI - Distributed random digraph transformations for peer-to-peer networks
ER -
TY - CONF
AU - Rührup, Stefan
AU - Schindelhauer, Christian
ID - 19838
SN - 0302-9743
T2 - Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)
TI - Online Multi-path Routing in a Maze
ER -
TY - CONF
AB - Storage Area Networks commonly consist a more or less static set of n data servers that handle a dynamic collection of m documents. Such SANs can minimize the access time to documents by distributing each document among several servers, allowing users to access documents in parallel. This paper describes an efficient solution for providing parallel access to multiple hard disks for popular content. In extension to previous approaches we provide an efficient and elegant hash table data structure for utilizing the full capacity of each data server. Concerning the dynamics, documents as well as server may be added or removed from the system causing only local changes. We consider sequential and parallel access to data in the average case. For the average time model we present a fast optimal algorithm.
AU - Schindelhauer, Christian
AU - Schomaker, Gunnar
ID - 19839
SN - 0769525520
T2 - 5th International Conference on Networking (ICN)
TI - SAN Optimal Multi Parameter Access Scheme
ER -
TY - GEN
AU - Rührup, Stefan
AU - Schindelhauer, Christian
ID - 19840
TI - Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks
ER -
TY - CONF
AB - In previous publications there have been several proposals
regarding replica generation and placement of movie content in
content-distribution-networks or P2P overlays. Within this paper
we extend approaches for heterogeneous placement scenarios
described in prior publications. Therefor we presume heterogeneous
server peers' bandwidth, HD capacity, and movie popularities.
Movie documents are replicated and placed onto server peers with
respect to the predicted popularity values. Thus each document
aims to gain fair networks resources according to its popularity.
We present simulation results of heuristics of different placement
strategies and compare them with a near optimal technique.
AU - Schomaker, Gunnar
AU - Loeser, Christoph
AU - Schubert, Matthias
ID - 19854
T2 - 5th International Conference on Networking (ICN).
TI - Predictive Replication and Placement Strategies for Movie Documents in heterogeneous Content Delivery Networks
ER -
TY - CONF
AU - Brinkmann, Andre
AU - Effert, Sascha
AU - Heidebuer, Michael
AU - Vodisek, Mario
ID - 19870
SN - 0769525520
T2 - 5th International Conference on Networking (ICN)
TI - Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments
ER -
TY - CHAP
AU - Heine, Felix
AU - Hovestadt, Matthias
AU - Kao, Odej
AU - Keller, Axel
ED - Jouberta, Gerhard R.
ED - Nagel, Wolfgang E.
ED - Peters, Frans J.
ED - Plata, Oscar
ED - Tirado, Francisco
ED - Zapata, Emilio L.
ID - 1989
T2 - Parallel Computing: Current and Future Issues of High End Computing
TI - Provision of Fault Tolerance with Grid-enabled and SLA-aware Resource Management Systems
ER -
TY - CHAP
AB - In this paper, we describe the architecture of the virtual resource manager VRM, a management system designed to reside on top of local resource management systems for cluster computers and other kinds of resources. The most important feature of the VRM is its capability to handle quality-of-service (QoS) guarantees and service-level agreements (SLAs). The particular emphasis of the paper is on the various opportunities to deal with local autonomy for resource management systems not supporting SLAs. As local administrators may not want to hand over complete control to the Grid management, it is necessary to define strategies that deal with this issue. Local autonomy should be retained as much as possible while providing reliability and QoS guarantees for Grid applications, e.g., specified as SLAs.
AU - Burchard, Lars-Olof
AU - Heine, Felix
AU - Heiss, Hans-Ulrich
AU - Hovestadt, Matthias
AU - Kao, Odej
AU - Keller, Axel
AU - Linnert, Barry
AU - Schneider, Jörg
ED - Getov, Vladimir
ED - Laforenza, Domenico
ED - Reinefeld, Alexander
ID - 1991
T2 - Future Generation Grids
TI - The Virtual Resource Manager: Local Autonomy versus QoS Guarantees for Grid Applications
ER -
TY - CONF
AB - November 2006
AU - Büker, Petra
ID - 19923
TI - Qualitative Unterrichtsforschung als Beitrag zur Professionalisierung ästhetischen Lernens und Lehrens – am Beispiel des interkulturell orientierten Literaturunterrichts in der Grundschule. Vortrag im Forschungskolleg „Ästhetisches Lernen“ am PLAZ. Universität Paderborn
ER -
TY - CONF
AB - #hniid 2484
AU - Kortenjan, Michael
AU - Schomaker, Gunnar
ID - 19932
T2 - 4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006)
TI - Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes
ER -
TY - JOUR
AU - Kolman, Petr
AU - Scheideler, Christian
ID - 2029
IS - 1
JF - J. Algorithms
TI - Improved bounds for the unsplittable flow problem
VL - 61
ER -
TY - JOUR
AU - Bloh, Bea
ID - 28176
TI - Die Schulformentscheidung aus Elternsicht. Eine Untersuchung der zur Ablehnung der Schulformempfehlung am Ende der Grundschulzeit
ER -
TY - CONF
AU - Djemame, Karim
AU - Gourlay, Iain
AU - Padgett, James
AU - Birkenheuer, Georg
AU - Hovestadt, Matthias
AU - Kao, Odej
AU - Voss, Kerstin
ID - 2402
SN - 0-7695-2734-5
T2 - Proc. Int. Conf. on e-Science and Grid Computing
TI - Introducing Risk Management into the Grid
ER -