[30] | Stefan Podlipnig, Laszlo Böszörmenyi, A survey of Web cache replacement strategies, In ACM Computing Surveys (CSUR), ACM, vol. Volume 35 , Issue 4, New York, USA, pp. 374 - 398, 2003.
[bib] [abstract]
Abstract: Web caching is an important technique to scale the Internet. One important performance factor of Web caches is the replacement strategy. Due to specific characteristics of the World Wide Web, there exist a huge number of proposals for cache replacement. This article proposes a classification for these proposals that subsumes prior classifications. Using this classification, different proposals and their advantages and disadvantages are described. Furthermore, the article discusses the importance of cache replacement strategies in modern proxy caches and outlines potential future research topics.
|
[29] | Gabriel Panis, Andreas Hutter, Jörg Heuer, Hermann Hellwagner, Harald Kosch, Christian Timmerer, Sylvain Devillers, Myriam Amielh, Bitstream Syntax Description: A Tool for Multimedia Resource Adaptation within MPEG-21, In Signal Processing: Image Communication, Elsevier B.V., vol. Vol. 18, Special Issue on Multimedia Adaptation, no. 8, Amsterdam, Netherlands, pp. 721-747, 2003.
[bib] [pdf] [abstract]
Abstract: In this paper, a generic method is described to allow the adaptation of different multimedia resources by a single, media resource-agnostic processor. This method is based on an XML description of the media resources bitstream syntax, which can be transformed to reflect the desired adaptation and then be used to generate an adapted version of the bitstream. Based on this concept, two complementary technologies, BSDL and gBS Schema, are presented. The two technologies provide solutions for parsing a bitstream to generate its XML description, for the generic structuring of this description, and the generation of an adapted bitstream using its transformed description. The two technologies can be used as stand-alone tools; however, a joint approach has been developed in order to harmonise the two solutions and exploit their strengths. Since BSDL has been presented in previous publications, this paper is focusing more on the gBS Schema and the joint BSDL/gBS Schema approach.
|
[28] | Harald Kosch, Jörg Heuer, MPEG-7 Aktuelles Schlagwort, In Informatik Spektrum, Springer, vol. 26, no. 2, Heidelberg, pp. 164, 2003.
[bib][url] [abstract]
Abstract: Die Moving Picture Experts Group, eine Arbeitsgruppe der ISO SC29, ist seit 1988 aktiv und hat mit ihren MPEG-1/2/4 einen entscheidenden Einfluss auf die Multimedia-Industrie genommen.Mit der Verabschiedung MPEG-7 wurde von der Moving Picture Experts Group (MPEG) im März 2002 als Internationaler Standard verabschiedet. Nach der erfolgreichen Einführung der Standards MPEG-1/2/4 zur audiovisuellen Kodierung von Inhalten ist MPEG-7 ein Standard, der ein Austauschformat für Beschreibungen von multimedialen Inhalten festlegt.
|
[27] | Laszlo Böszörmenyi, Harald Kosch, Hermann Hellwagner, Best papers of EuroPar 2003, In Parallel Processing Letters, Springer, vol. 13, no. 4, Heidelberg, Germany, pp. 509-511, 2003.
[bib] |
[26] | Laszlo Böszörmenyi, Hermann Hellwagner, Harald Kosch, Mulugeta Libsie, Stefan Podlipnig, Metadata Driven Adaptation in the ADMITS Project, In Signal Processing - Image Communication - Special Issue on Multimedia Adaptation, Elsevier, vol. Vol. 18, no. Issue 8, Oxford, United Kingdom, pp. 749-766, 2003.
[bib][url] [abstract]
Abstract: The ADMITS project (Adaptation in Distributed Multimedia IT Systems) is building an experimental distributed multimedia system for investigations into adaptation, which we consider is an increasingly important tool for multimedia systems. A number of possible adaptation entities (server, proxy, clients, routers) are being explored, different algorithms for media, component and application-level adaptations are being implemented and evaluated, and experimental data are being derived to gain insight into when, where and how to adapt, and how individual, distributed adaptation steps interoperate and interact with each other. In this paper the "adaptation-chain" of (MPEG-conforming) metadata based adaptation is described: from the creation stage at the server side, through its usage in the network (actually in a proxy), up to the consumption at the client. The metadata are used to steer the adaptation processes. MPEG-conformant metadata, the so-called variation descriptions, are introduced; an example of a complete MPEG-7 document describing temporal scaling of an MPEG-4 video is given. The meta-database designed to store the metadata is briefly discussed. We describe how the metadata can be extracted from MPEG-4 visual elementary streams and initial results from the temporal video scaling experiment are given. We further present how the metadata can be utilized by enhanced cache replacement algorithms in a proxy server in order to realize quality-based caching; experimental results using these algorithms are also given. Finally, an adaptive query and presentation interface to the meta-.
|
[25] | Harald Kosch, A Moustefaoui, Lionel Brunie, Semantic based Prefetching in News-on-Demand Video Server, In Multimedia Tools and Applications, Springer, vol. Vol 18, Heidelberg, Germany, pp. 159-179, 2002.
[bib][url] [abstract]
Abstract: The Multimedia Description Standard MPEG-7 is an International Standard since February 2002. It defines a huge set of description classes for multimedia content, for its creation and its communication. This article investigates what MPEG-7 means to Multimedia Database Systems (MMDBSs) and vice versa. We argue that MPEG-7 has to be considered complementary to, rather than competing with, data models employed in MMDBSs. Finally we show by an example scenario how these technologies can reasonably complement one another..
|
[24] | Harald Kosch, Solomon Atnafu, A Multimedia Join by the Method of Nearest Neighbour Search, In Information Processing Letter, Elsev, vol. Vol. 82, no. Issue 5, Oxford, UK, pp. 269-276, 2002.
[bib][url] [pdf] [abstract]
Abstract: Multimedia databases; Processing of a multimedia join; Nearest neighbor search.
|
[23] | Harald Kosch, MPEG-7 and Multimedia Database Systems, In Sigmod Records, ACM Press, ACM, vol. Vol. 31, no. No. 2, New York, NY, USA, pp. 34-39, 2002.
[bib][url] [doi] |
[22] | Hermann Hellwagner, Matthias Ohlenroth, VI Architecture Communication Features and Performance on the Giganet Cluster LAN, In Future Generation Computer Systems, Elsevier B.V., vol. Vol. 18, no. Issue 3, Amsterdam, Netherlands, pp. 421-433, 2002.
[bib][url] [doi] [pdf] [abstract]
Abstract: The virtual interface (VI) architecture standard was developed to satisfy the need for a high throughput, low latency communication system required for cluster computing. VI architecture aims to close the performance gap between the bandwidths and latencies provided by the communication hardware and visible to the application, respectively, by minimizing the software overhead on the critical path of the communication. This paper presents the results of a performance study of one VI architecture hardware implementation, the Giganet cLAN (cluster LAN). The focus of the study is to assess and compare the performance of different VI architecture data transfer modes and specific features that are available to higher-level communication software like MPI in order to aid the implementor to decide which VI architecture options to employ for various communication scenarios. Examples of such options include the use of send/receive vs. RDMA data transfers, polling vs. blocking to check completion of communication operations, multiple VIs, completion queues and scatter capabilities of VI architecture.
|
[21] | Christian Weiß, Hermann Hellwagner, Linda Stals, Ulrich Rüde, Data Locality Optimizations to Improve The Efficiency of Multigrid Methods, In Concepts of Numerical Software, NA, NA, pp. 1-10, 2000.
[bib] [pdf] [abstract]
Abstract: Current superscalar microprocessors are able to operate at a peak performance of up to 1 GFlop/sec. However, current main memory technology does not provide the data needed fast enough to keep the CPU busy. To minimize idle times of the CPU, caches are used to speed up accesses to frequently used data. To exploit caches, the software must be aware of them and reuse data in the cache before it is being replaced. Unfortunately, all conventional multigrid codes are not cache-aware and hence exploit less than 10 percent of the peak performance of cache based machines. Our studies with linear PDEs with constant coefficients show that it is possible to speed up the execution of our multigrid method by a large factor and hence solve a Poisson’s equation with one million unknowns in less than 3 seconds. The optimized reuse of data in the cache allows us to exploit 30 percent of the peak performance of the CPU, in contrast to mgd9v for instance, which achieves less than 5 percent on the same machine. To achieve this, we used several techniques like loop unrolling and loop fusion to better exploit the memory hierarchy and the superscalar CPU. We study the effects of these techniques on the runtime performance in detail. We also study several tools which guide the optimizations and help to restructure the code.
|
[20] | Harald Kosch, Managing the operator ordering problem in parallel data-Bases, In Future Generation Computer Systems, Elsevier, vol. Vol 16, no. No 3, Langford Lane, Kidlington, Oxford OX5 1GB, United Kingdom, pp. 665-676, 2000.
[bib] [pdf] [abstract]
Abstract: This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-oriented Bushy Trees (LBT). Compared to the related approach of the General Bushy Trees (GBT) a significant complexity reduction of the operator ordering problem can be derived theoretically and demonstrated experimentally (e.g. compared with GBTs, LBTs authorize optimization time improvement that can reach up to 49%) without losing quality. Finally we demonstrate that existing commercial parallel query optimizers need little extension mod ifications in order to handle LBTs.
|
[19] | Günter Hölzl, Laszlo Böszörmenyi, Distributed Federative QoS Resource Managment-Extended version, In Future Generation Computer Systems, Elsevier, vol. Vol. 16, no. Issue 6, No 16, Oxford, United Kingdom, pp. 717-725, 2000.
[bib] [pdf] |
[18] | Laszlo Böszörmenyi, Computer im Kindergarten?, In APL-Journal, APL-Journal, vol. Jg. 19, no. Nr. 1, Mannheim, Berlin, Nürnberg, Germany, pp. 29-33, 2000.
[bib][url] [pdf] [abstract]
Abstract: Es läuft eine spannende Diskussion darüber, wie früh man Kinder an den Computer heranführen sollte. Jenseits solcher Intellektuellen-Diskussionen machen manche Firmen schon seit Jahren enorme Geschäfte mit Software und Hardware für Kinder im Kindergartenalter. Auch der erste Computer für Babys hat schon seinen Siegeszug auf dem amerikanischen Markt angetreten. Mit den Geschäftemachern zu diskutieren, ist wahrscheinlich nicht viel klüger als gegen Windmühlen zu kämpfen. Diese Firmen könnten ihre Geschäfte nicht machen, wenn es nicht viele Eltern, Großeltern, Pädagogen und Psychologen gäbe, die den Computer kleinen Kindern mit guter Absicht in die Hand geben. Die folgende Diskussion spricht die wohlwollenden Erwachsenen an, die sich für Kinder verantwortlich fühlen und sich nicht entscheiden können, wann und wie Kinder mit dem Phänomen Computer konfrontiert werden sollten.
|
[17] | Hermann Hellwagner, Ivan Zoraja, Vaidy Sunderam, SCIPVM: Parallel Distributed Computing on SCI Workstation Clusters, In Concurrency: Practice and Experience, N, A, vol. Vol 11, no. No 3, N, A, pp. 121-138, 1999.
[bib] [pdf] [abstract]
Abstract: Workstation and PC clusters interconnected by SCI (Scalable Coherent Interface) are very promising technologies for high performance cluster computing. Using commercial SBus to SCI interface cards and early system software and drivers, a two-workstation cluster has been constructed for initial testing and evaluation. The PVM system has been adapted to operate on this cluster using raw device access to the SCI interconnect, and preliminary communications performance tests have been carried out. Our preliminary results indicate that communications throughput in the range of 3.5 MBytes/s, and latencies Research supported by the Applied Mathematical Sciences program, Office of Basic Energy Sciences, U. S. Department of Energy, under Grant No. DE-FG05-91ER25105, the National Science Foundation, under Award Nos. ASC-9527186 and ASC-9214149, and the German Science Foundation SFB342. of 620 ¯s can be achieved on SCI clusters. These figures are significantly better (by a factor of 3 to 4) ...
|
[16] | Laszlo Böszörmenyi, Computer az óvodában?, In Tani-Tani, Tani-Tani, Budapest, Hungary, pp. 4-14, 1999.
[bib] |
[15] | Laszlo Böszörmenyi, Parallel Programming, In APL-Journal, APL-Journal, vol. Jg. 18, no. Nr. 2, Mannheim, Berlin, Nürnberg, Germany, pp. 85-89, 1999.
[bib] |
[14] | Laszlo Böszörmenyi, Andreas Stopper, Semi-automatic parallelization of object-oriented simulations, In Simulation Practice and Theory, Elsevier, vol. Vol. 7, no. Issue 4, Oxford, United Kingdom, pp. 295-307, 1999.
[bib] [abstract]
Abstract: An approach is introduced for semi-automatic parallelization of object-oriented simulations. The basic idea is to prepare parallelization at the earliest possible stage in the life-cycle of the creation of new simulations (i.e. at modeling), thus minimizing causality conflicts at run-time. The object-oriented model of a simulation is enriched by hints, describing the estimated load and communication costs between major classes and objects. This helps to grasp the inherent parallelism of the model. Based on this additional information, a partitioning with minimal communication between partitions can be generated automatically. Remaining dependency-conflicts must be resolved at run-time. The GoSim [A. Stopper, GoSim, ein Ansatz zur Beschleunigung diskreter, objektorientierter, verteilter Simulationen, Ph.D. Thesis, Institute of Informatics, University Klagenfurt, 1997] simulation system is presented, which implements the described proposal and provides semi-automatic parallelization of large-scale and/or high-performance simulations. It provides a description language, a partitioning tool, a program-skeleton generator and a simulation engine. Some measurements prove the usability of the approach.
|
[13] | Laszlo Böszörmenyi, Why Java is not my favorite first-course language, In Software - Concepts & Tools, Springer, no. Volume 19, Number 3, Berlin, Heidelberg, New York, pp. 141-145, 1998.
[bib] [doi] [pdf] [abstract]
Abstract: The choice of the first-course programming language for a university-level computer science curriculum has pedagogical ramifications in terms of comprehensibility and mastery of fundamental concepts. This paper compares the merits of Java and Modula-3 as a first-course language.
|
[12] | Wolfgang Mayerle, Hermann Hellwagner, Konzepte und funktionaler Vergleich von Thread-Systemen (2), In Praxis der Informationsverarbeitung und Kommunikation, Spani, vol. 20, no. 4, Mannheim, Germany, pp. 225-229, 1997.
[bib] |
[11] | Wolfgang Mayerle, Hermann Hellwagner, Konzepte und funktionaler Vergleich von Thread-Systemen (1), In Praxis der Informationsverarbeitung und Kommunikation, Spaniol, Otto, vol. 20, Mannheim, Germany, pp. 164-174, 1997.
[bib] [pdf] [abstract]
Abstract: Dieses Papier gibt eine allgemeine Einführung in Threads und vergleicht einige derzeit für Arbeitsplatzrechner erhältliche Thread-Systeme. Aufbauend auf einer Motivation und grundlegenden Erläuterung des Thread-Konzepts werden wichtige Aspekte und Probleme von Thread-Bibliotheken vorgestellt. Nach einigen Hinweisen zur Programmierung mit Threads werden mehrere Implementierungen einander gegenübergestellt.
|
[10] | Hermann Hellwagner, Wolfgang Karl, Markus Leberecht, Enabling a PC Cluster for High-Performance Computing, In Speedup Journal, Proceedings, 21st Workshop, March 13-14, 1997, Cadro-Lugano, N, A, vol. Vol. 11, no. 1, N, A, pp. 18-23, 1997.
[bib] [pdf] [abstract]
Abstract: Due to their excellent cost/performance ratio, clusters of PCs can be attractive high-performance computing (HPC) platforms. Yet, their limited communication performance over standard LANs is still prohibitive for parallel applications. The project "Shared Memory in a LAN-like Environment" (SMiLE) at LRR-TUM adopts Scalable Coherent Interface (SCI) interconnect technology to build, and provide software for, a PC cluster which, with hardware-based distributed shared memory (DSM) and high-performance communication characteristics, is regarded as well suited for HPC. The paper describes the key features of the enabling technology, SCI. It then discusses the developments and important results of the SMiLE project so far: the development and initial performance of a PCI/SCI interface card, and the design and initial performance results of low-latency communication layers, Active Messages and a sockets emulation library.
|
[9] | Laszlo Böszörmenyi, Informatik in der Schule, In Erziehungskunst - Monatsschrift zur Pädagogik Rudolf Steiners, Erziehungskunst, Stuttgart, Germany, pp. 113-121, 1997.
[bib][url] [pdf] |
[8] | Laszlo Böszörmenyi, Karl-Heinz Eder, Carsten Weich, A Very Fast Parallel Object Store for Very Fast Applications, In Simulations Practice and Theory, Elsevier, vol. Volume 5, Numbers 7-8, Oxford, United Kingdom, pp. 605-622, 1997.
[bib] [pdf] [abstract]
Abstract: An architecture for a memory-resident, Parallel and Persistent ObjectSTore (PPOST) is suggested. Different object-oriented databases might be built on top of PPOST. The term memory-resident (or main memory based) means that the primary storage device is main memory. Persistence is guaranteed automatically by managing secondary and stable storage devices (such as main memory with uninterrupted power supply, discs and tapes). The architecture is able to take advantage of available main memory in a parallel or distributed environment. Thus, transactions can be actually performed with memory-speed, without being limited by the size of the memory of a given computer. Such an architecture is especially advantageous for applications requiring very fast answers, such as CAD or high-performance simulation.
|
[7] | Laszlo Böszörmenyi, Karl-Heinz Eder, M3Set - A Language for Handling of Distributed and Persistent Sets of Objects, In Parallel Computing, Elsevier, vol. 22, no. 13, Oxford, United Kingdom, pp. 1897-1912, 1997.
[bib][url] [abstract]
Abstract: We claim that distributed object-oriented systems must provide a higher level of abstraction to their users, than usually provided. Especially, it is necessary to provide application-oriented, intelligent aggregates of objects with transparent distribution of their elements. Beside that, it seems to be not only reasonable, but also relatively easy to connect persistence with distribution. A system, offering distributed and persistent polymorphic sets of objects, on the level of a clean, type safe programming language is introduced. The user of such a system gets distribution and persistence in the same "natural" way, as users of traditional systems get volatile arrays of numbers or classes of objects.
|
[6] | Günter Böckle, Hermann Hellwagner, Roland Lepold, Gerd Sandweg, Burghardt Schallenberger, Raimar Thudt, Stefan and Wallstab, Structured Evaluation of Computer Systems, In IEEE Computer Society, N, A, vol. Vol. 29, no. No 6, N, A, pp. 45-51, 1996.
[bib] [doi] [pdf] [abstract]
Abstract: Evaluating computers and other systems is difficult for a couple of reasons. First, the goal of evaluation is typically ill-defined: customers, sometimes even designers, either don't know or can't specify exactly what result they expect. Often, they don't specify the architectural variants to consider, and often the metrics and workload they expect you to use are ill-defined. Second, they rarely clarify which kind of model and evaluation method best suit the evaluation problem. These problems have consequences. For one thing, the decision-maker may not trust the evaluation. For another, poor planning means the evaluation cannot be reproduced if any of the parameters are changed slightly. Finally, the evaluation documentation is usually inadequate, and so some time after the evaluation you might ask yourself, how did I come to that conclusion? An approach developed at Siemens makes decisions explicit and the process reproducible
|