TY - JOUR AB - Workstation clusters are often not only used for high-throughput computing in time-sharing mode but also for running complex parallel jobs in space-sharing mode. This poses several difficulties to the resource management system, which must be able to reserve computing resources for exclusive use and also to determine an optimal process mapping for a given system topology. On the basis of our CCS software, we describe the anatomy of a modern resource management system. Like Codine, Condor, and LSF, CCS provides mechanisms for the user-friendly system access and management of clusters. But unlike them, CCS is targeted at the effective support of space-sharing parallel computers and even metacomputers. Among other features, CCS provides a versatile resource description facility, topology-based process mapping, pluggable schedulers, and hooks to metacomputer management. AU - Keller, Axel AU - Reinefeld, Alexander ID - 1999 JF - Annual Review of Scalable Computing TI - Anatomy of a Resource Management System for HPC Clusters VL - 3 ER - TY - CONF AB - The Testbed and Applications working group of the European Grid Forum (EGrid) is actively building and experimenting with a grid infrastructure connecting several research-based supercomputing sites located in Europe. The paper reports on our first feasibility study: running a self-migrating version of the Cactus simulation code across the European grid testbed, including "live" remote data visualization and steering from different demonstration booths at Supercomputing 2000, in Dallas, TX. We report on the problems that had to be resolved for this endeavour and identify open research challenges for building production-grade grid environments. AU - Gehring, Jörn AU - Keller, Axel AU - Reinefeld, Alexander AU - Streit, Achim ID - 2000 T2 - Proc. Int. Symposium on Cluster Computing and the Grid (CCGRID) TI - Early Experiences with the EGrid Testbed ER - TY - CONF AB - The availability of commodity high performance components for workstations and networks made it possible to build up large, PC based compute clusters at modest costs. These clusters seem to be a realistic alternative to proprietary, massively parallel systems with respect to the price/performance ratio. However, from the administration point of view, those systems are still often solely a collection of autonomous nodes, connected by a fast short area network. Therefore, aiming at providing the best possible performance in daily work to all users, a lot of work has to be done before obtaining the expected result. The paper describes the problem areas we had to cope with during the integration of two large SCI clusters (one with 64 and one with 192 processors) in the environment of the Paderborn Center for Parallel Computing. AU - Keller, Axel AU - Krawinkel, Andreas ID - 2002 T2 - Proc. Int. Symposium on Cluster Computing and the Grid (CCGRID) TI - Lessons Learned While Operating Two Large SCI Clusters ER - TY - JOUR AU - Toeller, M AU - Buyken, Anette AU - Heitkamp, G AU - Cathelineau, G AU - Ferriss, B AU - Michel, G AU - IDDM Complications Study Group, EURODIAB ID - 27973 IS - 12 JF - Int J Obes Relat Metab Disord TI - Nutrient intakes as predictors of body weight in European people with type 1 diabetes. VL - 25 ER - TY - JOUR AU - Buyken, Anette AU - Toeller, M AU - Heitkamp, G AU - Karamanos, B AU - Rottiers, R AU - Muggeo, M AU - Fuller, JH AU - IDDM Complications Study Group, EURODIAB ID - 27974 IS - 3 JF - Am J Clin Nutr SN - 0002-9165 TI - Glycemic index in the diet of European outpatients with type 1 diabetes: relations to glycated hemoglobin and serum lipids. VL - 73 ER - TY - GEN AU - Hungershöfer, Jan AU - Streit, Achim AU - Wierum, Jens-Michael ID - 2427 TI - Efficient Resource Management for Malleable Applications ER - TY - CONF AB - In this paper we present instance-specific accelerators for minimum-cost covering problems. We first define the covering problem and discuss a branch&bound algorithm to solve it. Then we describe an instance-specific hardware architecture that implements branch&bound in 3-valued logic and uses reduction techniques usually found in software solvers. Results for small unate covering problems reveal significant raw speedups. AU - Plessl, Christian AU - Platzner, Marco ID - 2428 KW - minimum covering KW - accelerator KW - funding-sundance T2 - Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA) TI - Instance-Specific Accelerators for Minimum Covering ER - TY - JOUR AU - Plessl, Christian AU - Wilde, Erik ID - 2429 JF - iX TI - Server-Side-Techniken im Web – ein Überblick ER - TY - GEN AB - In this report the design and implementation of an instance-specific accelerator for solving minimum covering problems will be presented. After an introduction to configurable computing in general, the minimum covering problem is defined and a branch and bound algorithm to solve it in software is presented. The remainder of the report shows how this branch and bound algorithm can be adopted to hardware. Specifically it is stressed how the various sophisticated strategies for deducing conditions for variables used by software solvers can be adopted to hardware and how a system which uses 3-valued logic to solve this problem can be designed. In addition to these considerations focusing on the architecture of the system, some important details of the actual implementation are given. A prototype has been implemented for showing the feasibility of the concept and for gaining information about speed and size of the hardware implementation. Cycle-accurate simulations for a set of benchmark problems have been done for determining the performance of the accelerator. The speed of the resulting accelerators has been compared to the time a reference software solver (espresso) needs and the resulting speedups have been calculated. I have shown that a raw speedup of several orders of maginitude can be achieved for many problems; for some problems no speedup is achieved yet. After a discussion of the results, ideas for future work are presented. AU - Plessl, Christian ID - 2430 TI - Reconfigurable Accelerators for Minimum Covering ER - TY - CONF AU - Schintke, Florian AU - Simon, Jens AU - Reinefeld, Alexander ID - 2431 T2 - Proc. Int. Conf. on Computational Science (ICCS) TI - A Cache Simulator for Shared Memory Systems VL - 2074 ER - TY - CONF AB - In this paper, we present the analysis of applications from the domain of handheld and wearable computing. This analysis is the first step to derive and evaluate design parameters for dynamically reconfigurable processors. We discuss the selection of representative benchmarks for handhelds and wearables and group the applications into multimedia, communications, and cryptography programs. We simulate the applications on a cycle-accurate processor simulator and gather statistical data such as instruction mix, cache hit rates and memory requirements for an embedded processor model. A breakdown of the executed cycles into different functions identifies the most compute-intensive code sections - the kernels. Then, we analyze the applications and discuss parameters that strongly influence the design of dynamically reconfigurable processors. Finally, we outline the construction of a parameterizable simulation model for a reconfigurable unit that is attached to a processor core. AU - Enzler, Rolf AU - Platzner, Marco AU - Plessl, Christian AU - Thiele, Lothar AU - Tröster, Gerhard ID - 2432 KW - benchmark T2 - Reconfigurable Technology: FPGAs and Reconfigurable Processors for Computing and Communications III TI - Reconfigurable Processors for Handhelds and Wearables: Application Analysis VL - 4525 ER - TY - THES AU - Preis, Robert ID - 24509 TI - Analyses and Design of Efficient Graph Partitioning Methods VL - 88 ER - TY - THES AU - Lemke, Jörg ID - 24510 TI - Nutzenorientierte Planung des Einsatzes von CAD- / CAE-Systemen VL - 91 ER - TY - THES AU - von Bohuszewicz, Oskar ID - 24511 TI - Eine Methode zur Visualisierung von Geschäftsprozessen in einer virtuellen Umgebung VL - 92 ER - TY - THES AU - Börnchen, Thomas ID - 24512 TI - Zur Entwicklung dynamischer Komponenten für variables Kraftfahrzeug-Scheinwerferlicht VL - 93 ER - TY - THES AU - Windeler, Ingo ID - 24513 TI - Auswahl von Restrukturierungsprojekten in Forschungs- und Entwicklungsorganisationen der Automobilindustrie VL - 94 ER - TY - THES AU - Wolff, Carsten ID - 24514 TI - Parallele Simulation großer pulscodierter neuronaler Netze VL - 95 ER - TY - THES AU - Henke, Andreas ID - 24583 TI - Modellierung, Simulation und Optimierung piezoelektrischer Stellsysteme VL - 96 ER - TY - GEN ED - Rückert, Ulrich ED - Sitte, Joaquin ED - Witkowski, Ulf ID - 24584 TI - Proceedings of the 5th International Heinz Nixdorf Symposium: Autonomous Minirobots for Research and Edutainment (AMiRE) VL - 97 ER - TY - THES AU - Peng, Li ID - 24585 TI - Datenkonversion für den Datenaustausch in verteilten Fertigungs-Lenkungssystemen VL - 98 ER -