@inproceedings{DuennweberStadlerWeikletal., author = {D{\"u}nnweber, Jan and Stadler, Timo and Weikl, Sandra and Sch{\"a}fer, Andreas and Georg, Peter and Wein, Simon}, title = {Bus Route Classification for Rural Areas using Graph Convolutional Networks}, series = {Proceedings of the 22th International Conference on Artificial Intelligence and Soft Computing, Zakopane, Poland}, booktitle = {Proceedings of the 22th International Conference on Artificial Intelligence and Soft Computing, Zakopane, Poland}, pages = {15}, abstract = {In this paper, we present a new approach to determine the estimated time of arrival (ETA) for bus routes using (Deep) Graph Convolutional Networks (DGCNs). In addition we use the same DGCN to detect detours within a route. In our application, a classification of routes and their underlying graph structure is performed using Graph Learning. Our model leads to a fast prediction and avoids solving the vehicle routing problem (VRP) through expensive computations. Moreover, we describe how to predict travel time for all routes using the same DGCN Model. This method makes it possible not to use a more computationally intensive approximation algorithm when determining long travel times with many intermediate stops, but to use our network for an early estimate of the quality of a route. Long travel times, in our case result from the use of a call-bus system, which must distribute many passengers among several vehicles and can take them to places without a regular stop. For a case study, the rural town of Roding in Bavaria is used. Our training data for this area results from an approximation algorithm that we implemented to optimize routes, and to generate an archive of routes of varying quality simultaneously.}, language = {en} } @inproceedings{MuellerAltDuennweberetal., author = {M{\"u}ller, Jens and Alt, Martin and D{\"u}nnweber, Jan and Gorlatch, Sergei}, title = {Clayworks}, series = {IEEE International Conference on e-Science and Grid Computing (e-Science'06), 2nd, 4-6 Dec 2006, Amsterdam, Netherlands}, booktitle = {IEEE International Conference on e-Science and Grid Computing (e-Science'06), 2nd, 4-6 Dec 2006, Amsterdam, Netherlands}, isbn = {0-7695-2734-5}, doi = {10.1109/E-SCIENCE.2006.261188}, abstract = {Clayworks is a software system which integrates collaborative real-time modeling and distributed computing. It addresses the challenge of developing a collaborative workspace with a seamless access to high-performance servers. Clayworks allows modeling of virtual clay objects and running computation-intensive deformation simulations for objects crashing into each other. To integrate heterogeneous computational resources, we adopted modern Grid middleware and provided the users with an intuitive graphical interface. We parallelized the computation of simulations using a Higher-Order Component (HOC) which abstracts over the Globus Web service resource framework (WSRF) used to interconnect our worksuite to the computation server. Clayworks is a representative of a large class of demanding systems which combine collaborative modeling with performance-critical computations, e.g., crash-tests or simulations for biological population evolution.}, language = {en} } @incollection{DuennweberDumitrescuRaicuetal., author = {D{\"u}nnweber, Jan and Dumitrescu, Cǎtǎlin L. and Raicu, Ioan and Foster, Ian}, title = {Simplifying Grid Application Programming Using Web-Enabled Code Transfer Tools}, series = {Towards Next Generation Grids}, booktitle = {Towards Next Generation Grids}, editor = {Priol, Thierry and Vanneschi, Marco}, publisher = {Springer}, address = {Rennes, France}, isbn = {978-0-387-72497-3}, doi = {10.1007/978-0-387-72498-0_21}, pages = {225 -- 235}, abstract = {This paper deals with one of the fundamental properties of grid computing - transferring code between grid nodes and executing it remotely on heterogeneous hosts. Contemporary middleware relies for this purpose on Web Services, which makes application programs complicated and low-level and requires much additional expertise from programmers. We compare two mechanisms for grid application programming with regard to their handling of code transfer - the de-facto standard WS-GRAM in Globus and the higher-level approach based on HOCs (Higher-Order Components). We study the advantages and problems of each approach using a real-world application case study - the sequent alignment problem from bioinformatics. Our experiments show the trade-off between reduced development costs and software complexity when HOCs are used and the higher performance of the applications on the grid when using WS-GRAM.}, language = {en} } @inproceedings{DuennweberGorlatchBenoitetal., author = {D{\"u}nnweber, Jan and Gorlatch, Sergei and Benoit, Anne and Cole, Murray}, title = {Integrating MPI-Skeletons with Web Services}, series = {ParCo'05 - International Conference on Parallel Computing, 2005, Malaga, Spain}, booktitle = {ParCo'05 - International Conference on Parallel Computing, 2005, Malaga, Spain}, pages = {787 -- 794}, abstract = {Interoperating components, implemented in multiple programming languages, are one of the key requirements of grid computing that operates over the borders of individual hardware and software platforms. Modern grid middleware like WSRF facilitates interoperability through service-orientation but it also increases software complexity. We show that Higher-Order Components (HOCs) provide a service-oriented programming abstraction over middleware technology. By offering the pipeline skeleton from the MPI-based eSkel library as a HOC, we show how machine-oriented technologies can be made available via Web Services on grids. We bind a Java-based Web application to the HOC to demonstrate its connectivity: user defined input can be transformed in a highly performant manner by running wavelet computations remotely on parallel machines.}, language = {en} } @inproceedings{StadlerHofmeisterDuennweber, author = {Stadler, Timo and Hofmeister, Simon and D{\"u}nnweber, Jan}, title = {A Method for the Optimized Placement of Bus Stops Based on Voronoi Diagrams}, series = {Proceedings of the 55th Hawaii International Conference on System Sciences (HICSS55): January 3-7, 2022, Maui, Hawaii, USA}, booktitle = {Proceedings of the 55th Hawaii International Conference on System Sciences (HICSS55): January 3-7, 2022, Maui, Hawaii, USA}, doi = {10.24251/HICSS.2022.694}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:898-opus4-21214}, pages = {5686 -- 5694}, abstract = {In this paper a new method for placing bus stops is presented. The method is suitable for permanently installed new bus stops and temporarily chosen collection points for call busses as well. Moreover, our implementation of the Voronoi algorithm chooses new locations for bus stops in such a way that more bus stops are set in densely populated areas and less in less populated areas. To achieve this goal, a corresponding weighting is applied to each possible placement point, based on the number of inhabitants around this point and the points of interest, such as medical centers and department stores around this point. Using the area of Roding, a small town in Bavaria, for a case study, we show that our method is especially suitable for for rural areas, where there are few multi-family houses or apartment blocks and the area is not densely populated.}, language = {en} } @inproceedings{BurgerSarkarKirschetal., author = {Burger, David and Sarkar, Amit and Kirsch, Konstantin and D{\"u}nnweber, Jan}, title = {Combining Fill-Level Sensing with Route Optimization for a More Efficient Waste Collection}, series = {ECDG 2018 - European Conference on Digital Government, 2018, Santiago De Compostela, Spain}, booktitle = {ECDG 2018 - European Conference on Digital Government, 2018, Santiago De Compostela, Spain}, editor = {Bouzas Lorenzo, Ram{\´o}n}, isbn = {9781912764037}, pages = {24 -- 31}, abstract = {We tackle the problem that collecting all the waste of modern cities within the scheduled time spans becomes increasingly challenging, while the waste collection team is not supplemented accordingly in many places, e.g. by more staff or vehicles. Separating waste has become natural for urban populations, as recycling is ecologically necessary. However, the separation also leads to a continuously increasing number of containers which are logistically unmanageable without computer-aided collection scheduling. Regensburg recently introduced a new program for the collection of biological waste, which extends the private collection of such waste by a few hundred public biological waste containers. Computer support was pretty basic so far, i.e. the collection times were recorded and the routes were sporadically rescheduled manually in an Excel sheet. We show that much shorter waste collection routes can be found automatically using a dynamic version of the classic Ant Colony Optimization (ACO) algorithm for shortening the collection routes. Moreover, we sketch an loT (lnternet-of-Things) approach to "lntelligent Waste Containers" which we equip with ultrasonic sensors monitoring the fill levels, which allows us to skip poorly used containers during the collection and reposition them on demand. By means of a computer simulation with online visualization, we illustrate that our optimized and dynamically adapted collection routes lead to significant time savings. Indeed, more than twice the number of currently used containers can be collected within the same time. We also report about the first experiments that we conducted with real sensors. The presented work is the result of a cooperation between four contributing parties: 1) Technical University of Regensburg (OTH); 2) Ara Institute of Canterbury; 3) Regensburg's Governmental Department of Waste Management; and 4) an industry partner (kpit.com). We compare the outcome of our project with related work and we sketch some future perspectives and ideas for transforming Regensburg into an even more automatized, environmentally friendly "smart city".}, language = {en} } @book{DuennweberGorlatch, author = {D{\"u}nnweber, Jan and Gorlatch, Sergei}, title = {Higher-Order Components for Grid Programming}, publisher = {Springer}, address = {Berlin, Heidelberg}, isbn = {978-3-642-00841-2}, doi = {10.1007/978-3-642-00841-2}, abstract = {A major challenge in grid computing remains the application software development for this new kind of infrastructure. Grid application programmers have to take into account several complicated aspects: distribution of data and computations, parallel computations on different sites and processors, heterogeneity of the involved computers, load balancing, etc. Grid programmers thus demand novel programming methodologies that abstract over such technical details while preserving the beneficial features of modern grid middleware. For this purpose, the authors introduce Higher-Order Components (HOCs). HOCs implement generic parallel/distributed processing patterns, together with the required middleware support, and they are offered to users via a high-level service interface. Users only have to provide the application-specific pieces of their programs as parameters, while low-level implementation details, such as the transfer of data across the grid, are handled by the HOCs. HOCs were developed within the CoreGRID European Network of Excellence and have become an optional extension of the popular Globus middleware. The book provides the reader with hands-on experience, describing a broad collection of example applications from various fields of science and engineering, including biology, physics, etc. The Java code for these examples is provided online, complementing the book. The expected application performance is studied and reported for extensive performance experiments on different testbeds, including grids with worldwide distribution. The book is targeted at graduate students, advanced professionals, and researchers in both academia and industry. Readers can raise their level of knowledge about methodologies for programming contemporary parallel and distributed systems, and, furthermore, they can gain practical experience in using distributed software. Practical examples show how the complementary online material can easily be adopted in various new projects.}, language = {en} } @incollection{DuennweberLuedekingGorlatch, author = {D{\"u}nnweber, Jan and L{\"u}deking, Philipp and Gorlatch, Sergei}, title = {A Higher-Order Component for Efficient Genome Processing on the Grid}, series = {Making Grids Work}, booktitle = {Making Grids Work}, editor = {Danelutto, Marco and Fragopoulou, Paraskevi and Getov, Vladimir}, publisher = {Springer}, address = {Boston, MA}, isbn = {978-0-387-78447-2}, doi = {10.1007/978-0-387-78448-9_28}, pages = {351 -- 362}, abstract = {Computational grids combine computers in the Internet for distributed data processing and are an attractive platform for the data-intensive applications of bioinformatics. We present an extensible genome processing software for the grid and evaluate its performance. Our software was able to discover previously unknown circular permutations (CP) in the ProDom database containing more than 70MB of protein data. A specific feature of our software is its design as a component: the Alignment HOC, a Higher-Order Component that makes use of the latest Globus toolkit as grid middleware. Besides genome data, the Alignment HOC accepts plugin code for processing this data as its input, and contains all the required configuration to run the component on top of Globus, thus, freeing the non-grid-expert user from dealing with grid middleware. Instead of writing data distribution procedures and configuring the middleware appropriately for every new algorithm, Alignment HOC users reuse the existing component and only write application-specific plugins. To maintain plugins persistently in a reusable manner, we built a web-accessible plugin database with a comfortable administration GUI. The flexible component-based implementation makes it easy to study CPs in other databases (e.g. UniProt/Swiss-Prot) or to use an alignment algorithm different than the standard Needleman-Wunsch. For the efficient distribution of workload, we developed a library of group communication operations for HOCs.}, language = {en} } @incollection{DuennweberTomasoniGorlatchetal., author = {D{\"u}nnweber, Jan and Tomasoni, Johannes and Gorlatch, Sergei and Claßen, Michael and Claßen, Philipp and Lengauer, Christian}, title = {A Grid Component with Embedded Loop Parallelization}, series = {Grid Computing}, booktitle = {Grid Computing}, editor = {Gorlatch, Sergei and Fragopoulou, Paraskevi and Priol, Thierry}, publisher = {Springer}, address = {Berlin}, isbn = {978-0-387-09456-4}, doi = {10.1007/978-0-387-09457-1_22}, pages = {261 -- 273}, abstract = {This work integrates two distinct research areas of parallel and distributed computing, (1) automatic loop parallelization, and (2) component-based Grid programming. The latter includes technologies developed within CoreGRID for simplifying Grid programming: the Grid ComponentModel (GCM) and Higher- Order Components (HOCs). Components support developing applications on the Grid without taking all the technical details of the particular platform type into account (network communication, heterogeneity, etc.). The GCMenables a hierarchical composition of programpieces and HOCs enable the reuse of component code in the development of new applications by specifying application-specific operations in a program via code parameters. When a programmer is provided, e. g., with a compute farm HOC, only the independent worker tasks must be described. But, once an application exhibits data or control dependences, the trivial farm is no longer sufficient. Here, the power of loop parallelization tools, like LooPo, comes into play: by embedding LooPo into a HOC, we show that these two technologies in combination facilitate the automatic transformation of a sequential loop nest with complex dependences (supplied by the user as a HOC parameter) into an ordered task graph, which can be processed on the Grid in parallel. This technique can significantly simplify GCM-based systems which combine multiple HOCs and other components. We use an equation system solver based on the successive overrelaxation method (SOR) as our motivating application example and for performance experiments.}, language = {en} } @inproceedings{DumitrescuEpemaDuennweber, author = {Dumitrescu, C{\^a}t{\^a}lin L. and Epema, Dick H. J. and D{\"u}nnweber, Jan}, title = {User-Transparent Scheduling for Software Components on the Grid}, series = {Achievements in European Research on Grid Systems}, booktitle = {Achievements in European Research on Grid Systems}, editor = {Gorlatch, Sergei and Bubak, Marian and Priol, Thierry}, publisher = {Springer}, address = {Boston, MA}, isbn = {978-0-387-72811-7}, doi = {10.1007/978-0-387-72812-4_4}, pages = {41 -- 53}, abstract = {Grid applications are increasingly being developed as workflows using well-structured, reusable components. We argue that components with well-defined semantics facilitate an efficient scheduling on the Grid. We have previously developed a user-transparent scheduling approach for Higher-Order Components (HOCs) - parallel implementations of typical programming patterns, accessible and customizable via Web services. Our approach combines three scheduling techniques: using cost functions for reducing communication overhead, reusability of schedules for similar workflows, and the aggregated submission of jobs. We analyze the user-transparent scheduling from four perspectives, namely: the easiness of integration within already existing Grid scheduling systems, the gains for individual users, the resource provider advantages, and the robustness with respect to execution failures. We perform our evaluation using the KOALA Grid scheduler extended to support our user-transparent scheduling, which we run on the DAS-2 system combining over 200 nodes at five sites in the Netherlands. The experimental results show an increase in throughput by more than 100\%, a descreasing of the response time by 50\%, and a failure reduction by 45\% for the considered scenarios}, language = {en} }