Self-adaptivity of applications on network on chip multiprocessors: the case of fault-tolerant Kahn process networks

Technology scaling accompanied with higher operating frequencies and the ability to integrate more functionality in the same chip has been the driving force behind delivering higher performance computing systems at lower costs. Embedded computing systems, which have been riding the same wave of success, have evolved into complex architectures encompassing a high number of cores interconnected by an on-chip network (usually identified as Multiprocessor System-on-Chip). However these trends are hindered by issues that arise as technology scaling continues towards deep submicron scales. Firstly, growing complexity of these systems and the variability introduced by process technologies make it ever harder to perform a thorough optimization of the system at design time. Secondly, designers are faced with a reliability wall that emerges as age-related degradation reduces the lifetime of transistors, and as the probability of defects escaping post-manufacturing testing is increased. In this thesis, we take on these challenges within the context of streaming applications running in network-on-chip based parallel (not necessarily homogeneous) systems-on-chip that adopt the no-remote memory access model. In particular, this thesis tackles two main problems: (1) fault-aware online task remapping, (2) application-level self-adaptation for quality management. For the former, by viewing fault tolerance as a self-adaptation aspect, we adopt a cross-layer approach that aims at graceful performance degradation by addressing permanent faults in processing elements mostly at system-level, in particular by exploiting redundancy available in multi-core platforms. We propose an optimal solution based on an integer linear programming formulation (suitable for design time adoption) as well as heuristic-based solutions to be used at run-time. We assess the impact of our approach on the lifetime reliability. We propose two recovery schemes based on a checkpoint-and-rollback and a rollforward technique. For the latter, we propose two variants of a monitor-controller- adapter loop that adapts application-level parameters to meet performance goals. We demonstrate not only that fault tolerance and self-adaptivity can be achieved in embedded platforms, but also that it can be done without incurring large overheads. In addressing these problems, we present techniques which have been realized (depending on their characteristics) in the form of a design tool, a run-time library or a hardware core to be added to the basic architecture

Optimal resource allocation algorithms for cloud computing

Cloud computing is emerging as an important platform for business, personal and mobile computing applications. We consider a stochastic model of a cloud computing cluster, where jobs arrive according to a random process and request virtual machines (VMs), which are specified in terms of resources such as CPU, memory and storage space. The jobs are first routed to one of the servers when they arrive and are queued at the servers. Each server then chooses a set of jobs from its queues so that it has enough resources to serve all of them simultaneously. There are many design issues associated with such systems. One important issue is the resource allocation problem, i.e., the design of algorithms for load balancing among servers, and algorithms for scheduling VM configurations. Given our model of a cloud, we define its capacity, i.e., the maximum rates at which jobs can be processed in such a system. An algorithm is said to be throughput-optimal if it can stabilize the system whenever the load is within the capacity region. We show that the widely-used Best-Fit scheduling algorithm is not throughput-optimal. We first consider the problem where the jobs need to be scheduled nonpreemptively on servers. Under the assumptions that the job sizes are known and bounded, we present algorithms that achieve any arbitrary fraction of the capacity region of the cloud. We then relax these assumptions and present a load balancing and scheduling algorithm that is throughput optimal when job sizes are unknown. In this case, job sizes (durations) are modeled as random variables with possibly unbounded support. Delay is a more important metric then throughput optimality in practice. However, analysis of delay of resource allocation algorithms is difficult, so we study the system in the asymptotic limit as the load approaches the boundary of the capacity region. This limit is called the heavy traffic regime. Assuming that the jobs can be preempted once after several time slots, we present delay optimal resource allocation algorithms in the heavy traffic regime. We study delay performance of our algorithms through simulations

Performance of Computer Systems; Proceedings of the 4th International Symposium on Modelling and Performance Evaluation of Computer Systems, Vienna, Austria, February 6-8, 1979

These proceedings are a collection of contributions to computer system performance, selected by the usual refereeing process from papers submitted to the symposium, as well as a few invited papers representing significant novel contributions made during the last year. They represent the thrust and vitality of the subject as well as its capacity to identify important basic problems and major application areas. The main methodological problems appear in the underlying queueing theoretic aspects, in the deterministic analysis of waiting time phenomena, in workload characterization and representation, in the algorithmic aspects of model processing, and in the analysis of measurement data. Major areas for applications are computer architectures, data bases, computer networks, and capacity planning. The international importance of the area of computer system performance was well reflected at the symposium by participants from 19 countries. The mixture of participants was also evident in the institutions which they represented: 35% from universities, 25% from governmental research organizations, but also 30% from industry and 10% from non-research government bodies. This proves that the area is reaching a stage of maturity where it can contribute directly to progress in practical problems

Reliability models and analyses of the computing systems

Ph.DDOCTOR OF PHILOSOPH

A study of teletraffic problems in multicast networks

This dissertation studies teletraffic engineering of dynamic multicast connections. The traditional models in teletraffic engineering do not handle multicast connections properly, since in a dynamic multicast tree, users may join and leave the connection freely, and thus the multicast tree evolves in time. A model called multicast loss system is used to calculate blocking probabilities in a single link and in tree-type networks. In a single link case, the problem is a generalised Engset problem, and a method for calculating call blocking probabilities for users is presented. Application of the reduced load approximation for multicast connections is studied. Blocking probabilities in a cellular system are studied by means of simulation. The analysis is mainly concentrated on tree type networks, where convolution-truncation algorithms and simulation methods for solving the blocking probabilities exactly are derived. Both single layer and hierarchically coded streams are treated. The presented algorithms reduce significantly the computational complexity of the problem, compared to direct calculation from the system state space. An approximative method is given for background traffic. The simulation method presented is an application of the Inverse Convolution Monte-Carlo method, and it gives a considerable variance reduction, and thus allows simulation with smaller sample sizes than with traditional simulation methods. Signalling load for dynamic multicast connections in a node depends on the shape of the tree as well as the location of the node in the tree. This dissertation presents a method for calculating the portion of signalling load that is caused by call establishments and tear-downs.reviewe

Some aspects of traffic control and performance evaluation of ATM networks

The emerging high-speed Asynchronous Transfer Mode (ATM) networks are expected to integrate through statistical multiplexing large numbers of traffic sources having a broad range of statistical characteristics and different Quality of Service (QOS) requirements. To achieve high utilisation of network resources while maintaining the QOS, efficient traffic management strategies have to be developed. This thesis considers the problem of traffic control for ATM networks. The thesis studies the application of neural networks to various ATM traffic control issues such as feedback congestion control, traffic characterization, bandwidth estimation, and Call Admission Control (CAC). A novel adaptive congestion control approach based on a neural network that uses reinforcement learning is developed. It is shown that the neural controller is very effective in providing general QOS control. A Finite Impulse Response (FIR) neural network is proposed to adaptively predict the traffic arrival process by learning the relationship between the past and future traffic variations. On the basis of this prediction, a feedback flow control scheme at input access nodes of the network is presented. Simulation results demonstrate significant performance improvement over conventional control mechanisms. In addition, an accurate yet computationally efficient approach to effective bandwidth estimation for multiplexed connections is investigated. In this method, a feed forward neural network is employed to model the nonlinear relationship between the effective bandwidth and the traffic situations and a QOS measure. Applications of this approach to admission control, bandwidth allocation and dynamic routing are also discussed. A detailed investigation has indicated that CAC schemes based on effective bandwidth approximation can be very conservative and prevent optimal use of network resources. A modified effective bandwidth CAC approach is therefore proposed to overcome the drawback of conventional methods. Considering statistical multiplexing between traffic sources, we directly calculate the effective bandwidth of the aggregate traffic which is modelled by a two-state Markov modulated Poisson process via matching four important statistics. We use the theory of large deviations to provide a unified description of effective bandwidths for various traffic sources and the associated ATM multiplexer queueing performance approximations, illustrating their strengths and limitations. In addition, a more accurate estimation method for ATM QOS parameters based on the Bahadur-Rao theorem is proposed, which is a refinement of the original effective bandwidth approximation and can lead to higher link utilisation

Synchronization in dynamical networks:synchronizability, neural network models and EEG analysis

Complex dynamical networks are ubiquitous in many fields of science from engineering to biology, physics, and sociology. Collective behavior, and in particular synchronization,) is one of the most interesting consequences of interaction of dynamical systems over complex networks. In this thesis we study some aspects of synchronization in dynamical networks. The first section of the study discuses the problem of synchronizability in dynamical networks. Although synchronizability, i.e. the ease by which interacting dynamical systems can synchronize their activity, has been frequently used in research studies, there is no single interpretation for that. Here we give some possible interpretations of synchronizability and investigate to what extent they coincide. We show that in unweighted dynamical networks different interpretations of synchronizability do not lie in the same line, in general. However, in networks with high degrees of synchronization properties, the networks with properly assigned weights for the links or the ones with well-performed link rewirings, the different interpretations of synchronizability go hand in hand. We also show that networks with nonidentical diffusive connections whose weights are assigned using the connection-graph-stability method are better synchronizable compared to networks with identical diffusive couplings. Furthermore, we give an algorithm based on node and edge betweenness centrality measures to enhance the synchronizability of dynamical networks. The algorithm is tested on some artificially constructed dynamical networks as well as on some real-world networks from different disciplines. In the second section we study the synchronization phenomenon in networks of Hindmarsh-Rose neurons. First, the complete synchronization of Hindmarsh-Rose neurons over Newman-Watts networks is investigated. By numerically solving the differential equations of the dynamical network as well as using the master-stability-function method we determine the synchronizing coupling strength for diffusively coupled Hindmarsh-Rose neurons. We also consider clustered networks with dense intra-cluster connections and sparse inter-cluster links. In such networks, the synchronizability is more influenced by the inter-cluster links than intra-cluster connections. We also consider the case where the neurons are coupled through both electrical and chemical connections and obtain the synchronizing coupling strength using numerical calculations. We investigate the behavior of interacting locally synchronized gamma oscillations. We construct a network of minimal number of neurons producing synchronized gamma oscillations. By simulating giant networks of this minimal module we study the dependence of the spike synchrony on some parameters of the network such as the probability and strength of excitatory/inhibitory couplings, parameter mismatch, correlation of thalamic input and transmission time-delay. In the third section of the thesis we study the interdependencies within the time series obtained through electroencephalography (EEG) and give the EEG specific maps for patients suffering from schizophrenia or Alzheimer's disease. Capturing the collective coherent spatiotemporal activity of neuronal populations measured by high density EEG is addressed using measures estimating the synchronization within multivariate time series. Our EEG power analysis on schizophrenic patients, which is based on a new parametrization of the multichannel EEG, shows a relative increase of power in alpha rhythm over the anterior brain regions against its reduction over posterior regions. The correlations of these patterns with the clinical picture of schizophrenia as well as discriminating of the schizophrenia patients from normal control subjects supports the concept of hypofrontality in schizophrenia and renders the alpha rhythm as a sensitive marker of it. By applying a multivariate synchronization estimator, called S-estimator, we reveal the whole-head synchronization topography in schizophrenia. Our finding shows bilaterally increased synchronization over temporal brain regions and decreased synchronization over the postcentral/parietal brain regions. The topography is stable over the course of several months as well as over all conventional EEG frequency bands. Moreover, it correlates with the severity of the illness characterized by positive and negative syndrome scales. We also reveal the EEG features specific to early Alzheimer's disease by applying multivariate phase synchronization method. Our analyses result in a specific map characterized by a decrease in the values of phase synchronization over the fronto-temporal and an increase over temporo-parieto-occipital region predominantly of the left hemisphere. These abnormalities in the synchronization maps correlate with the clinical scores associated to the patients and are able to discriminate patients from normal control subjects with high precision