@article{1999, abstract = {{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.}}, author = {{Keller, Axel and Reinefeld, Alexander}}, journal = {{Annual Review of Scalable Computing}}, pages = {{1--31}}, title = {{{Anatomy of a Resource Management System for HPC Clusters}}}, doi = {{10.1142/9789812810182_0001}}, volume = {{3}}, year = {{2001}}, } @inproceedings{2000, abstract = {{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.}}, author = {{Gehring, Jörn and Keller, Axel and Reinefeld, Alexander and Streit, Achim}}, booktitle = {{Proc. Int. Symposium on Cluster Computing and the Grid (CCGRID)}}, pages = {{130--137}}, title = {{{Early Experiences with the EGrid Testbed}}}, doi = {{10.1109/CCGRID.2001.923185}}, year = {{2001}}, } @inproceedings{2002, abstract = {{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.}}, author = {{Keller, Axel and Krawinkel, Andreas}}, booktitle = {{Proc. Int. Symposium on Cluster Computing and the Grid (CCGRID)}}, pages = {{303--310}}, title = {{{Lessons Learned While Operating Two Large SCI Clusters}}}, doi = {{10.1109/CCGRID.2001.923207}}, year = {{2001}}, } @article{27973, author = {{Toeller, M and Buyken, Anette and Heitkamp, G and Cathelineau, G and Ferriss, B and Michel, G and IDDM Complications Study Group, EURODIAB}}, journal = {{Int J Obes Relat Metab Disord}}, number = {{12}}, pages = {{1815--1822}}, title = {{{Nutrient intakes as predictors of body weight in European people with type 1 diabetes.}}}, doi = {{10.1038/sj.ijo.0801816}}, volume = {{25}}, year = {{2001}}, } @article{27974, author = {{Buyken, Anette and Toeller, M and Heitkamp, G and Karamanos, B and Rottiers, R and Muggeo, M and Fuller, JH and IDDM Complications Study Group, EURODIAB}}, issn = {{0002-9165}}, journal = {{Am J Clin Nutr}}, number = {{3}}, pages = {{574--581}}, title = {{{Glycemic index in the diet of European outpatients with type 1 diabetes: relations to glycated hemoglobin and serum lipids.}}}, doi = {{10.1093/ajcn/73.3.574}}, volume = {{73}}, year = {{2001}}, } @techreport{2427, author = {{Hungershöfer, Jan and Streit, Achim and Wierum, Jens-Michael}}, publisher = {{Paderborn Center for Parallel Computing}}, title = {{{Efficient Resource Management for Malleable Applications}}}, year = {{2001}}, } @inproceedings{2428, abstract = {{ 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. }}, author = {{Plessl, Christian and Platzner, Marco}}, booktitle = {{Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)}}, keywords = {{minimum covering, accelerator, funding-sundance}}, pages = {{85--91}}, publisher = {{CSREA Press}}, title = {{{Instance-Specific Accelerators for Minimum Covering}}}, year = {{2001}}, } @article{2429, author = {{Plessl, Christian and Wilde, Erik}}, journal = {{iX}}, pages = {{88--93}}, publisher = {{Heise Verlag}}, title = {{{Server-Side-Techniken im Web – ein Überblick}}}, year = {{2001}}, } @misc{2430, abstract = {{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.}}, author = {{Plessl, Christian}}, publisher = {{Computer Engineering and Networks Lab, ETH Zurich, Switzerland}}, title = {{{Reconfigurable Accelerators for Minimum Covering}}}, year = {{2001}}, } @inproceedings{2431, author = {{Schintke, Florian and Simon, Jens and Reinefeld, Alexander}}, booktitle = {{Proc. Int. Conf. on Computational Science (ICCS)}}, pages = {{569--578}}, publisher = {{Springer}}, title = {{{A Cache Simulator for Shared Memory Systems}}}, doi = {{10.1007/3-540-45718-6_62}}, volume = {{2074}}, year = {{2001}}, }