Survey and Analysis of Production Distributed Computing Infrastructures

A System Perspective on Business Models

Dear SCPE Reader, We present a selection of papers which are extensions of papers presented at the 7-th International Symposium on Parallel and Distributed Computing, 1–5 July 2008, in Krakow, Poland. The motivation for publishing the selection in the SCPE Journal was, on the one hand, to present the flavour of the research reported at the conference and on the other hand to present some of the most relevant topics currently focused on the research on parallel and distributed computing in general. The selection contains only 6 papers out of about 60 presented at the conference, and thus, is far from covering all relevant topics represented at the ISPDC 2008. This is because not all of the invited authors were patient enough to accept a fairly long paper publishing process. Nevertheless, we hope that the presented papers will bring you closer to the research covered by the ISPDC conferences and will encourage you to participate in future ISPDC editions. The first paper ``The Impact of Workload Variability on Load Balancing Algorithms'' is by Marta Beltran and Antonio Guzman from King Juan Carlos University in Spain. It concerns an important topic of load balancing in cluster systems, namely adaptativity of the load balancing algorithms to changes of the workload in the system. Adequate accounting for additional load in the hosting system is of great relevance for correct optimization effects. The paper presents a thorough formal analysis of the workload variability metrics and their influence on the quality of load balancing algorithms. Four basic activities appearing in load balancing algorithms are identified, and based on them some algorithmic solutions are proposed to correctly deal with workload variability in system load balancing. The problem of dynamic load balancing algorithms robustness has been discussed. Two different robustness metrics sensitive to the applied type of opimization: local task-oriented or a global one enable selecting task remote execution or migration as load balancing operations. The proposed approach is illustrated with experiments. The second paper ``Model-Driven Engineering and Formal Validation of High-Performance Embedded Systems'' is by Abdoulaye Gamatie, Eric Rutten, Huafeng Yu, Pierre Boulet, Jean-Luc Dekeyser, from University of Lille and INRIA in France. The paper is concerned with a very advanced methodology of designing correct parallel embedded systems for intensive data-parallel computing. In their previous research, the authors of the paper designed the GASPARD embedded system design framework. It is based on the hardware/software co-design approach through model-driven engineering. The framework is based on an UML-like model specification language in which hardware and software elements are modelled using a component approach with special mechanisms for repetitive structures. This paper tries to combine the modelling framework of GASPARD with the mechanisms of synchronous languages to achieve design verifiability provided for such languages. The paper shows how GASPARD models can be translated into synchronous models based on data flow equations in order to formally check their correctness. The proposed approach is illustrated with an example of a video processing system. The third paper ``Relations Between Several Parallel Computational Models'' is by Stephan Bruda and Yuanqiao Zhang from Bishop’s University in Canada. The paper is concerned with theoretical aspects of shared memory systems described by the parallel random access machine PRAM model and aims in studying performance properties of different types of PRAM systems. The attention is focussed on analysing the computational power of two more sophisticated PRAM models (Combining CRCW and Broadcast Selective Reduction), which include data reduction in case of concurrent writes. The paper shows that these two models have equivalent computational power, which is a new result comparing the existing literature. The performance of both models applied to reconfigurable multiple bus machines was studied as a possible architectural solution for current VLSI processor implementations. It was shown that in such systems under reasonable assumptions concurrent-write does not enhance performance comparing the exclusive-write model. Another result important for the VLSI technology is that the Combining CRCW PRAM model (in which data of concurrent writes are arthmetically or logically combined before write) and the exclusive-write on directed reconfigurable busses perform in equivalent way under strong real-time requirements. The fourth paper ``Experiences with Mesh-Like Computations Using Prediction Binary Trees'' is by Gennaro Cordasco, Biagio Cosenza, Rosario de Chiara, Ugo Erra and Vittorio Scarano from the University ``degli Studi'' of Salerno and the University ``degli Studi della Biasilicata'' of Potenza in Italy. The paper concerns optimization methods for mesh-like computations in clusters of processors. The computations are perfomed assuming a phase-like program execution control using a tiling approach which reduces inter-processor communication. A temporal coherence is also assumed, which means that task sizes provide similar execution times in consecutive phases. Temporary coherent computations are structured in a Prediction Binary Tree, in which leaves represent computing tiles to be mapped to processors. A phase-by-phase semi-static load balancing is introduced to the scheduling algorithm. The scheduling algorithm is equipped with a predictor, which estimates the computation time of next phase tiles based on previous execution times and modifies the tiles to achieve balanced execution in phases. For this, two heuristics are used to leverage on data locality in processors. The proposed approach is illustrated by the example of interactive rendering with Parallel Ray Tracing algorithm. The fifth paper ``The Influence of the IBM pSeries Servers Virtualization Mechanism on Dynamic Resource Allocation in AIX 5L'' is by Maciej Mlynski from ASpartner Limited in Poland. The paper concerns a very up-to-date problem of system virtualization and presents the results of research carried on IBM pSeries servers. IBM is strongly developing the virtualization technique especially on IBM pSeries servers enabling an improved and flexible sharing of system resources between applications. The paper investigates novel facilities for dynamic resource management such as micro-partitioning and partition load manager. They enable dynamic creation of workload logical partitions of system resources and their dynamic mangement. It includes run-time resource re-alocation between logical partitions including setting of sharing specifications as well as run-time adding/removing/setting parameters of resources in the system. It remains an open question how to properly tune parameters of the operating system using the provided virtualization facilities to obtain the best efficiency for a given application program. The paper presents the results of experiments which study the effects of tuning the disk subsystem parameters under the IBM AIX 5L operating system with the use of the provided virtualization facilities on the resulting application execution performance. The results show that even small deterioration in the resource pool status requires an immediate adaptation of the operating system parameters to maintain the required performance. The sixth paper ``HeteroPBLAS: A Set of Parallel Basic Linear Algebra Subprograms Optimized for Heterogeneous Computational Clusters'' is by Ravi Reddy, Alexey Lastovetsky and Pedro Alonso from University College Dublin in Ireland and Polytechnic University of Valencia in Spain. The paper concerns the methodology for parallelization of linear algebra computations for execution in heterogeneous cluster environments. The design of the HeteroPBLAS library (Parallel Basic Linear Algebra Subprograms) for heterogeneous computational clusters is presented. The main contribution of the paper is the automation of the parallelization and optimization of the PBLAS, which is done by means of a special user interface and the underlying set of functions. An important element is here a performance model that is based on program code instrumentation, which determines parameters of the application and the executive heterogeneous platform relevant for execution performance of parallel code. The parameter values specified for or returned by execution of the performance model functions are next used for generation and optimal mapping of the parallel code of the library subroutines. The proposed approach is illustrated by experimental results of execution of optimized HeteroPBLAS programs on homogeneous and heterogeneous computing clusters. Marek Tudruj

Magnetic bearings are systems capable of supporting rotors in absence of mechanical contact. Among many advantages with respect to ball and roller bearings are the possibilities of operating at extremely high rotational speeds and free of maintenance. Nevertheless, classical active magnetic bearings (AMB) are costly systems and may suffer from reliability problems. The most common types of passive magnetic bearings (PMB) based on the use of permanent magnet and reluctance forces are robust and relatively cheap but are affected by an intrinsic stability problem related to negative stiffness. The alternative of superconducting bearings has to deal with the difficulties for guaranteeing low temperatures for the superconducting materials to work; this represents a barrier for this technology. In the last decades an alternative for obtaining stable passive magnetic levitation has been searched, leading to the development of electrodynamic bearings. These systems, capable of realizing electrodynamic suspension for rotors using regular materials at room temperature, may be an alternative for the suspension of high rotational speed machines in the near future. The technological solutions proposed are still unable of devising a system capable of demonstrating the feasibility of this concept. Introduced in this context, this doctoral dissertation aims at developing models and design procedures to bring electrodynamic levitation of rotors closer to industrial applications. To this end, a large portion of the work is devoted to develop a unified model for representing the electromechanical interaction between rotor and stator generated by electrodynamic bearings of different types, namely homopolar and heteropolar configurations. The electromechanical model is developed taking advantage of the complex coordinate representation, typical in rotordynamics, in order to enable easy integration of the bearing's model with different rotordynamic models. An experimental validation of the model is carried out for homopolar configurations. The study of the dynamics of rotors on electrodynamic bearings is probably one of the most important aspects that must be dealt with before the bearings can reach the technological development needed to become industrially available. Bearing this in mind, the dynamics of a Jeffcott rotor and that of a four degree of freedom rotor are studied devoting special attention to the study of stability demonstrating the presence of unstable cylindrical and conical modes. The unbalance and frequency responses of the rotor on electrodynamic bearings are used to evidence the advantages and drawbacks between homopolar and heteropolar configurations. The studies are conduced using the state space formalism to obtain easy to manipulate system models. The modelling of the suspension evidences the strong coupling between the subsystems, showing that the influence of each subsystem on the rotordynamic stability is not obvious, thus complicating the design of the whole suspension. Considering an iterative design approach, the design of a test rig is presented. It is designed to test the validity of the models and the feasibility of radial electrodynamic suspension. A the mechanical layout of the test rig is developed to deal with the stability aspects introduced by the use of electrodynamic bearings.

i»? A. A. Helal, A. A. Heddaya, and B. B. Bhargrava Kluwer Academic Publishers, Boston, 1996, 176 pp. ISBN 0-7923-9800-9, $118.50 Computing in the 1990s has reached the state of distributed computing. A basis of this form of computing is a distributed computing system, which is built on the following three components: (a) personal computers, (b) local and fast wide area networks, and (c) system and application software. By amalgamating computers and networks into one single computing system and providing an appropriate system software, a distributed computing system has created the possibility of sharing information and peripheral resources. Furthermore, these systems improved performance of a computing system and individual users through parallel execution of programs, load balancing and sharing, and replication of programs and data. Distributed computing systems are also characterized by enhanced availability, and increased reliability. Replication is the key to providing high availability, fault tolerance, and enhanced performance in a distributed computing system. As companies move toward systems that are more open and distributed, replication is becoming increasingly important in the ability to provide data and services that are current, correct and available, which is a key factor in maintaining a competitive advantage over rivals. However, replication has also generated some serious challenges. For example, when a replica is updated, how do we propagate such an update to other replicas? If multiple replicas are updated simultaneously and some of the updates conflict one another, how do we resolve the conflict? How do we deal with the situation where a replica is down and then subsequently recovered? How do we deal with network partitions? Not surprisingly, considerable research efforts have been directed towards the solution of these challenges. However, most of the research results are scattered among many journals, conference proceedings, theses, and technical reports. The book by Helal, Heddaya and Bhargava has gathered the best material of these research results and formed a coherent collection that includes definitions, theoretical background, algorithms, annotated bibliographies of commercial and experimental prototype systems, and more than 200 references. This book classifies the entities that can be replicated on a distributed computing system into the following categories: (a) data, (b) process, (c) objects, and (d) messages. After the introduction on the goals and main approaches of replication techniques, the book uses individual chapters to describe major methods for each of the above replication categories. The main focus of this part, however, is on the replication of data. The book also contains two chapters on the replication issues in heterogeneous, mobile, and large-scale systems, and on the future of replication techniques. Apart from the normal chapters, the book contains a rich set of appendices that are very useful for further studies of replication techniques. These appendices include brief descriptions of two dozen commercial and experimental systems that use replication techniques, annotated bibliographies of selected literature on various topics of replication, and an introduction on serializability theory. Each annotated bibliography contains an overview of the specific topic and is written by an invited expert in that field. The combination of the normal chapters and appendices cover the entire spectrum of replication, from definitions, concepts, theories, algorithms, techniques, to systems. The book serves as an excellent introduction and roadmap to the issues of replication. Although it does not provide a detailed description of every replication techniques and systems, the book covers most of the fundamental work that allows the reader to understand the roots of these techniques and systems, and to find the ways to search for the details. This book is a valuable reference book for anyone studying replication techniques or implementing replication systems, specifically, it can be very useful to post-graduate students, practitioners, and beginning researchers of this exciting field. Wanlei Zhou, School of Computing and Mathematics, Deakin University

At first thought, one may not realize the need for a special issue of Parallel and Distributed Computing Practices focused on Cluster Computing when our community has already invested years of research and spent a wealth of resources on traditional Big Iron supercomputers, for instance, the SGI/Cray Origin and IBM SP. Academia, industry, and national laboratories are still using, and for the foreseeable future, will continue to use, supercomputers to solve both grand-challenge scale and high-throughput applications. Then why the interest and new popularity of research into clusters for high-performance parallel and distributed applications? Clusters incorporate the tremendous successes that are attributable to our parallel and distributed processing community. Over the next decade, clusters will span the entire range of high-performance computing platforms. Instead of being restricted solely to supercomputers for achieving high-performance computing, the spectrum of available platforms will spread out to Beowulf-class clusters, to superclusters, and on to supercomputers. Moving along this continuum represents increasing computational resources, which in turn allows the capability for solving larger classes of applications or instances of problems. Compute-bound applications on workstations often may take advantage of the extra horsepower provided by symmetric multiprocessors. Applications with even larger computational requirements and a high-degree of concurrency may use Beowulf clusters, that is, clusters that are home-built from mass-market, commercial off-the-shelf workstations and networks, for instance, PC's interconnected by Fast Ethernet. A supercluster may contain commodity SMP nodes interconnected with scalable, low-latency, high-bandwidth networks, and is integrated by a system vendor rather than the computational scientist. Applications with greater complexity, for example, grand challenges from the sciences, demand scalable systems with high-performance, interconnects, perhaps coupled with terascale I/O subsystems, and thus, are appropriate for these superclusters. Finally, supercomputers, the largest of the clusters, may provide the ultimate platform for the highest-fidelity models and simulations and data-intensive applications. At each step up this ladder of cluster architectures, the system cost increases approximately by an order of magnitude, but having the high-performance capability to solve the problem of interest may require an entry point at any of these levels, the Beowulf, or supercluster, or even supercomputer platform. Cluster computing with Beowulf- or superclusters, thus, may be one or two orders of magnitude less expensive than a supercomputer, and provide a cost-effective solution and capability that was not available on a workstation. But this cost comparison measures just the basic system price. What about the applications? As recently as a few years ago, the lack of a canonical high-performance architectural paradigm meant that migrating to a new computer system, even from the same vendor, typically required redesigning applications to efficiently use the high-performance system. Thus, the application must be redesigned with parallel algorithms and libraries that are optimized for each high-performance system. This process of porting, redesigning, optimizing, debugging, and analyzing, the application may in fact be prohibitively expensive, and certainly frustrating when the process is completed just in time to greet the next generation system! That was then, this is now. With the successful standardization of system-level interfaces, many of these issues no longer hinder our expedited use of these new, high-performance clusters. The message-passing interface (MPI) is a clear example of a standard that has contributed significantly to the success of cluster computing. Supercomputer vendors working together with the high-performance computing community embarked on a process to standardize the user-level interface and behavior for passing messages between concurrent tasks. Now, using ordinary sequential compilers and vendor-supplied or freely-available implementations of this message-passing interface, applications can be implemented efficiently on one supercomputer and ported with little or no effort to other parallel machines. The message-passing paradigm, thus, provides a reasonably good canonical high-performance model and methodology for implementing high-performance applications. An algorithm that exhibits efficient execution and scaling on one machine then is likely to perform well on another with little or no additional programming effort. Using this cluster computing paradigm, algorithms typically are optimized by minimizing the number of remote memory accesses (reducing the amount of messages passed), and carefully organizing the data placement to increase memory locality. Thus, high-performance algorithms and applications that have been optimized for supercomputers, using the same cluster paradigm, may be appropriate for Beowulf and superclusters. Cluster computing, realizing the importance of a standard high-performance programming environment that applies equally well to both ends of the architectural spectrum, highly leverages these and other successes from parallel and distributed processing research and development. This is in an exciting, new era for high-performance computing where the canonical architectural paradigm stretches from home-built Beowulf clusters, to superclusters, and on to supercomputers. But cluster computing faces some challenges ahead of it. Continued research is required for designing 1) scalable, high-performance algorithms, applications, and methodologies, that can tolerate the communication overheads, and adapt to hybrid, SMP, and heterogeneous, nodes; 2) high-performance computer architectures, scalable interconnection networks, and I/O subsystems; and 3) scalable systems software, compilers, and monitoring tools. Cluster computing has come of age, and it is high time for the parallel and distributed processing community to lay the groundwork for our own legacy of success stories. David A. Bader University of New Mexico

Distributed computing systems are of current interest due to the advancement of microprocessor technology and computer network. The prime function of effective utilization of distributed system is accurately mapping of task and tasks their scheduling on different processors for reducing their total finish time. Total runtime is taken time for all module with the runtime of tasks and their communication cost among tasks. In Distributed processing system, partitioning of a task into modules and proper allocation of module among processors are more important factor for efficient utilization of resources. In this paper, we discuss allocation of a set of 'm' module of a task to a set of 'n' processors (where m > n) to get an optimal utilization of available processors. We partition the task in different size of module and design an algorithm for allocation of these modules in distributed processing environment. While designing the model Per Bit Processing Rate, Inter Task Communication Cost, Task Size has been taken into consideration. We consider the constraints of minimizing execution cost and their Inter task communication and maximize the overall throughput of the system to be taking as constraints in such a way that allocated load on all the processor is balances. Keyword: Distributed computing, Task Allocation, Module distribution, Execution Cost, Communication Cost, Task Size.

Advanced control of large-scale wind turbines: Structural load reduction and lifetime control

Research on artificial neural networks (ANNs) has been carried out for more than five decades. A renewed interest appeared in the 80's with the finding of powerful models like J. Hopfield's recurrent networks, T. Kohonen's self-organizing feature maps, and the back-propagation rule. At that time, there was no platform that was at the same time versatile enough for any ANN model to be implemented and fast enough to solve large problems. Super-computers were the sole exception to this rule, but were prohibitively expensive for most applications. However, both research scientists and application engineers clearly identified the need for such a computing power. This triggered many projects in the field. In parallel, research on multi-processor systems started during the 60's. Systolic arrays have been proposed in 1979 as a means to fully exploit the possibilities of VLSI. Two previous theses, by F. Blayo and C. Lehmann, have studied the use of bi-dimensional systolic arrays for neural computation. At first, the presented system, called GENES, has been designed for the Hopfield model. Extensions to other ANNs have also been proposed. The goal of the present thesis is to study, design, build, and analyze an efficient accelerator for neural computation. In a first step, the GENES architecture has been extended towards generality and efficiency. This includes a thorough analysis of ANN models, of other neural computers, and of previous GENES implementations. The result of this work is the GENES IV integrated circuit, whose architecture has been co-designed by P. Ienne and the author. The main part of this thesis discusses the architecture, the design and the analysis of the MANTRA I machine, a neural computer based on a GENES IV array with up to 40 × 40 processing elements (PEs). The delta rule (and hence the Perceptron and Adaline rules), the back-propagation rule, the Hopfield model, and the Kohonen model can be implemented on this system. Although not a generic system, such a machine may be regarded as a multi-model neural computer. A prototype has been running for a year and is used daily by software designers. Several novel features distinguish the MANTRA I machine from other neural systems. First, it belongs to the few existing neural computers, contrary to the majority of implementations, which are specific to an application or to an algorithm. The machine does not hard-wire any algorithm, but provides the necessary primitives to implement the target models. This is a key feature for research, since several algorithms or versions of an algorithm can be tested on a problem. It is an important aspect for applications as well, because different ANN models are often cascaded to solve a problem. The GENES IV array — that is, the computing core of the MANTRA I machine — features synapse-level parallelism (i.e., one real or virtual PE is allocated per synapse or neural connection), while most other systems exploit only neuron-level parallelism (i.e., one PE per neuron). Hence, this system aims at a much finer parallelism grain and is well suited for massively parallel architectures. The problem size that can be computed by a neural accelerator should not be limited by the hardware (except for memory size). Therefore, it is essential to support time-sharing of PEs. On the MANTRA I machine, this is achieved by the concept of virtual arrays. Matrices are divided into sub-matrices that can be mapped onto the physical array, which is then time-shared among them. An efficient mechanism has been implemented to swap sub-matrices in background, while some other computation is performed. Since systolic arrays are pipelined systems, it is important to avoid emptying and re-filling them too often, in order to keep the hardware utilization rate high. Therefore, a systolic instruction flow has been implemented, so that each instruction follows the data for which it has been issued. Like any SIMD system, the MANTRA I machine is composed of a parallel or SIMD module and a control module. The SIMD module consists of the GENES IV array and a set of dedicated units designed for the computation that scales with the number of neurons and would poorly fit on a bi-dimensional array. A complex system of FIFOs and memories sustains the required input/output streams for the systolic array. The control module is a complete SISD system. Its tasks are (1) to control the SIMD module by dispatching instructions, (2) to manage data input and output, (3) to communicate with the external world, and (4) to perform data pre- and post-processing. The SIMD instructions are of the very long instruction word (VLIW) type. Synchronization between the two modules is achieved by an instruction FIFO. The performance of the MANTRA I machine has been analyzed using the delta rule. Measurements show that the sustained performance is very close to its peak value, as long as the problem fits in the memory banks connected to the GENES IV array. Experiments have also been run to investigate the impact of the constraints imposed by the hardware on the convergence of algorithms. Finally, the use of systolic arrays as neural accelerators is discussed in the light of the experience acquired with the GENES IV array and the MANTRA I machine. The weaknesses of the machine are analyzed, and several solutions are proposed to avoid them in a future design. A general discussion of the future of neural computers concludes this thesis.

Metric-based Evaluation of Implemented Software Architectures

OF THE THESIS Pilot based frameworks for Weather Research Forecasting by Dinesh Prasanth Ganapathi Thesis Director: Dr. Shantenu Jha The Weather Research Forecasting (WRF) domain consists of complex workflows that demand the use of Distributed Computing Infrastructure (DCI). Weather forecasting requires that weather researchers use different set of initial conditions and one or a combination of physics models on the same set of input data. For these type of simulations an ensemble based computing approach becomes imperative. Most DCIs have local job-schedulers that have no smart way of dealing with the execution of an ensemble type of computational problem as the job-schedulers are built to cater to the bare essentials of resource allocation. This means the weather scientists have to submit multiple jobs to the job-scheduler. In this dissertation we use Pilot-Job based tools to decouple work-load submission and resource allocation therefore streamlining the complex workflows in Weather Research and Forecasting domain and reduce their overall time to completion. We also achieve location independent job execution, data movement, placement and processing. Next, we create the necessary enablers to run an ensemble of tasks bearing the capability to run on multiple heterogeneous distributed computing resources there by creating the opportunity to minimize the overall time consumed in running the models. Our experiments show that the tools developed exhibit very good, strong and weak scaling characteristics. These results bear the potential to change the way weather researchers are submitting traditional WRF jobs to the

There are numerous loud and powerful voices promoting the Internet of Things (IoT) as a catalyst for changing many aspects of our lives for the better. Healthcare, energy, transport, finance, entertainment and in the home – billions of everyday objects across all sorts of sectors are being connected to the Internet to generate data so that we can make quicker and more efficient decisions about many facets of our lives. But is this technological development completely benign? I argue that, despite all their positive potential, IoT devices are still being designed, manufactured and disposed of in the same manner that most other ‘non-connected’ consumer products have been for decades – unsustainably. Further, while much fanfare is made of the IoT’s potential utility for reducing energy usage through pervasive monitoring, little discourse recognises the intrinsically unsustainable nature of the IoT devices themselves. In response to this growing unsustainable product culture, my thesis centres on the role that sustainability can potentially play in the design of future IoT devices. I propose the recharacterisation of IoT devices as spimes in order to provide an alternative approach for facilitating sustainable Internet-connected product design practice. The concept of spimes was first introduced in 2004 by the futurist Bruce Sterling and then outlined further a year later in his book Shaping Things. When viewed simply, a spime would be a type of near future, internet-connected device which marries physical and digital elements with innate sustainable characteristics. Whereas the majority of sustainable design theory and practice has focused on the development of sustainable non-connected devices, a credible strategy for the design of environmentally friendly Internet-connected physical objects has yet to be put forward. In light of this, I argue that now is the right time to develop the spimes concept in greater depth so that it may begin to serve as a viable counterpoint to the increasing unsustainability of the IoT. To make this case, my thesis explores the following three key questions: • What are spimes? • Can we begin to design spimes? • What does spime-orientated research mean for unsustainable Internet-connected design practice? I outline how, in order to explore these important questions, I utilised a Research through Design approach to unpack and augment the notion of spimes through three Design Fiction case studies. Each case study concretises different key design criteria for spime devices, while also probing the broader implications that could arise as a result of adopting such spime designs in the near future. I discuss the significance of reflecting upon my Spime-based Design Fiction Practice and how this enabled me to develop the spimes concept into a multidimensional lens, which I contend, other designers can potentially harness as a means to reframe their IoT praxis with sustainability baked-in. The key aspects of my process and its outputs are also summarised in form of a design manifesto with the aim of inspiring prospective designers and technologists to create future sustainable Internet-connected devices.

In this thesis, the role of location-specific microstructural features in the fatigue performance of the safety-critical aerospace components made of Nickel (Ni)-base superalloys and linear friction welded (LFW) Titanium (Ti) alloys has been studied using crystal plasticity finite element (CPFE) simulations, energy dispersive X-ray diffraction (EDD), backscatter electron (BSE) images and digital image correlation (DIC).<br>In order to develop a microstructure-sensitive fatigue life prediction framework, first, it is essential to build trust in the quantitative prediction from CPFE analysis by quantifying uncertainties in the mechanical response from CPFE simulations. Second, it is necessary to construct a unified fatigue life prediction metric, applicable to multiple material systems; and a calibration strategy of the unified fatigue life model parameter accounting for uncertainties originating from CPFE simulations and inherent in the experimental calibration dataset. To achieve the first task, a genetic algorithm framework is used to obtain the statistical distributions of the crystal plasticity (CP) parameters. Subsequently, these distributions are used in a first-order, second-moment method to compute the mean and the standard deviation for the stress along the loading direction (σ_load), plastic strain accumulation (PSA), and stored plastic strain energy density (SPSED). The results suggest that an ~10% variability in σ_load and 20%-25% variability in the PSA and SPSED values may exist due to the uncertainty in the CP parameter estimation. Further, the contribution of a specific CP parameter to the overall uncertainty is path-dependent and varies based on the load step under consideration. To accomplish the second goal, in this thesis, it is postulated that a critical value of the SPSED is associated with fatigue failure in metals and independent of the applied load. Unlike the classical approach of estimating the (homogenized) SPSED as the cumulative area enclosed within the macroscopic stress-strain hysteresis loops, CPFE simulations are used to compute the (local) SPSED at each material point within polycrystalline aggregates of 718Plus, an additively manufactured Ni-base superalloy. A Bayesian inference method is utilized to calibrate the critical SPSED, which is subsequently used to predict fatigue lives at nine different strain ranges, including strain ratios of 0.05 and -1, using nine statistically equivalent microstructures. For each strain range, the predicted lives from all simulated microstructures follow a log-normal distribution; for a given strain ratio, the predicted scatter is seen to be increasing with decreasing strain amplitude and are indicative of the scatter observed in the fatigue experiments. Further, the log-normal mean lives at each strain range are in good agreement with the experimental evidence. Since the critical SPSED captures the experimental data with reasonable accuracy across various loading regimes, it is hypothesized to be a material property and sufficient to predict the fatigue life.<br>Inclusions are unavoidable in Ni-base superalloys, which lead to two competing failure modes, namely inclusion- and matrix-driven failures. Each factor related to the inclusion, which may contribute to crack initiation, is isolated and systematically investigated within RR1000, a powder metallurgy produced Ni-base superalloy, using CPFE simulations. Specifically, the role of the inclusion stiffness, loading regime, loading direction, a debonded region in the inclusion-matrix interface, microstructural variability around the inclusion, inclusion size, dissimilar coefficient of thermal expansion (CTE), temperature, residual stress, and distance of the inclusion from the free surface are studied in the emergence of two failure modes. The CPFE analysis indicates that the emergence of a failure mode is an outcome of the complex interaction between the aforementioned factors. However, the possibility of a higher probability of failure due to inclusions is observed with increasing temperature, if the CTE of the inclusion is higher than the matrix, and vice versa. Any overall correlation between the inclusion size and its propensity for damage is not found, based on inclusion that is of the order of the mean grain size. Further, the CPFE simulations indicate that the surface inclusions are more damaging than the interior inclusions for similar surrounding microstructures. These observations are utilized to instantiate twenty realistic statistically equivalent microstructures of RR1000 – ten containing inclusions and remaining ten without inclusions. Using CPFE simulations with these microstructures at four different temperatures and three strain ranges for each temperature, the critical SPSED is calibrated as a function of temperature for RR1000. The results suggest that critical SPSED decreases almost linearly with increasing temperature and is appropriate to predict the realistic emergence of the competing failure modes as a function of applied strain range and temperature.<br>LFW process leads to the development of significant residual stress in the components, and the role of residual stress in the fatigue performance of materials cannot be overstated. Hence, to ensure fatigue performance of the LFW Ti alloys, residual strains in LFW of similar (Ti-6Al-4V welded to Ti-6Al-4V or Ti64-Ti64) and dissimilar (Ti-6Al-4V welded to Ti-5Al-5V-5Mo-3Cr or Ti64-Ti5553) Ti alloys have been characterized using EDD. For each type of LFW, one sample is chosen in the as-welded (AW) condition and another sample is selected after a post-weld heat treatment (HT). Residual strains have been separately studied in the alpha and beta phases of the material, and five components (three axial and two shear) have been reported in each case. In-plane axial components of the residual strains show a smooth and symmetric behavior about the weld center for the Ti64-Ti64 LFW samples in the AW condition, whereas these components in the Ti64-Ti5553 LFW sample show a symmetric trend with jump discontinuities. Such jump discontinuities, observed in both the AW and HT conditions of the Ti64-Ti5553 samples, suggest different strain-free lattice parameters in the weld region and the parent material. In contrast, the results from the Ti64-Ti64 LFW samples in both AW and HT conditions suggest nearly uniform strain-free lattice parameters throughout the weld region. The observed trends in the in-plane axial residual strain components have been rationalized by the corresponding microstructural changes and variations across the weld region via BSE images. <br>In the literature, fatigue crack initiation in the LFW Ti-6Al-4V specimens does not usually take place in the seemingly weakest location, i.e., the weld region. From the BSE images, Ti-6Al-4V microstructure, at a distance from the weld-center, which is typically associated with crack initiation in the literature, are identified in both AW and HT samples and found to be identical, specifically, equiaxed alpha grains with beta phases present at the alpha grain boundaries and triple points. Hence, subsequent fatigue performance in LFW Ti-6Al-4V is analyzed considering the equiaxed alpha microstructure.<br>The LFW components made of Ti-6Al-4V are often designed for high cycle fatigue performance under high mean stress or high R ratios. In engineering practice, mean stress corrections are employed to assess the fatigue performance of a material or structure; albeit this is problematic for Ti-6Al-4V, which experiences anomalous behavior at high R ratios. To address this problem, high cycle fatigue analyses are performed on two Ti-6Al-4V specimens with equiaxed alpha microstructures at a high R ratio. In one specimen, two micro-textured regions (MTRs) having their c-axes near-parallel and perpendicular to the loading direction are identified. High-resolution DIC is performed in the MTRs to study grain-level strain localization. In the other specimen, DIC is performed on a larger area, and crack initiation is observed in a random-textured region. To accompany the experiments, CPFE simulations are performed to investigate the mechanistic aspects of crack initiation, and the relative activity of different families of slip systems as a function of R ratio. A critical soft-hard-soft grain combination is associated with crack initiation indicating possible dwell effect at high R ratios, which could be attributed to the high-applied mean stress and high creep sensitivity of Ti-6Al-4V at room temperature. Further, simulations indicated more heterogeneous deformation, specifically the activation of multiple families of slip systems with fewer grains being plasticized, at higher R ratios. Such behavior is exacerbated within MTRs, especially the MTR composed of grains with their c-axes near parallel to the loading direction. These features of micro-plasticity make the high R ratio regime more vulnerable to fatigue damage accumulation and justify the anomalous mean stress behavior experienced by Ti-6Al-4V at high R ratios.<br>

The architectural design phase is the key phase to make the construction project successful and meets the owner’s requirements. The main objective of this research is to explore risks involved in the architectural design phase. Meanwhile, the study resulted in some recommendations for improving the efficiency of decision making process in architectural design phase. From five cases study, two interviews and one questionnaire, four major risks among the twenty four found risks were identified. The four major risks and their possible solution are: 1. The design team uses some kind of routine design when working on a different project. The solutions are that the design team needs to take a careful assessment on design task and to improve their knowledge on different type of project. 2. The design team doesn’t have a mutual definition and languages in conceptual design phase. The solutions are that the design team needs to build up a standard form of design and discussion carefully about the change in the very first meeting of project. 3. Orders were changed during the progress. The solution is that the Owner needs to discuss with the assignment manager or take suggestion from expert to complete design task 4. Legal documents were changed while project is on process. The solution is that the officer government needs to discuss with disciplines to get a feedback about the background or the necessity of change. This study has built a framework for managing the risks during architectural design phase on a building project. The framework could be recommend for future research and apply the framework to other design projects, such as urban planning, civil construction and so on. Moreover, it would be significant if the associated financing and construction risk could be further studied.

Robustness is a fundamental and timeless issue, and it remains vital to all aspects of computation systems, regardless of specific computation platforms, architectures, and algorithm design. The issue is also timely: modern computing systems are increasingly built on unreliable substrates. This thesis designs reliable computing techniques for distributed systems, circuits and networks.We primarily study techniques inspired from coding theory to address the robustness issues such as system elasticity, stragglers (slow workers), machine failures and soft errors, by carefully weaving redundancy into the data andthe design of the algorithm. We primarily focus on three aspects of coding-based computation techniques.The first aspect is to design adaptive computing techniques in largescale systems that are elastic, i.e., the number of machines can change with time. The second is to make the coding-based computation schemes cater to the specific needs of iterative and multi-stage algorithms, such as power iterations and gradient descent that are essential for today’s data analytics. The third aspect is to study the fundamental limits of information propagation in computation networks, provide information-theoretic outer bounds on erroraccumulation, and design in-network computing schemes to compensate for this error accumulation, e.g., in a circuit network where each computationcomponent can be unreliable. This thesis presents theoretical results that are fundamental to the understandingof computation systems, and opportunities for radical improvements, e.g. in computation load, communication overhead, and storage cost. We also present real-system implementations and real-data experiments and show our progress on taking these theoretical results closer to practice. The academic results presented in this thesis advance on classical results in the historical field of reliable distributed computing, while simultaneously addressing timely issues arising in today’s computing systems.

Two studies were conducted to examine the use of grounded embodied pedagogy, construction of Imaginary Worlds (Study 1), and context of instructional materials (Study 2) for developing learners' Computational Thinking (CT) Skills and Concept knowledge during the construction of digital artifacts using Scratch, a block-based programming language. Utilizing a conceptual framework for grounded embodied pedagogy called Instructional Embodiment, learners physically enacted (Direct Embodiment) and mentally simulated (Imagined Embodiment) the actions and events as presented within pre-defined Scripts. Instructional Embodiment utilizes action, perception, and environment to create a dynamic, interactive teaching & learning scenario that builds upon previous research in embodied teaching and learning. The two studies described herein examined the effects of Instructional Embodiment, Imaginary World Construction, and Context on the development of specific Computational Thinking Concepts and Skills. In particular, certain CT Concepts, such as Conditionals, Variables, Thread Synchronization, Collision Detection, & Events, and CT Skills, such as abstraction and pattern recognition, were identified and measured within the learners' individual digital artifacts. Presence and/or frequency of these Concepts and Skills were used to determine the extent of Computational Thinking development. In Study 1, fifty-six sixth- and seventh-grade students participated in a fifteen-session curricular program during the academic school day. This study examined the type of instruction and continuity of Imaginary World Construction on the development of certain CT Skills and Concepts used in a visual novel created in Scratch. Main effects were found for learners who physically embodied the pre-defined instructional materials: embodying the pre-defined Scripts led to the learners using significantly more ‘speech’ Blocks in their projects and more Absolute Positioning Blocks for ‘motion’ than those who did not physically embody the same Scripts. Significant main effects were also found for continuity of Imaginary World Construction: learners who were instructed to continue the premise of the first digital artifact (Instructional Artifact) implemented significantly more computational structures in their second digital artifact (Unique Artifact) than those who were instructed to create a Unique Artifact with a premise of their own design. In Study 2, seventy-eight sixth- and seventh-grade students participated in a seventeen-session curricular program during the academic school day. This study examined the type of instruction and context of instructional materials on the development of CT Skills and Concepts during the construction of a video game using Scratch. Similar to Study 1, findings suggest that physically embodying the actions presented within the pre-defined instructional materials leads to greater implementation of many of these same structures during individual artifact construction. The study also showed that as the pre-defined Scripts become more complex (e.g. single-threaded to multi-threaded), the effect of physical embodiment on the development of CT Skills and complex CT Concept structures becomes less pronounced. Findings from this study also suggest that Context has a significant effect on identifying & implementing the CT Skill pattern recognition: learning CT Concepts from an Unfamiliar Context had a significant positive effect on the implementation of both Broadcast/Receive couplings and Conditional Logic & Operator patterns. In sum, the findings suggest that the type of instruction, the continuity of the Imaginary World being constructed, and the context of the instructional materials all play a significant role in the learners' ability to develop certain Computational Thinking Skills and Concept knowledge. The findings also suggest that a physically embodied approach to teaching abstract concepts that is grounded in an unfamiliar context is the most effective way to integrate a grounded embodied approach to pedagogy within a formal instructional setting.