Graph Pattern Matching on Symmetric Multiprocessor Systems

Graph-structured data can be found in nearly every aspect of today's world, be it road networks, social networks or the internet itself. From a processing perspective, finding comprehensive patterns in graph-structured data is a core processing primitive in a variety of applications, such as fraud detection, biological engineering or social graph analytics. On the hardware side, multiprocessor systems, that consist of multiple processors in a single scale-up server, are the next important wave on top of multi-core systems. In particular, symmetric multiprocessor systems (SMP) are characterized by the fact, that each processor has the same architecture, e.g. every processor is a multi-core and all multiprocessors share a common and huge main memory space. Moreover, large SMPs will feature a non-uniform memory access (NUMA), whose impact on the design of efficient data processing concepts should not be neglected. The efficient usage of SMP systems, that still increase in size, is an interesting and ongoing research topic. Current state-of-the-art architectural design principles provide different and in parts disjunct suggestions on which data should be partitioned and or how intra-process communication should be realized. In this thesis, we propose a new synthesis of four of the most well-known principles Shared Everything, Partition Serial Execution, Data Oriented Architecture and Delegation, to create the NORAD architecture, which stands for NUMA-aware DORA with Delegation. We built our research prototype called NeMeSys on top of the NORAD architecture to fully exploit the provided hardware capacities of SMPs for graph pattern matching. Being an in-memory engine, NeMeSys allows for online data ingestion as well as online query generation and processing through a terminal based user interface. Storing a graph on a NUMA system inherently requires data partitioning to cope with the mentioned NUMA effect. Hence, we need to dissect the graph into a disjunct set of partitions, which can then be stored on the individual memory domains. This thesis analyzes the capabilites of the NORAD architecture, to perform scalable graph pattern matching on SMP systems. To increase the systems performance, we further develop, integrate and evaluate suitable optimization techniques. That is, we investigate the influence of the inherent data partitioning, the interplay of messaging with and without sufficient locality information and the actual partition placement on any NUMA socket in the system. To underline the applicability of our approach, we evaluate NeMeSys against synthetic datasets and perform an end-to-end evaluation of the whole system stack on the real world knowledge graph of Wikidata

Mathematical modelling of gas flow networks in pellet induratlon systems

The objective of this research is to develop a simulation software tool, GASFLO, which should evaluate pressure, flow and temperature distributions of process gas in pellet induration system networks. Pellet induration systems are complex industrial systems composed of heterogenous components. The magnitude of gas through leaks i.e. the air entering or leaving the system from the points other than the known exits, is substantial and it adversely effects the performance of induration process. These leaks are very difficult to measure because of the hostile environment in the plant. The modelling of such industrial systems requires a notable amount of experimentation so the tool has been designed to enable the user modeller to change the component models and solution algorithms easily. The conventional methods for flow network simulation are based on process centred approach, mostly composed of homogeneous components. For ease of computation, the non-pipe elements are modelled with an approximate linear or non-linear generic equation, whose coefficients can simulate different states of the element. The resulting set of non-linear equations is linearised and solved simultaneously using some iterative method. By contrast, GASFLO is based on device centred or unit based approach, and uses a two level hierarchical solution algorithm. The pellet induration system network is first idealised into a connected graph of streams (sets of serially connected components) and nodes. At the top or coordination level the flow and pressure distributions satisfying the Kirchhoff's laws are evaluated for the connected graph. At the lower or component level the exact mathematical models of components ale computed, in order of their occurrence in respective streams, using coordination variables as parameters. The converged flows are used for the temperature computation. The solution algorithm requires partitioning of the connected graph into forest and coforest structures, for which secondary algorithms have been developed using specific heuristics relevant to the pellet induration systems. The rigorous application of software engineering techniques for the design and implementation of software, enabled the resolution of the complexity of the modelled system, embedded the characteristics of 'quality software' into the resulting code and benefits from object orientation, even though it is implemented in standard FORTRAN 77. GASFLO predicted results are in a good agreement with the measured results, it has been validated for a real life pellet induration system. It has been applied to simulate several practical scenarios, like addition of extra wind boxes to the zones and to determine how the plant production can be increased by certain ratio, such simulations were not feasible otherwise. GASFLO takes less than a minute to simulate a real-life pellet induration system on a 486 PC. The combined simulation with an other software tool, INDSYS, which evaluates the heat distribution in the solids, is also feasible

Technology Made Legible: A Cultural Study of Software as a Form of Writing in the Theories and Practices of Software Engineering

My dissertation proposes an analytical framework for the cultural understanding of the group of technologies commonly referred to as 'new' or 'digital'. I aim at dispelling what the philosopher Bernard Stiegler calls the 'deep opacity' that still surrounds new technologies, and that constitutes one of the main obstacles in their conceptualization today. I argue that such a critical intervention is essential if we are to take new technologies seriously, and if we are to engage with them on both the cultural and the political level. I understand new technologies as technologies based on software. I therefore suggest that a complex understanding of technologies, and of their role in contemporary culture and society, requires, as a preliminary step, an investigation of how software works. This involves going beyond studying the intertwined processes of its production, reception and consumption - processes that typically constitute the focus of media and cultural studies. Instead, I propose a way of accessing the ever present but allegedly invisible codes and languages that constitute software. I thus reformulate the problem of understanding software-based technologies as a problem of making software legible. I build my analysis on the concept of software advanced by Software Engineering, a technical discipline born in the late 1960s that defines software development as an advanced writing technique and software as a text. This conception of software enables me to analyse it through a number of reading strategies. I draw on the philosophical framework of deconstruction as formulated by Jacques Derrida in order to identify the conceptual structures underlying software and hence 'demystify' the opacity of new technologies. Ultimately, I argue that a deconstructive reading of software enables us to recognize the constitutive, if unacknowledged, role of technology in the formation of both the human and academic knowledge. This reading leads to a self-reflexive interrogation of the media and cultural studies' approach to technology and enhances our capacity to engage with new technologies without separating our cultural understanding from our political practices