In der vorliegenden Arbeit werden mithilfe von Methoden zur numerischen Behandlung schwach besetzter Matrizen O(n³)- und O(n)-Berechnungsalgorithmen für Mehrkörpersysteme aus deren Bewegungsgleichungen abgeleitet. Durch Verwendung von Dualen Basen kann gezeigt werden, dass sich die bezüglich der Berechnungszeit effizienten Algorithmen sowohl auf Systeme mit explizit als auch implizit formulierten Bindungsgleichungen anwenden lassen. Mit diesen gewonnen Erkenntnissen wird die derzeitige Implementierung der vorgestellten Algorithmen im Sprachstandard Modelica untersucht. Es werden Ansatzmöglichkeiten aufgezeigt, mit denen ausgewählte Modelica Compiler große Mehrkörpersysteme effizienter lösen können. Zum einen wird durch eine graphentheoretische Verallgemeinerung des O(n)-Algorithmus dieser direkt in dem freien Modelica Werkzeug OpenModelica umgesetzt. Zum anderen wird die Methode der Subsysteme für den O(n)-Algorithmus vorgestellt. Sie ermöglicht es, beliebig komplexe Teilsysteme als eigenständige Modellelemente zu erstellen. Die Berechnung von kinematischen Schleifen kann auf diese Weise wesentlich beschleunigt werden. Ferner wird gezeigt, dass sich mit der Methode der Subsysteme Modellgleichungen eines idealen homokinetischen Gelenks ableiten lassen, die frei von Zwangsbedingungen sind. Dies führt ebenfalls zu einer schnelleren und robusteren Berechnung.:1. Einleitung 1.1. Motivation 1.2. Präzisierung der Aufgabe 1.3. Aufbau der Arbeit 2. Mechanik der Mehrkörpersysteme 2.1. Bewegungsgleichung des starren Körpers 2.2. Beschreibung einer Bindung 2.3. Bewegungsgleichung eines Mehrkörpersystems 2.4. Zusammenfassung zur Mechanik der Mehrkörpersysteme 3. Lösungsalgorithmen für Mehrkörpersysteme 3.1. Die Graphen eines Mehrkörpersystems 3.2. Lösungsalgorithmen für Systeme mit Baumstruktur 3.3. Lösungsalgorithmen am Beispiel einer ebenen Pendelkette 3.4. Berücksichtigung kinematischer Schleifen 3.5. Zusammenfassung der Lösungsalgorithmen eines Mehrkörpersystems 4. Effiziente Berechnung von Mehrkörpersystemen 4.1. Berechnung von Mehrkörpersystemen basierend auf Modelica 4.2. O(n)-Algorithmus für Modelica Compiler 4.3. O(n)-Algorithmus für Bibliothekselemente 5. Zusammenfassung und Ausblick A. Anhang A.1. Grundlagen der Tensorrechnung A.2. Duale Basis einer Bindung A.3. Herleitung des Subsystems des Viergelenks A.4. Homokinetisches Gelenk als Subsystem / Using methods from sparse matrice theory, O(n³)- and O(n)-algorithms for multibody systems are derived from the equations of motion. The concept of Dual Bases reveals that efficient algorithms for explicit joint descriptions, regarding calculation time, may also be applied to systems which use implicit joint constraints. Consequently, the feasibility of implementing these results in Modelica is examined. This leads to new approaches which enable selected Modelica compilers to solve large multibody systems more efficiently. On the one hand side a graph-theoretic generalization of the O(n)-algorithm has been implemented into the OpenModelica compiler. On the other hand, a method of subsystems for the O(n)-algorithm has been devised. It allows to derive the model equations for arbitrary complex sub-systems which can be implemented as new model elements for an O(n)-algorithm library. This has been carried out for recurring kinematic loops of Mobile Machinery improving simulation speed considerably. Furthermore, it is shown that a fast and robust model of an ideal constant velocity joint can be derived that way.:1. Einleitung 1.1. Motivation 1.2. Präzisierung der Aufgabe 1.3. Aufbau der Arbeit 2. Mechanik der Mehrkörpersysteme 2.1. Bewegungsgleichung des starren Körpers 2.2. Beschreibung einer Bindung 2.3. Bewegungsgleichung eines Mehrkörpersystems 2.4. Zusammenfassung zur Mechanik der Mehrkörpersysteme 3. Lösungsalgorithmen für Mehrkörpersysteme 3.1. Die Graphen eines Mehrkörpersystems 3.2. Lösungsalgorithmen für Systeme mit Baumstruktur 3.3. Lösungsalgorithmen am Beispiel einer ebenen Pendelkette 3.4. Berücksichtigung kinematischer Schleifen 3.5. Zusammenfassung der Lösungsalgorithmen eines Mehrkörpersystems 4. Effiziente Berechnung von Mehrkörpersystemen 4.1. Berechnung von Mehrkörpersystemen basierend auf Modelica 4.2. O(n)-Algorithmus für Modelica Compiler 4.3. O(n)-Algorithmus für Bibliothekselemente 5. Zusammenfassung und Ausblick A. Anhang A.1. Grundlagen der Tensorrechnung A.2. Duale Basis einer Bindung A.3. Herleitung des Subsystems des Viergelenks A.4. Homokinetisches Gelenk als Subsystem

<p>Many products are built from more or less independently developed subsystems. For instance, a car consists of subsystems for transmission, braking, suspension, etc. These subsystems are frequently controlled by an embedded computer system. In the automotive industry, as well as in other application domains, there is currently a trend from an approach where subsystems have dedicated computer hardware and other resources (a federated approach) to an approach where subsystems share hardware and other resources (an integrated approach). This is motivated by a strong pressure to reduce product cost, at the same time as an increasing number of subsystems are being introduced.</p><p>When integrating subsystems, it is desirable that guarantees valid before integration are also valid after integration, since this would eliminate the need for costly reverifications. The computer network is a resource that is typically shared among all subsystems. Hence, a central issue when integrating subsystems is to provide an efficient scheduling of message transmissions on the network. There are essentially three families of schedulers that can be used: priority-driven schedulers that assign priorities to messages, time-driven schedulers that assign specific time-slots for transmission of specific messages, and share-driven schedulers that assign shares of the available network capacity to groups of messages.</p><p>This thesis presents a framework for share-driven scheduling, to be implemented and used in embedded networks, with the aim to facilitate subsystem integration by reducing the risk of interference between subsystems. The framework is applied in the automotive domain.</p><p>The initial parts of the thesis give an overview of systems, subsystems and network technologies found and used in the automotive domain. Then, the share-driven scheduling framework is presented, analytically investigated and proven, as well as evaluated in a simulation study. Finally it is shown how the framework is to be configured and used in the context of subsystem integration. The results show that the framework allows for flexible and efficient scheduling of messages with real-time constraints, facilitating integration of subsystems from a network point of view.</p>

abstract: General-purpose processors propel the advances and innovations that are the subject of humanity’s many endeavors. Catering to this demand, chip-multiprocessors (CMPs) and general-purpose graphics processing units (GPGPUs) have seen many high-performance innovations in their architectures. With these advances, the memory subsystem has become the performance- and energy-limiting aspect of CMPs and GPGPUs alike. This dissertation identifies and mitigates the key performance and energy-efficiency bottlenecks in the memory subsystem of general-purpose processors via novel, practical, microarchitecture and system-architecture solutions. Addressing the important Last Level Cache (LLC) management problem in CMPs, I observe that LLC management decisions made in isolation, as in prior proposals, often lead to sub-optimal system performance. I demonstrate that in order to maximize system performance, it is essential to manage the LLCs while being cognizant of its interaction with the system main memory. I propose ReMAP, which reduces the net memory access cost by evicting cache lines that either have no reuse, or have low memory access cost. ReMAP improves the performance of the CMP system by as much as 13%, and by an average of 6.5%. Rather than the LLC, the L1 data cache has a pronounced impact on GPGPU performance by acting as the bandwidth filter for the rest of the memory subsystem. Prior work has shown that the severely constrained data cache capacity in GPGPUs leads to sub-optimal performance. In this thesis, I propose two novel techniques that address the GPGPU data cache capacity problem. I propose ID-Cache that performs effective cache bypassing and cache line size selection to improve cache capacity utilization. Next, I propose LATTE-CC that considers the GPU’s latency tolerance feature and adaptively compresses the data stored in the data cache, thereby increasing its effective capacity. ID-Cache and LATTE-CC are shown to achieve 71% and 19.2% speedup, respectively, over a wide variety of GPGPU applications. Complementing the aforementioned microarchitecture techniques, I identify the need for system architecture innovations to sustain performance scalability of GPG- PUs in the face of slowing Moore’s Law. I propose a novel GPU architecture called the Multi-Chip-Module GPU (MCM-GPU) that integrates multiple GPU modules to form a single logical GPU. With intelligent memory subsystem optimizations tailored for MCM-GPUs, it can achieve within 7% of the performance of a similar but hypothetical monolithic die GPU. Taking a step further, I present an in-depth study of the energy-efficiency characteristics of future MCM-GPUs. I demonstrate that the inherent non-uniform memory access side-effects form the key energy-efficiency bottleneck in the future. In summary, this thesis offers key insights into the performance and energy-efficiency bottlenecks in CMPs and GPGPUs, which can guide future architects towards developing high-performance and energy-efficient general-purpose processors. / Dissertation/Thesis / Doctoral Dissertation Computer Science 2018

Next generation heterogeneous wireless networks are expected to interwork with Internet Protocol (IP)-based infrastructures. Conventional network services operate like silos in that a specific set of services are offered over a specific type of access network. As access networks evolve to provide IP-based packet access, it becomes attractive to break these “service silos” by offering a converged set of IP-based services to users who may access these services using a number of alternative access networks. This trend has started with third generation cellular mobile networks, which have standardized on the use of the IP Multimedia Subsystem (IMS) to manage user access to a wide variety of multimedia services over the mobile Internet, while facilitating interworking of heterogeneous wireless and landline access networks. The future users of communication systems will subscribe to both IP-based and Circuit Switched (CS) based services and in the foreseeable future a single database that handles user profiles across all domains will be required. Home Subscriber Server (HSS) as an evolved version of Home Location Register (HLR) is one of the key components of IMS. In deploying HSS as a central repository database, in a fully overlapped heterogeneous network setting, changes of access mode are very frequent and conveying this information to HSS imposes excessive signaling load and delay. In our proposed scheme we introduce an Interface Agent (IA) for each location area that caches the location and information about the access mode through which a user can be reached. This method results in significant amount of savings in signaling cost and better delay performance. The existing call delivery approaches in cellular networks may not be well suited for future communication systems because they suffer from unnecessary usage of network resources for call attempts that may fail which adds to excessive signaling delays and queuing costs. Reducing the number of queries and retrievals from the database will have a significant impact on the network performance. We present a new scheme based on Reverse Virtual Call setup (RVC) as a solution to the call delivery problem in heterogeneous wireless networks and evaluate the performance of this framework.

More and more embedded systems choose ARM-based micro-controllers as CPU. If no embedded OS built with the system, the application scope will be restricted. Therefore, the need of embedded OS is vital. There are many embedded OS¡¦s in the market, but the embedded Linux has many advantages and is widely accepted. Commercial embedded Linux takes less refund than other embedded OS¡¦s. The kernel and most applications are distributed in GPL open source copyright, and is highly portable to many machine platforms. Presently, the hardware key-technology is highly skilled. The margin of 3C industrial has gone down rapidly. Therefore, people focus on adapting integrated technology to practicality and innovation to make cost down. Developers choose appropriate ARM micro-controllers according to demanding functionality of their products. The microcontroller is not necessary running with Linux distribution. Two approaches can be used to resolve the embedded OS issue. The first approach is porting Linux to the platform without any refund. The second approach is to pay for commercial Linux. Embedded system peripheral devices aim at powerful functionalities and economy. For instance, UART interface is cheap and low data transfer rate. The target board communicates with host via RS-232. RS-232 acts as serial console to play dumb terminal under Linux. Industrial applications often make use of RS-xxx for UART physical transmission layer. For instance, RS-485 applies modbus protocol to build cheap monitor systems. Network transmission is a necessary function, and it generally achieves high data transfer rate application through Ethernet. The UNIX-like network socket has served network application very well. Embedded systems are usually diskless systems. In order to keep permanent data, using flash memory as block disk system is a widely adapted strategy and which operates flash memory through MTD subsystems¡][28]¡^. An MTD subsystem contains two different modules, ¡§user¡¨and ¡§driver¡¨. In the driver module, CFI¡][40]¡^ is applied to probe flash chip, partition it and provide operating function. Flash translation layer and file-system are applied in the user module. MTD BLOCK is used to emulate the flash partitions as block devices which are then mounted into Linux virtual file system¡]VFS¡^with JFFS2 type, designed according to the feature of flash devices. In this thesis, we will describe in detail the procedure of porting Linux to ARM micro-controllers. The motivation of the work is introduced in chapter 1. In chapter 2, we introduce development tools and the main flow of the porting procedure. In chapter 3, we describe the LH79525 platform and the main perepherals on the target board, then introduce the ARM programmer model. In chapter 4, we examine the required knowledge and the important issues for porting ARM Linux. In chapter 5, we describe the details of porting Linux to run with Sharp LH79525, including modifying the key source codes and adjusting kernel configuration for embedding the UART, ethernet MAC, and MTD subsystem. In chapter 6, we do step-by-step validation and apply an integrated application with the LF-314CP temperature controller¡][46]¡^ by law-chain technology for the LH79525 target board running with the ported ARM Linux. In chapter 7, we present some issues for future work and improvement, then make a conclusion for the thesis.

Final master work proposes accidents fixing in cities GIS subsystem which includes database and map. Two databases conceptual models are formed in scientific work. One of them is choosing for detail projecting based on an accident dim. One parameter (the number of pedestrian passage) in database is involved in addition, not from the accident dim. Record accidents of 2003 year are marked by points on the map of Zirmunai part in Vilnius. Parameters describing accidents are saving in attributes table. Data of accidents were taken from archive of Vilnius road police. GIS subsystem projecting process, usage opportunity and users are presenting in this scientific work.

Nowadays the complexity and size of business systems is growing steadily and, as practise shows, the situation is not going to change in the nearest future. This necessitates difficulties not only for lifecycle of programmes’ development but for maintenance and expansibility also. That’s why, solving them, requires a broader perspective that views the system as consisting of other systems. This work looks what kind of methods can be applied in this context. The analysis of modern technologies (Java programming language) and modelling methods (functional decomposition and object-oriented system engineering) are presented. Suggested system decomposition approach is the synthesis of already existing ones. In this work new method has been applied for the development of experimental Information System of Territorial Departments of Environmental Inspection. The prototype of the mentioned system has been realized by using J2EE (Java 2, Enterprise Edition) technologies. Developed software implements the requirements for usage and maintenance (large number of the users, security rights, compatibility, centralised administration, etc.) of large distributed systems. Suggested approach may be used while expanding the existing software or developing similar applications.

Next generation heterogeneous wireless networks are expected to interwork with Internet Protocol (IP)-based infrastructures. Conventional network services operate like silos in that a specific set of services are offered over a specific type of access network. As access networks evolve to provide IP-based packet access, it becomes attractive to break these “service silos” by offering a converged set of IP-based services to users who may access these services using a number of alternative access networks. This trend has started with third generation cellular mobile networks, which have standardized on the use of the IP Multimedia Subsystem (IMS) to manage user access to a wide variety of multimedia services over the mobile Internet, while facilitating interworking of heterogeneous wireless and landline access networks. The future users of communication systems will subscribe to both IP-based and Circuit Switched (CS) based services and in the foreseeable future a single database that handles user profiles across all domains will be required. Home Subscriber Server (HSS) as an evolved version of Home Location Register (HLR) is one of the key components of IMS. In deploying HSS as a central repository database, in a fully overlapped heterogeneous network setting, changes of access mode are very frequent and conveying this information to HSS imposes excessive signaling load and delay. In our proposed scheme we introduce an Interface Agent (IA) for each location area that caches the location and information about the access mode through which a user can be reached. This method results in significant amount of savings in signaling cost and better delay performance. The existing call delivery approaches in cellular networks may not be well suited for future communication systems because they suffer from unnecessary usage of network resources for call attempts that may fail which adds to excessive signaling delays and queuing costs. Reducing the number of queries and retrievals from the database will have a significant impact on the network performance. We present a new scheme based on Reverse Virtual Call setup (RVC) as a solution to the call delivery problem in heterogeneous wireless networks and evaluate the performance of this framework.

Many products are built from more or less independently developed subsystems. For instance, a car consists of subsystems for transmission, braking, suspension, etc. These subsystems are frequently controlled by an embedded computer system. In the automotive industry, as well as in other application domains, there is currently a trend from an approach where subsystems have dedicated computer hardware and other resources (a federated approach) to an approach where subsystems share hardware and other resources (an integrated approach). This is motivated by a strong pressure to reduce product cost, at the same time as an increasing number of subsystems are being introduced. When integrating subsystems, it is desirable that guarantees valid before integration are also valid after integration, since this would eliminate the need for costly reverifications. The computer network is a resource that is typically shared among all subsystems. Hence, a central issue when integrating subsystems is to provide an efficient scheduling of message transmissions on the network. There are essentially three families of schedulers that can be used: priority-driven schedulers that assign priorities to messages, time-driven schedulers that assign specific time-slots for transmission of specific messages, and share-driven schedulers that assign shares of the available network capacity to groups of messages. This thesis presents a framework for share-driven scheduling, to be implemented and used in embedded networks, with the aim to facilitate subsystem integration by reducing the risk of interference between subsystems. The framework is applied in the automotive domain. The initial parts of the thesis give an overview of systems, subsystems and network technologies found and used in the automotive domain. Then, the share-driven scheduling framework is presented, analytically investigated and proven, as well as evaluated in a simulation study. Finally it is shown how the framework is to be configured and used in the context of subsystem integration. The results show that the framework allows for flexible and efficient scheduling of messages with real-time constraints, facilitating integration of subsystems from a network point of view.

Next generation heterogeneous wireless networks are expected to interwork with Internet Protocol (IP)-based infrastructures. Conventional network services operate like silos in that a specific set of services are offered over a specific type of access network. As access networks evolve to provide IP-based packet access, it becomes attractive to break these “service silos” by offering a converged set of IP-based services to users who may access these services using a number of alternative access networks. This trend has started with third generation cellular mobile networks, which have standardized on the use of the IP Multimedia Subsystem (IMS) to manage user access to a wide variety of multimedia services over the mobile Internet, while facilitating interworking of heterogeneous wireless and landline access networks. The future users of communication systems will subscribe to both IP-based and Circuit Switched (CS) based services and in the foreseeable future a single database that handles user profiles across all domains will be required. Home Subscriber Server (HSS) as an evolved version of Home Location Register (HLR) is one of the key components of IMS. In deploying HSS as a central repository database, in a fully overlapped heterogeneous network setting, changes of access mode are very frequent and conveying this information to HSS imposes excessive signaling load and delay. In our proposed scheme we introduce an Interface Agent (IA) for each location area that caches the location and information about the access mode through which a user can be reached. This method results in significant amount of savings in signaling cost and better delay performance. The existing call delivery approaches in cellular networks may not be well suited for future communication systems because they suffer from unnecessary usage of network resources for call attempts that may fail which adds to excessive signaling delays and queuing costs. Reducing the number of queries and retrievals from the database will have a significant impact on the network performance. We present a new scheme based on Reverse Virtual Call setup (RVC) as a solution to the call delivery problem in heterogeneous wireless networks and evaluate the performance of this framework. / Applied Science, Faculty of / Electrical and Computer Engineering, Department of / Graduate