TY - CHAP A1 - Dünnweber, Jan A1 - Stadler, Timo A1 - Weikl, Sandra A1 - Schäfer, Andreas A1 - Georg, Peter A1 - Wein, Simon T1 - Bus Route Classification for Rural Areas using Graph Convolutional Networks T2 - Proceedings of the 22th International Conference on Artificial Intelligence and Soft Computing, Zakopane, Poland N2 - 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. Y1 - 2023 ER - TY - CHAP A1 - Müller, Jens A1 - Alt, Martin A1 - Dünnweber, Jan A1 - Gorlatch, Sergei T1 - Clayworks BT - A System for Collaborative Real-Time Modeling and High-Performance Simulation T2 - IEEE International Conference on e-Science and Grid Computing (e-Science'06), 2nd, 4-6 Dec 2006, Amsterdam, Netherlands N2 - 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. KW - Collaboration KW - Real time systems KW - Computational modeling KW - Collaborative work KW - Biology computing KW - Biological system modeling KW - Deformable models KW - Computer crashes KW - Software systems KW - Concurrent computing Y1 - 2006 SN - 0-7695-2734-5 U6 - https://doi.org/10.1109/E-SCIENCE.2006.261188 ER - TY - CHAP A1 - Dünnweber, Jan A1 - Dumitrescu, Cǎtǎlin L. A1 - Raicu, Ioan A1 - Foster, Ian ED - Priol, Thierry ED - Vanneschi, Marco T1 - Simplifying Grid Application Programming Using Web-Enabled Code Transfer Tools T2 - Towards Next Generation Grids N2 - 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. KW - Distributed Systems KW - Resource Management KW - Service Level Agreements KW - Application Code KW - Grid Application KW - Executable Code KW - Code Parameter KW - Globus Toolkit Y1 - 2007 SN - 978-0-387-72497-3 U6 - https://doi.org/10.1007/978-0-387-72498-0_21 SP - 225 EP - 235 PB - Springer CY - Rennes, France ER - TY - CHAP A1 - Dünnweber, Jan A1 - Gorlatch, Sergei A1 - Benoit, Anne A1 - Cole, Murray T1 - Integrating MPI-Skeletons with Web Services T2 - ParCo'05 - International Conference on Parallel Computing, 2005, Malaga, Spain N2 - 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. Y1 - 2005 UR - http://homepages.inf.ed.ac.uk/mic/Pubs/malaga.pdf SP - 787 EP - 794 ER - TY - CHAP A1 - Stadler, Timo A1 - Hofmeister, Simon A1 - Dünnweber, Jan T1 - A Method for the Optimized Placement of Bus Stops Based on Voronoi Diagrams T2 - Proceedings of the 55th Hawaii International Conference on System Sciences (HICSS55): January 3-7, 2022, Maui, Hawaii, USA N2 - 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. KW - rural mobility KW - transportation KW - voronoi KW - bus stop placement KW - Location Intelligence Research in System Sciences Y1 - 2022 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:898-opus4-21214 SP - 5686 EP - 5694 ER - TY - CHAP A1 - Burger, David A1 - Sarkar, Amit A1 - Kirsch, Konstantin A1 - Dünnweber, Jan ED - Bouzas Lorenzo, Ramón T1 - Combining Fill-Level Sensing with Route Optimization for a More Efficient Waste Collection T2 - ECDG 2018 - European Conference on Digital Government, 2018, Santiago De Compostela, Spain N2 - 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". KW - smart city KW - loT KW - wireless sensor networks KW - smart government KW - e-waste KW - Ant Colony Optimization Y1 - 2018 SN - 9781912764037 SP - 24 EP - 31 ER - TY - BOOK A1 - Dünnweber, Jan A1 - Gorlatch, Sergei T1 - Higher-Order Components for Grid Programming BT - Making Grids More Usable N2 - 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. KW - Component-Based Development KW - Distributed Computing KW - Distributed Resource Management KW - Globus KW - Grid and Cloud Computing KW - Java KW - Middleware KW - Web Services KW - distributed systems KW - grid computing KW - load balancing KW - programming Y1 - 2009 SN - 978-3-642-00841-2 U6 - https://doi.org/10.1007/978-3-642-00841-2 PB - Springer CY - Berlin, Heidelberg ER - TY - CHAP A1 - Dünnweber, Jan A1 - Lüdeking, Philipp A1 - Gorlatch, Sergei ED - Danelutto, Marco ED - Fragopoulou, Paraskevi ED - Getov, Vladimir T1 - A Higher-Order Component for Efficient Genome Processing on the Grid T2 - Making Grids Work N2 - 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. KW - higher-order components KW - genome processing KW - sequence alignment KW - middleware Y1 - 2007 SN - 978-0-387-78447-2 U6 - https://doi.org/10.1007/978-0-387-78448-9_28 SP - 351 EP - 362 PB - Springer CY - Boston, MA ER - TY - CHAP A1 - Dünnweber, Jan A1 - Tomasoni, Johannes A1 - Gorlatch, Sergei A1 - Claßen, Michael A1 - Claßen, Philipp A1 - Lengauer, Christian ED - Gorlatch, Sergei ED - Fragopoulou, Paraskevi ED - Priol, Thierry T1 - A Grid Component with Embedded Loop Parallelization T2 - Grid Computing N2 - 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. KW - Higher-Order Components (HOCs) KW - Loop Parallelization KW - GCM KW - Grid Programming Y1 - 2007 SN - 978-0-387-09456-4 U6 - https://doi.org/10.1007/978-0-387-09457-1_22 SP - 261 EP - 273 PB - Springer CY - Berlin ER - TY - CHAP A1 - Dumitrescu, Câtâlin L. A1 - Epema, Dick H. J. A1 - Dünnweber, Jan ED - Gorlatch, Sergei ED - Bubak, Marian ED - Priol, Thierry T1 - User-Transparent Scheduling for Software Components on the Grid T2 - Achievements in European Research on Grid Systems N2 - 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 KW - User-Transparent Scheduling KW - Co-Allocation KW - Component Technology KW - Higher-Order Components Y1 - 2008 SN - 978-0-387-72811-7 U6 - https://doi.org/10.1007/978-0-387-72812-4_4 SP - 41 EP - 53 PB - Springer CY - Boston, MA ER - TY - JOUR A1 - Müller-Iden, Jens A1 - Dünnweber, Jan A1 - Gorlatch, Sergei A1 - Alt, Martin A1 - Fujita, Hamido A1 - Funyu, Yutaka T1 - Clayworks: Toward user-oriented software for collaborative modeling JF - Knowledge-Based Systems N2 - We consider the development of software systems that integrate collaborative real-time modeling and distributed computing. Our main goal is user-orientation: we need a collaborative workspace for geographically dispersed users with a seamless access of every user to high-performance servers. This paper presents a particular prototype, Clayworks, that allows modeling of virtual clay objects and running computation-intensive deformation simulations for objects crashing into each other. In order to integrate heterogeneous computational resources, we adopt modern Grid middleware and provide the users with an intuitive graphical interface. Simulations are parallelized using a higher-order component (HOC) which abstracts over the 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, user-oriented modeling with performance-critical computations, e.g., crash-tests or simulations of biological population evolution. KW - User-oriented software development KW - Collaborative environments KW - Real-time modeling KW - High-performance simulation Y1 - 2008 U6 - https://doi.org/10.1016/j.knosys.2008.12.001 VL - 22 IS - 3 SP - 209 EP - 215 PB - Elsevier CY - Oxford, UK ER - TY - CHAP A1 - Dünnweber, Jan A1 - Aldinucci, Marco A1 - Gorlatch, Sergei A1 - Campa, Sonia A1 - Danelutto, Marco ED - Gorlatch, Sergei ED - Danelutto, Marco T1 - Adaptable Parallel Components for Grid Programming T2 - Integrated Research in GRID Computing N2 - We suggest that parallel software components used for grid computing should be adaptable to application-specific requirements, instead of developing new components from scratch for each particular application. As an example, we take a parallel farm component which is “embarrassingly parallel”, i. e., free of dependencies, and adapt it to the wavefront processing pattern with dependencies that impact its behavior. We describe our approach in the context of Higher-Order Components (HOCs), with the Java-based system Lithium as our implementation framework. The adaptation process relies on HOCs’ mobile code parameters that are shipped over the network of the grid. We describe our implementation of the proposed component adaptation method and report first experimental results for a particular grid application — the alignment of DNA sequence pairs, a popular, time-critical problem in computational molecular biology. KW - Grid Components KW - Adaptable Code KW - Wavefront Parallelism KW - Java KW - Web Services Y1 - 2006 SN - 978-0-387-47656-8 U6 - https://doi.org/10.1007/978-0-387-47658-2_4 SP - 43 EP - 57 PB - Springer Verlag CY - Boston, MA ER - TY - JOUR A1 - Dünnweber, Jan A1 - Kirsch, C. T1 - Report Datenmigration BT - Geeignete Umstiegstrategien in Großprojekten JF - iX - Magazin für professionelle Informationstechnik N2 - Mehrere Terabyte Daten aus einem auf dem Mainframe laufenden COBOL-Programm auf eine SOA-Architektur unter Linux zu migrieren, stellt besondere Anforderungen an die Werkzeuge und Entwickler. Geschickte Kombination vorhandener Tools und effizienter Strategien vermeiden Stillstandszeiten und beschleunigen den Datentransfer. Y1 - 2010 SN - 0935-9680 IS - 11 SP - 95 EP - 100 PB - Heise CY - Hannover ER - TY - JOUR A1 - Baumgarten, Bodo A1 - Dünnweber, Jan A1 - Kirsch, C. T1 - Report Big Data - Strukturierung von Tourismusdaten mit Hadoop BT - Reiseziele aus der Wolke JF - iX - Magazin für professionelle Informationstechnik N2 - Ein weitverbreitetes, unstrukturiertes Datenformat stellt Reiseveranstalter inzwischen vor technische und logistische Probleme. Abhilfe könnte ein neues Format in Zusammenarbeit mit Cloud-Techniken schaffen. Y1 - 2013 SN - 0935-9680 IS - 06 SP - 97 EP - 101 PB - heise CY - Hannover ER - TY - CHAP A1 - Dünnweber, Jan A1 - Parlavatzas, Nikos A1 - Gorlatch, Sergei A1 - Baude, Francoise A1 - Legrand, Virginie ED - Gorlatch, Sergei ED - Danelutto, Marco T1 - Automatic Creation of Web Services for Grid Components T2 - Integrated Research in GRID Computing N2 - While high-level software components simplify the programming of grid applications and Web services increase their interoperability, developing such components and configuring the interconnecting services is a demanding task. In this paper, we consider the combination of Higher-Order Components (HOCs) with the Fractal component model and the ProActive library. HOCs are parallel programming components, made accessible on the grid via Web services that use a special class loader enabling code mobility: executable code can be uploaded to a HOC, allowing one to customize the HOC. Fractal simplifies the composition of components and the ProActive library offers a generator for automatically creating Web services from components composed with Fractal, as long as all the parameters of these services have primitive types. Taking all the advantages of HOCs, ProActive and Fractal together, the obvious conclusion is that composing HOCs using Fractal and automatically exposing them as Web services on the grid via ProActive minimizes the required efforts for building complex grid systems. In this context, we solved the problem of exchanging code-carrying parameters in automatically generated Web services by integrating the HOC class loading mechanism into the ProActive library. KW - CoreGRID Component Model (GCM) & Fractal KW - Higher-Order Components Y1 - 2006 SN - 978-0-387-47656-8 U6 - https://doi.org/10.1007/978-0-387-47658-2_3 SP - 31 EP - 42 PB - Springer CY - Sophia Antipolis, France ER - TY - CHAP A1 - Aldinucci, Marco A1 - Dünnweber, Jan A1 - Danelutto, Marco A1 - Golatch, Sergei ED - Grandinetti, Lucio T1 - Optimization techniques for skeletons on grids T2 - Grid Computing: The New Frontier of High Performance Computing N2 - Skeletons are common patterns of parallelism, such as farm and pipeline, that can be abstracted and offered to the application programmer as programming primitives. We describe the use and implementation of skeletons on emerging computational grids, with the skeleton system Lithium, based on Java and RMI, as our reference programming syttem. Our main contribution is the exploration of optimization techniques for implementing skeletons on grids based on an optimized, future-based RMI mechanism, which we integrate into the macro-dataflow evaluation mechanism of Lithium. We discuss three optimizations: 1) a lookahead mechanism that allows to process multiple tasks concurrently at each grid server and thereby increases the overall degree of parallelism, 2) a lazy taskbinding technique that reduces interactions between grid servers and the task dispatcher, and 3) dynamic improvements that optimize the collecting of results and the work-load balancing. We report experimental results that demonstrate the improvements due to our optimizations on various testbeds, including a heterogeneous grid-like environment. Y1 - 2005 SN - 978-0-08-046146-5 U6 - https://doi.org/10.1016/S0927-5452(05)80014-0 SP - 255 EP - 273 PB - Elsevier CY - Scotland ER - TY - CHAP A1 - Schrader, Jonas A1 - Stadler, Timo A1 - Dünnweber, Jan T1 - A Hybrid Genetic Algorithm for Solving the VRP with Pickup and Delivery in Rural Areas T2 - Proceedings of the 56th Hawaii International Conference on System Sciences: January 3-6, 2023, Maui Hawaii, USA N2 - In this paper, we present a new Hybrid Genetic Search (HGS) algorithm for solving the Capacitated Vehicle Routing Problem for Pickup and Delivery (CVRPPD) as it is required for public transport in rural areas. One of the biggest peculiarities here is that a large area has to be covered with as few vehicles as possible. The basic idea of this algorithm is based on a more general version of HGS, which we adopted to solve the CVRPPD in rural areas. It also implements improvements that lead to the acceleration of the algorithm and, thereby, to a faster generation of a fastest route. We tested the algorithm on real road data from Roding, a rural district in Bavaria, Germany. Moreover, we designed an API for converting data from the Openrouteservice, so that our algorithm can be applied on real world examples as well. Y1 - 2023 UR - https://scholarspace.manoa.hawaii.edu/items/3df366a9-3c24-4e7a-bb41-89edec5611f6 SN - 2572-6862 PB - University of Hawaiʻi at Mānoa CY - Honolulu, HI ER - TY - CHAP A1 - Gorlatch, Sergei A1 - Dünnweber, Jan ED - Getov, Vladimir ED - Laforenza, Domenico ED - Reinefeld, Alexander T1 - From Grid Middleware to Grid Applications BT - Bridging the Gap with HOCs T2 - Future Generation Grids N2 - This paper deals with the problem of application programming for grid systems that combine heterogeneous data and computational resources via the Internet. We argue that grid programming is still too complex because of the big gap between the currently used and anticipated grid middleware, (e.g., Globus or WSRF) and the application level. We suggest that this gap needs to be closed in future-generation grids and propose a novel approach to bridging the gap by using Higher-Order Components (HOCs) — recurring patterns of parallel behaviour that are provided to the user as program building blocks with pre-packaged implementation and middleware setup. The presentation is illustrated with a simple case study of computing fractal images. Our experiments demonstrate that HOCs can simplify grid application programming significantly, without serious performance loss. KW - components KW - Grid services KW - Globus toolkit KW - mobile code Y1 - 2005 SN - 978-0-387-27935-0 U6 - https://doi.org/10.1007/978-0-387-29445-2_13 SP - 241 EP - 261 PB - Springer Verlag CY - Berlin ER - TY - CHAP A1 - Dünnweber, Jan A1 - Gorlatch, Sergei T1 - HOC-SA BT - A Grid Service Architecture for Higher-Order Components T2 - IEEE International Conference on Services Computing (SCC 2004), 15-18 Sept. 2004, Shanghai, China N2 - The current efforts on programming grid applications often rely on service-oriented approaches like grid services. This work presents HOC-SA -a service architecture for higher-order components, which provides the programmer with reusable and composable patterns of parallelism and is interoperable with the latest Globus toolkit implementations. We describe our implementation of HOC-SA using OGSA-DAI, a framework for integrating grids with distributed databases. We present a simple example application and report first measurements on our grid testbed. KW - Web services KW - Programming profession KW - Parallel processing KW - Grid computing KW - Service oriented architecture KW - Testing KW - Distributed computing KW - Concurrent computing KW - Image segmentation KW - Electronic mail Y1 - 2004 SN - 0-7695-2225-4 U6 - https://doi.org/10.1109/SCC.2004.1358017 ER - TY - CHAP A1 - Dünnweber, Jan A1 - Sarkar, Amit A1 - Puthiyadath, Vimal Kumar A1 - Barde, Omkar ED - Saeed, Khalid ED - Dvorský, Jiří T1 - A Tale of Four Cities - Improving Bus and Waste Collection Schedules in Practical Smart City Applications T2 - Computer Information Systems and Industrial Management N2 - Computer-based Improvements of waste collection and public transport procedures are often a part of smart city initiatives. When we envision an ideal bus network, it will primarily connect the most crowded bus stops. Similarly, an ideal waste collection vehicle will arrive at every container exactly at the time when it is fully loaded. Beyond doubt, this will reduce traffic and support environmentally friendly intentions like waste separation, as it will make more containers manageable. A difficulty of putting that vision into practice is that vehicles cannot always be where they are needed. Knowing the best time for arriving at a position is not insufficient for finding the optimal route. Therefore, we compare four different approaches to optimized routing: Regensburg, Christchurch, Malaysia, and Bangalore. Our analysis shows that the best schedules result from adapting field-tested routes frequently based on sensor measurements and route optimizing computations. KW - Smart city KW - Bus schedules KW - Waste management Y1 - 2021 SN - 978-3-030-84340-3 U6 - https://doi.org/10.1007/978-3-030-84340-3_30 SP - 369 EP - 380 PB - Springer CY - Cham ER - TY - CHAP A1 - Stadler, Timo A1 - Sarkar, Amit A1 - Dünnweber, Jan ED - Saeed, Khalid ED - Dvorský, Jiří T1 - Bus Demand Forecasting for Rural Areas Using XGBoost and Random Forest Algorithm T2 - CISIM2021: 20th International Conference on Computer Information Systems and Industrial Management Applications, September 24-26 2021, Ełk, Poland N2 - In recent years, mobility solutions have experienced a significant upswing. Consequently, it has increased the importance of forecasting the number of passengers and determining the associated demand for vehicles. We analyze all bus routes in a rural area in contrast to other work that predicts just a single bus route. Some differences in bus routes in rural areas compared to cities are highlighted and substantiated by a case study data using Roding, a town in the rural district of Cham in northern Bavaria, as an example. Data collected and we selected a random forest model that lets us determine the passenger demand, bus line effectiveness, or general user behavior. The prediction accuracy of the selected model is currently 87%. The collected data helps to build new mobility-as-a-service solutions, such as on-call buses or dynamic route optimizations, as we show with our simulation. KW - Transportation KW - Rural mobility KW - Prediction KW - Öffentlicher Personennahverkehr KW - Ländlicher Raum KW - Verkehrsnachfrage KW - Prognosemodell KW - Random Forest Y1 - 2021 SN - 978-3-030-84340-3 U6 - https://doi.org/10.1007/978-3-030-84340-3_36 SP - 442 EP - 453 PB - Springer CY - Cham ER - TY - CHAP A1 - Dünnweber, Jan A1 - Mihaylov, Valentin A1 - Glettler, René A1 - Maiborn, Volker A1 - Wolff, Holger T1 - Use of HPC-Techniques for Large-Scale Data Migration T2 - Workshop on High-Performance Computing Applied to Finance, 2011, Ischia, Italy N2 - Any re-design of a distributed legacy system requires a migration which involves numerous complex data replication and transformation steps. Migration procedures can become quite difficult and time-consuming, especially when the setup (i.e., the employed databases, encodings, formats etc.) of the legacy and the target system fundamentally differ, which is often the case with finance data, grown over decades. We report on experiences from a real-world project: the recent migration of a customer loyalty system from a COBOL-operated mainframe to a modern service-oriented architecture. In this context, we present our easy-to-adopt solution for running most replication steps in a high-performance manner: the QuickApply HPC-software which helps minimizing the replication time, and, thereby, the overall downtime of the migration. Business processes can be kept up and running most of the time, while pre-extracted data already pass a variety of platforms and representations toward the target system. We combine the advantages of traditional migration approaches: transformations, which require the interruption of business processes are performed with static data only, they can be made undone in case of a failure and terminate quickly, due to the use of parallel processing. KW - Business Process KW - Legacy System KW - Target System KW - Work Unit KW - Loyalty Program Y1 - 2011 SN - 978-3-642-21877-4 U6 - https://doi.org/10.1007/978-3-642-29737-3_45 PB - Springer CY - Berlin, Heidelberg ER - TY - CHAP A1 - Winter, Christoph A1 - Dünnweber, Jan T1 - Model-Driven Development of GPU Applications T2 - Parallel Computing: On the Road to Exascale N2 - Programming GPUs with low-level libraries like CUDA and OpenCL is a tedious and error-prone task. Fortunately, algorithmic skeletons can shield developers from the complexity of parallel programming by encapsulating common parallel computing patterns. However, this simplification typically constrains programmers to write their applications using the GPU library employed by the skeleton implementation. In this work, we combine skeletal programming with modeldriven software development (MDSD) to increase the freedom of choice regarding the employed GPU library instead of leaving all technical decisions to the skeleton implementation. We present a code-generator that transforms models comprising skeletons, their input data and input functions to parallel C++ code while taking care of data-offset calculations. The generator has been tested using different GPU and multi-GPU communication libraries such as Thrust and CUDA-MPI. We demonstrate our novel approach to GPU programming with two example applications: affinity propagation and n-body simulation. Y1 - 2016 SN - 978-1-61499-621-7 U6 - https://doi.org/10.3233/978-1-61499-621-7-227 SP - 227 EP - 236 PB - IOS Press CY - Amsterdam, Netherlands ER - TY - CHAP A1 - Dünnweber, Jan A1 - Gorlatch, Sergei A1 - Parlavantzas, Nikos A1 - Baude, Francoise A1 - Legrand, Virginie T1 - Towards automatic creation of web services for grid component composition T2 - Integrated Research in GRID Computing : CoreGRID Integration Workshop 2005 (Selected Papers), November 28-30, Pisa, Italy N2 - While high-level software components simplify the programming of grid applications and Web services increase their interoperability, developing such components and configuring the interconnecting services is a demanding task. In this paper, we consider the combination of Higher-Order Components (HOCs) with the Fractal component model and the ProActive library. HOCs are parallel programming components, made accessible on the grid via Web services that use a special class loader enabling code mobility: executable code can be uploaded to a HOC, allowing one to customize the HOC. Fractal simplifies the composition of components and the ProActive library offers a generator for automatically creating Web services from components composed with Fractal, as long as all the parameters of these services have primitive types. Taking all the advantages of HOCs, ProActive and Fractal together, the obvious conclusion is that composing HOCs using Fractal and automatically exposing them as Web services on the grid via ProActive minimizes the required efforts for building complex grid systems. In this context, we solved the problem of exchanging code-carrying parameters in automatically generated Web services by integrating the HOC class loading mechanism into the ProActive library. KW - CoreGRID Component Model (GCM) & Fractal KW - Higher-Order Components Y1 - 2007 SN - 978-0-387-47658-2 SN - 978-0-387-47656-8 U6 - https://doi.org/10.1007/978-0-387-47658-2_3 SP - 31 EP - 42 PB - Springer Science+Business Media CY - Boston, MA ER - TY - CHAP A1 - Thelen, Simon A1 - Eder, Friedrich A1 - Melzer, Matthias A1 - Weber Nunes, Danilo A1 - Stadler, Michael A1 - Rechenauer, Christian A1 - Obergrießer, Mathias A1 - Jubeh, Ruben A1 - Volbert, Klaus A1 - Dünnweber, Jan T1 - A Slim Digital Twin For A Smart City And Its Residents T2 - SOICT '23: Proceedings of the 12th International Symposium on Information and Communication Technology, 2023, Hi Chi Minh, Vietnam N2 - In the engineering domain, representing real-world objects using a body of data, called a digital twin, which is frequently updated by “live” measurements, has shown various advantages over tradi- tional modelling and simulation techniques. Consequently, urban planners have a strong interest in digital twin technology, since it provides them with a laboratory for experimenting with data before making far-reaching decisions. Realizing these decisions involves the work of professionals in the architecture, engineering and construction (AEC) domain who nowadays collaborate via the methodology of building information modeling (BIM). At the same time, the citizen plays an integral role both in the data acquisition phase, while also being a beneficiary of the improved resource management strategies. In this paper, we present a prototype for a “digital energy twin” platform we designed in cooperation with the city of Regensburg. We show how our extensible platform de- sign can satisfy the various requirements of multiple user groups through a series of data processing solutions and visualizations, in- dicating valuable design and implementation guidelines for future projects. In particular, we focus on two example use cases concern- ing building electricity monitoring and BIM. By implementing a flexible data processing architecture we can involve citizens in the data acquisition process, meeting the demands of modern users regarding maximum transparency in the handling of their data. KW - smart city KW - AI KW - digital twin KW - artificial intelligence KW - urban planning KW - BIM KW - portal system Y1 - 2023 SN - 979-8-4007-0891-6 U6 - https://doi.org/10.1145/3628797.3628936 SP - 8 EP - 15 PB - ACM ER - TY - JOUR A1 - Appelhans, Marie-Luise A1 - Kampmann, Matthias A1 - Mottok, Jürgen A1 - Riederer, Michael A1 - Nagl, Klaus A1 - Steffens, Oliver A1 - Dünnweber, Jan A1 - Wildgruber, Markus A1 - Roth, Julius A1 - Stadler, Timo A1 - Palm, Christoph A1 - Weiß, Martin Georg A1 - Rochholz, Sandra A1 - Bierl, Rudolf A1 - Gschossmann, Andreas A1 - Haug, Sonja A1 - Schmidbauer, Simon A1 - Koch, Anna A1 - Westner, Markus A1 - Bary, Benedikt von A1 - Ellermeier, Andreas A1 - Vögele, Daniel A1 - Maiwald, Frederik A1 - Hierl, Stefan A1 - Schlamp, Matthias A1 - Ehrlich, Ingo A1 - Siegl, Marco A1 - Hüntelmann, Sven A1 - Wildfeuer, Matthias A1 - Brückl, Oliver A1 - Sterner, Michael A1 - Hofrichter, Andreas A1 - Eckert, Fabian A1 - Bauer, Franz A1 - Dawoud, Belal A1 - Rabl, Hans-Peter A1 - Gamisch, Bernd A1 - Schmidt, Ottfried A1 - Heberl, Michael A1 - Thema, Martin A1 - Mayer, Ulrike A1 - Eller, Johannes A1 - Sippenauer, Thomas A1 - Adelt, Christian A1 - Haslbeck, Matthias A1 - Vogl, Bettina A1 - Mauerer, Wolfgang A1 - Ramsauer, Ralf A1 - Lohmann, Daniel A1 - Sax, Irmengard A1 - Gabor, Thomas A1 - Feld, Sebastian A1 - Linnhoff-Popien, Claudia A1 - Ławrowski, Robert Damian A1 - Langer, Christoph A1 - Schreiner, Rupert A1 - Sellmair, Josef ED - Baier, Wolfgang T1 - Forschung 2019 BT - Thema: Künstliche Intelligenz N2 - Bericht mit Forschungsprojekten aus verschiedenen Bereichen der OTH Regensburg mit dem Schwerpunktthema "Künstliche Intelligenz" und einem Gespräch zur "Medizin der Zukunft" T3 - Forschungsberichte der OTH Regensburg - 2019 KW - Forschung KW - Forschungsbericht KW - Künstliche Intelligenz Y1 - 2019 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:898-opus4-7890 SN - 978-3-9818209-7-3 CY - Regensburg ER - TY - CHAP A1 - Melzer, Matthias A1 - Dünnweber, Jan A1 - Baumann, Timo T1 - Towards Smart Home Data Interpretation Using Analogies to Natural Language Processing T2 - 2022 IEEE International Conference on Smart Internet of Things: IEEE SmartIoT 2022, proceedings, 19-21 August 2022, Suzhou, China, hybrid conference (onsite and virtual) N2 - Recent advances in the development of smart homes have led to the availability of a wide variety of devices providing a high level of convenience via gesture and speech control or fully automated operation. Many smart home appliances also address the aspects of safety and electricity savings by automatically powering themselves off after not being used for a while. However, many devices remain in a typical household that are not themselves "smart", or are not primarily electric (such as heating systems). We address the savings aspect by identifying processes involving the use of multiple devices in the electrical flow data, as captured by a smart meter in a modern household, rather than focusing on a single appliance. Therefore, we introduce a novel approach to usage pattern analysis based on the idea that a pattern of device usages as a result of a resident's 'routine' (such as making breakfast) can be interpreted similarly to a natural language 'sentence'; Natural Language Processing (NLP) algorithms can then be used for interpreting the residents' behavior. We introduce the notion of bag-of-devices (BoD), derived from the bag-of-words model used in document classification. In an experiment, we show how we use this model to infer predictions about the inhabitants from device usage, such as the resident leaving for the day or just to fetch the newspaper. KW - IoT KW - AI KW - NLP KW - Smart City Y1 - 2022 SN - 978-1-6654-7952-3 U6 - https://doi.org/10.1109/SmartIoT55134.2022.00020 SP - 65 EP - 71 PB - IEEE ER - TY - CHAP A1 - Stadtler, Timo A1 - Nita, Spyro A1 - Dünnweber, Jan T1 - A Parallel Hybrid Genetic Search for the Capacitated VRP with Pickup and Delivery T2 - 34th International Workshop, LCPC 2021, Newark, DE, USA, October 13–14, 2021 N2 - In the realm of parallel computing, optimization plays a pivotal role in achieving efficient and scalable solutions. In this work, we present the parallelization of a hybrid genetic search for solving the Capacitated Vehicle Routing Problem with Pickup and Delivery (CVRPPD).It leverages the synergy between genetic algorithms and parallel computing to address the complex optimization problem. This hybrid algorithm combines a customized version of local search with a genetic algorithm to compute an effective solution. Our implementation makes use of the Message Passing Interface (MPI) for data distribution and parallel execution. In addition, we run multi-threaded processes on NVIDIA graphical processors using the CUDA technology, which further increases the computation speed and consequently minimizes the runtime. Parallelization also allows the best-improvement strategy to be used instead of the rst-improvement strategy while maintaining the same runtime. We store the resulting routes in a bus route database which we created as the basis of an extensive library of optimal routes for our specifc use case of optimizing bus routes in a rural area. The experimental results on real road data show that the parallel implementation of the Hybrid Genetic Search (HGS) achieves significant improvements in runtime over the sequential implementation above a certain problem size. We believe that our implementation of the parallel hybrid genetic search method can have a great in influence on optimization strategies in parallel computing and can also be applied to other subproblems of the VRP. KW - parallel computing KW - high-performance KW - route planning Y1 - 2023 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:898-opus4-69854 UR - https://opus4.kobv.de/opus4-oth-regensburg/frontdoor/deliver/index/docId/6985/file/duennweber_kentucky_2023.pdf ER - TY - JOUR A1 - Broser, Christian A1 - Falter, Thomas A1 - Ławrowski, Robert Damian A1 - Altenbuchner, Amelie A1 - Vögele, Daniel A1 - Koss, Claus A1 - Schlampp, Matthias A1 - Dunnweber, Jan A1 - Steffens, Oliver A1 - Heckner, Markus A1 - Jaritz, Sabine A1 - Schiegl, Thomas A1 - Corsten, Sabine A1 - Lauer, Norina A1 - Guertler, Katherine A1 - Koenig, Eric A1 - Haug, Sonja A1 - Huber, Dominik A1 - Birkenmaier, Clemens A1 - Krenkel, Lars A1 - Wagner, Thomas A1 - Justus, Xenia A1 - Saßmannshausen, Sean Patrick A1 - Kleine, Nadine A1 - Weber, Karsten A1 - Braun, Carina N. A1 - Giacoppo, Giuliano A1 - Heinrich, Michael A1 - Just, Tobias A1 - Schreck, Thomas A1 - Schnabl, Andreas A1 - Gilmore, Amador Téran A1 - Roeslin, Samuel A1 - Schmid, Sandra A1 - Wellnitz, Felix A1 - Malz, Sebastian A1 - Maurial, Andreas A1 - Hauser, Florian A1 - Mottok, Jürgen A1 - Klettke, Meike A1 - Scherzinger, Stefanie A1 - Störl, Uta A1 - Heckner, Markus A1 - Bazo, Alexander A1 - Wolff, Christian A1 - Kopper, Andreas A1 - Westner, Markus A1 - Pongratz, Christian A1 - Ehrlich, Ingo A1 - Briem, Ulrich A1 - Hederer, Sebastian A1 - Wagner, Marcus A1 - Schillinger, Moritz A1 - Görlach, Julien A1 - Hierl, Stefan A1 - Siegl, Marco A1 - Langer, Christoph A1 - Hausladen, Matthias A1 - Schreiner, Rupert A1 - Haslbeck, Matthias A1 - Kreuzer, Reinhard A1 - Brückl, Oliver A1 - Dawoud, Belal A1 - Rabl, Hans-Peter A1 - Gamisch, Bernd A1 - Schmidt, Ottfried A1 - Heberl, Michael A1 - Gänsbauer, Bianca A1 - Bick, Werner A1 - Ellermeier, Andreas A1 - Monkman, Gareth J. A1 - Prem, Nina A1 - Sindersberger, Dirk A1 - Tschurtschenthaler, Karl A1 - Aurbach, Maximilian A1 - Dendorfer, Sebastian A1 - Betz, Michael A. A1 - Szecsey, Tamara A1 - Mauerer, Wolfgang A1 - Murr, Florian ED - Baier, Wolfgang T1 - Forschung 2018 T3 - Forschungsberichte der OTH Regensburg - 2018 KW - Forschung KW - Forschungsbericht Y1 - 2018 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:898-opus4-13826 SN - 978-3-9818209-5-9 CY - Regensburg ER - TY - CHAP A1 - Völkl, Jakob A1 - Melzer, Matthias A1 - Dünnweber, Jan A1 - Sarkar, Amitrajit T1 - Dynamic Route Planning for a Data Collecting Luggage Transport Service T2 - 18th IEEE International Conference on Control & Automation, June 18-21, 2024, Reykjavík, Iceland N2 - Control and Automation of services of the urban infrastructure offered to citizens and tourists are elementary parts of a smart city. But both rely on a stable supply of data from sensors spread across the whole city, e. g., the fill level sensors of waste bins needed for a waste management tool which we developed in a collaboration with the Regensburg city council for the on-demand collection of waste bins. Europe has a lot of historic cities like Regensburg with narrow streets and huge building walls, some made from granite and fieldstones, which often represents an insurmountable obstacle to wireless data transmission. The reduction of the road traffic volume poses an additional challenge for city planners. By means of networked planning and simulation software, the situation, state and efficiency of citywide logistic services can be monitored and optimized. In the course of such optimizations, we propose the combination of digital and logistic services. As an example, we show that monitoring state information, such as the waste bin fill levels, can be accomplished using the same vehicles and the same planning software, that is used for luggage transportation. Moreover, we describe how we adapted a solver for a variant of the TSP, namely the prize-collecting traveling salesman, to optimize the route planning dynamically. Y1 - 2024 PB - IEEE ER -