625 research outputs found
Availability modeling and evaluation on high performance cluster computing systems
Cluster computing has been attracting more and more attention from both the industrial and the academic world for its enormous computing power, cost effective, and scalability. Beowulf type cluster, for example, is a typical High Performance Computing (HPC) cluster system. Availability, as a key attribute of the system, needs to be considered at the system design stage and monitored at mission time. Moreover, system monitoring is a must to help identify the defects and ensure the system\u27s availability requirement.
In this study, novel solutions which provide availability modeling, model evaluation, and data analysis as a single framework have been investigated. Three key components in the investigation are availability modeling, model evaluation, and data analysis. The general availability concepts and modeling techniques are briefly reviewed. The system\u27s availability model is divided into submodels based upon their functionalities. Furthermore, an object oriented Markov model specification to facilitate availability modeling and runtime configuration has been developed. Numerical solutions for Markov models are examined, especially on the uniformization method. Alternative implementations of the method are discussed; particularly on analyzing the cost of an alternative solution for small state space model, and different ways for solving large sparse Markov models. The dissertation also presents a monitoring and data analysis framework, which is responsible for failure analysis and availability reconfiguration. In addition, the event logs provided from the Lawrence Livermore National Laboratory have been studied and applied to validate the proposed techniques
A low-rank isogeometric solver based on Tucker tensors
We propose an isogeometric solver for Poisson problems that combines i)
low-rank tensor techniques to approximate the unknown solution and the system
matrix, as a sum of a few terms having Kronecker product structure, ii) a
Truncated Preconditioned Conjugate Gradient solver to keep the rank of the
iterates low, and iii) a novel low-rank preconditioner, based on the Fast
Diagonalization method where the eigenvector multiplication is approximated by
the Fast Fourier Transform. Although the proposed strategy is written in
arbitrary dimension, we focus on the three-dimensional case and adopt the
Tucker format for low-rank tensor representation, which is well suited in low
dimension. We show in numerical tests that this choice guarantees significant
memory saving compared to the full tensor representation. We also extend and
test the proposed strategy to linear elasticity problems.Comment: 27 pages, 8 figure
Identification and Optimal Linear Tracking Control of ODU Autonomous Surface Vehicle
Autonomous surface vehicles (ASVs) are being used for diverse applications of civilian and military importance such as: military reconnaissance, sea patrol, bathymetry, environmental monitoring, and oceanographic research. Currently, these unmanned tasks can accurately be accomplished by ASVs due to recent advancements in computing, sensing, and actuating systems. For this reason, researchers around the world have been taking interest in ASVs for the last decade. Due to the ever-changing surface of water and stochastic disturbances such as wind and tidal currents that greatly affect the path-following ability of ASVs, identification of an accurate model of inherently nonlinear and stochastic ASV system and then designing a viable control using that model for its planar motion is a challenging task. For planar motion control of ASV, the work done by researchers is mainly based on the theoretical modeling in which the nonlinear hydrodynamic terms are determined, while some work suggested the nonlinear control techniques and adhered to simulation results. Also, the majority of work is related to the mono- or twin-hull ASVs with a single rudder. The ODU-ASV used in present research is a twin-hull design having two DC trolling motors for path-following motion.
A novel approach of time-domain open-loop observer Kalman filter identifications (OKID) and state-feedback optimal linear tracking control of ODU-ASV is presented, in which a linear state-space model of ODU-ASV is obtained from the measured input and output data. The accuracy of the identified model for ODU-ASV is confirmed by validation results of model output data reconstruction and benchmark residual analysis. Then, the OKID-identified model of the ODU-ASV is utilized to design the proposed controller for its planar motion such that a predefined cost function is minimized using state and control weighting matrices, which are determined by a multi-objective optimization genetic algorithm technique. The validation results of proposed controller using step inputs as well as sinusoidal and arc-like trajectories are presented to confirm the controller performance. Moreover, real-time water-trials were performed and their results confirm the validity of proposed controller in path-following motion of ODU-ASV
A spectral surrogate model for stochastic simulators computed from trajectory samples
Stochastic simulators are non-deterministic computer models which provide a
different response each time they are run, even when the input parameters are
held at fixed values. They arise when additional sources of uncertainty are
affecting the computer model, which are not explicitly modeled as input
parameters. The uncertainty analysis of stochastic simulators requires their
repeated evaluation for different values of the input variables, as well as for
different realizations of the underlying latent stochasticity. The
computational cost of such analyses can be considerable, which motivates the
construction of surrogate models that can approximate the original model and
its stochastic response, but can be evaluated at much lower cost.
We propose a surrogate model for stochastic simulators based on spectral
expansions. Considering a certain class of stochastic simulators that can be
repeatedly evaluated for the same underlying random event, we view the
simulator as a random field indexed by the input parameter space. For a fixed
realization of the latent stochasticity, the response of the simulator is a
deterministic function, called trajectory. Based on samples from several such
trajectories, we approximate the latter by sparse polynomial chaos expansion
and compute analytically an extended Karhunen-Lo\`eve expansion (KLE) to reduce
its dimensionality. The uncorrelated but dependent random variables of the KLE
are modeled by advanced statistical techniques such as parametric inference,
vine copula modeling, and kernel density estimation. The resulting surrogate
model approximates the marginals and the covariance function, and allows to
obtain new realizations at low computational cost. We observe that in our
numerical examples, the first mode of the KLE is by far the most important, and
investigate this phenomenon and its implications
Mobile and Wireless Communications
Mobile and Wireless Communications have been one of the major revolutions of the late twentieth century. We are witnessing a very fast growth in these technologies where mobile and wireless communications have become so ubiquitous in our society and indispensable for our daily lives. The relentless demand for higher data rates with better quality of services to comply with state-of-the art applications has revolutionized the wireless communication field and led to the emergence of new technologies such as Bluetooth, WiFi, Wimax, Ultra wideband, OFDMA. Moreover, the market tendency confirms that this revolution is not ready to stop in the foreseen future. Mobile and wireless communications applications cover diverse areas including entertainment, industrialist, biomedical, medicine, safety and security, and others, which definitely are improving our daily life. Wireless communication network is a multidisciplinary field addressing different aspects raging from theoretical analysis, system architecture design, and hardware and software implementations. While different new applications are requiring higher data rates and better quality of service and prolonging the mobile battery life, new development and advanced research studies and systems and circuits designs are necessary to keep pace with the market requirements. This book covers the most advanced research and development topics in mobile and wireless communication networks. It is divided into two parts with a total of thirty-four stand-alone chapters covering various areas of wireless communications of special topics including: physical layer and network layer, access methods and scheduling, techniques and technologies, antenna and amplifier design, integrated circuit design, applications and systems. These chapters present advanced novel and cutting-edge results and development related to wireless communication offering the readers the opportunity to enrich their knowledge in specific topics as well as to explore the whole field of rapidly emerging mobile and wireless networks. We hope that this book will be useful for students, researchers and practitioners in their research studies
Approximation Opportunities in Edge Computing Hardware : A Systematic Literature Review
With the increasing popularity of the Internet of Things and massive Machine Type Communication technologies, the number of connected devices is rising. However, while enabling valuable effects to our lives, bandwidth and latency constraints challenge Cloud processing of their associated data amounts. A promising solution to these challenges is the combination of Edge and approximate computing techniques that allows for data processing nearer to the user. This paper aims to survey the potential benefits of these paradigmsâ intersection. We provide a state-of-the-art review of circuit-level and architecture-level hardware techniques and popular applications. We also outline essential future research directions.publishedVersionPeer reviewe
A reduced basis approach for variational problems with stochastic parameters: Application to heat conduction with variable Robin coefficient
In this work, a Reduced Basis (RB) approach is used to solve a large number of boundary value problems parametrized by a stochastic input â expressed as a KarhunenâLoĂšve expansion â in order to compute outputs that are smooth functionals of the random solution fields. The RB method proposed here for variational problems parametrized by stochastic coefficients bears many similarities to the RB approach developed previously for deterministic systems. However, the stochastic framework requires the development of new a posteriori estimates for âstatisticalâ outputs â such as the first two moments of integrals of the random solution fields; these error bounds, in turn, permit efficient sampling of the input stochastic parameters and fast reliable computation of the outputs in particular in the many-query context.United States. Air Force Office of Scientific Research (Grant FA9550-07-1-0425)Singapore-MIT Alliance for Research and TechnologyChaire dâexcellence AC
Number Systems for Deep Neural Network Architectures: A Survey
Deep neural networks (DNNs) have become an enabling component for a myriad of
artificial intelligence applications. DNNs have shown sometimes superior
performance, even compared to humans, in cases such as self-driving, health
applications, etc. Because of their computational complexity, deploying DNNs in
resource-constrained devices still faces many challenges related to computing
complexity, energy efficiency, latency, and cost. To this end, several research
directions are being pursued by both academia and industry to accelerate and
efficiently implement DNNs. One important direction is determining the
appropriate data representation for the massive amount of data involved in DNN
processing. Using conventional number systems has been found to be sub-optimal
for DNNs. Alternatively, a great body of research focuses on exploring suitable
number systems. This article aims to provide a comprehensive survey and
discussion about alternative number systems for more efficient representations
of DNN data. Various number systems (conventional/unconventional) exploited for
DNNs are discussed. The impact of these number systems on the performance and
hardware design of DNNs is considered. In addition, this paper highlights the
challenges associated with each number system and various solutions that are
proposed for addressing them. The reader will be able to understand the
importance of an efficient number system for DNN, learn about the widely used
number systems for DNN, understand the trade-offs between various number
systems, and consider various design aspects that affect the impact of number
systems on DNN performance. In addition, the recent trends and related research
opportunities will be highlightedComment: 28 page
New Views for Stochastic Computing: From Time-Encoding to Deterministic Processing
University of Minnesota Ph.D. dissertation.July 2018. Major: Electrical/Computer Engineering. Advisor: David Lilja. 1 computer file (PDF); xi, 149 pages.Stochastic computing (SC), a paradigm first introduced in the 1960s, has received considerable attention in recent years as a potential paradigm for emerging technologies and ''post-CMOS'' computing. Logical computation is performed on random bitstreams where the signal value is encoded by the probability of obtaining a one versus a zero. This unconventional representation of data offers some intriguing advantages over conventional weighted binary. Implementing complex functions with simple hardware (e.g., multiplication using a single AND gate), tolerating soft errors (i.e., bit flips), and progressive precision are the primary advantages of SC. The obvious disadvantage, however, is latency. A stochastic representation is exponentially longer than conventional binary radix. Long latencies translate into high energy consumption, often higher than that of their binary counterpart. Generating bit streams is also costly. Factoring in the cost of the bit-stream generators, the overall hardware cost of an SC implementation is often comparable to a conventional binary implementation. This dissertation begins by proposing a highly unorthodox idea: performing computation with digital constructs on time-encoded analog signals. We introduce a new, energy-efficient, high-performance, and much less costly approach for SC using time-encoded pulse signals. We explore the design and implementation of arithmetic operations on time-encoded data and discuss the advantages, challenges, and potential applications. Experimental results on image processing applications show up to 99% performance speedup, 98% saving in energy dissipation, and 40% area reduction compared to prior stochastic implementations. We further introduce a low-cost approach for synthesizing sorting network circuits based on deterministic unary bit-streams. Synthesis results show more than 90% area and power savings compared to the costs of the conventional binary implementation. Time-based encoding of data is then exploited for fast and energy-efficient processing of data with the developed sorting circuits. Poor progressive precision is the main challenge with the recently developed deterministic methods of SC. We propose a high-quality down-sampling method which significantly improves the processing time and the energy consumption of these deterministic methods by pseudo-randomizing bitstreams. We also propose two novel deterministic methods of processing bitstreams by using low-discrepancy sequences. We further introduce a new advantage to SC paradigm-the skew tolerance of SC circuits. We exploit this advantage in developing polysynchronous clocking, a design strategy for optimizing the clock distribution network of SC systems. Finally, as the first study of its kind to the best of our knowledge, we rethink the memory system design for SC. We propose a seamless stochastic system, StochMem, which features analog memory to trade the energy and area overhead of data conversion for computation accuracy
Efficient stochastic modal decomposition methods for structural stochastic static and dynamic analyses
AbstractThis article presents unified and efficient stochastic modal decomposition methods to solve stochastic structural static and dynamic problems. We extend the idea of deterministic modal decomposition method for structural dynamic analysis to stochastic cases. Standard/generalized stochastic eigenvalue equations are adopted to calculate the stochastic subspaces for stochastic static/dynamic problems and they are solved by an efficient reducedâorder method. The stochastic solutions of both static and dynamic equations are approximated by stochastic bases of the stochastic subspaces. Original stochastic static/dynamic equations are then transformed into a set of singleâdegreeâofâfreedom (SDoF) stochastic static/dynamic equations, which are efficiently solved by the proposed nonâintrusive methods. Specifically, a nonâintrusive stochastic Newmark method is developed for the solution of SDoF stochastic dynamic equations, and the elementâwise division of sample vectors is used to solve the SDoF stochastic static equations. All of these methods have low computational effort and are weakly sensitive to the stochastic dimension, thus the proposed methods avoid the curse of dimensionality successfully. Two numerical examples, including twoâ and threeâdimensional spatial problems with low and high stochastic dimensions, are given to show the efficiency and accuracy of the proposed methods.</jats:p
- âŠ