We present in this paper a novel method to predict application runtimes on backfilling parallel systems. The method is based on mining historical data to obtain important parameters. These parameters are then applied ...
详细信息
ISBN:
(纸本)9780769539393
We present in this paper a novel method to predict application runtimes on backfilling parallel systems. The method is based on mining historical data to obtain important parameters. These parameters are then applied to predict the runtime of future applications. It has been shown in previous works [4], [21] that both underestimate and inaccuracy in prediction have adverse impacts on scheduling performance of backfilling systems. In our study, we try to reduce the number of jobs that are underestimated and reduce the prediction error as much as possible. Comparing with other predictors, experimental results show that our predictor is upto 25% better with respect to the problem of underestimate. Moreover, using the metric proposed in [21] for the accuracy, our predictor improves upto 32%.
This paper presents the performance evaluation of a software fault manager for distributedapplications. Dubbed STAR, it uses the natural redundancy existing in networks of workstations to offer a high level of fault ...
详细信息
This paper presents the performance evaluation of a software fault manager for distributedapplications. Dubbed STAR, it uses the natural redundancy existing in networks of workstations to offer a high level of fault tolerance. Fault management is transparent to the supported parallelapplications. STAR is application independent, highly configurable and easily portable to UNIX-like operating systems. The current implementation is based on independent checkpointing and message logging. Measurements show the efficiency and the limits of this implementation. The challenge is to show that a software approach to fault tolerance can efficiently be implemented in a standard networked environment.
The architecture of multiplicative type-II Cellular Neural Networks with Fuzzy (FCNN) is proposed, which is with local connectivity advantageous suitable implemented for VLSI. The fuzzy AND and fuzzy OR morphological ...
详细信息
ISBN:
(纸本)9781424411092
The architecture of multiplicative type-II Cellular Neural Networks with Fuzzy (FCNN) is proposed, which is with local connectivity advantageous suitable implemented for VLSI. The fuzzy AND and fuzzy OR morphological operators in the Type H FCNN can be operated by Min and Max operations for the feel forward template from neighbouring cell of input image in dynamic parallelprocessing. Base on the proposed FCNN structure that the neuron, Min/Max, analog multiplier, transfer and control circuits are adopted and verified by the HSPICE. The desired experimental chip of 3 x 3 multiplicative type-H FCNN is fabricated using TSMC 0.35 mu m. 2P4M CMOS technology. The measurement results have successfully verified the correct function of FCNN. There have a great potential in the VLSI implementation of neural network systems for binary and gray-level patterns in image-processing for consume electronic applications.(1).
Data availability is a key aspect of modern distributed systems. We discuss an extension of coordination languages based on tuple spaces with programming abstractions for sharing data and guaranteeing availability wit...
详细信息
ISBN:
(纸本)9781538649756
Data availability is a key aspect of modern distributed systems. We discuss an extension of coordination languages based on tuple spaces with programming abstractions for sharing data and guaranteeing availability with different consistency guarantees. Data can be spread over the system according to user-specified replica placement strategies and user-specified consistency requirements. The framework takes care then of low-level management of the replicas, so that the programmer can just focus on the business logic of the application. We advocate that the proposed programming primitives are beneficial for data-oriented applications where different kinds of data may have different needs in terms of availability and consistency.
Computational Grids are a promising platform for executing large-scale resource intensive applications. However, resource management and scheduling in the Grid environment is a complex undertaking as resources are (ge...
详细信息
A grid refinement scheme has been developed for tetrahedral and triangular grid-based calculations in message-passing environments. The element adaption scheme is based on edge bisection of elements marked for refinem...
详细信息
ISBN:
(纸本)354067442X
A grid refinement scheme has been developed for tetrahedral and triangular grid-based calculations in message-passing environments. The element adaption scheme is based on edge bisection of elements marked for refinement by an appropriate error indicator. Hash table/linked list data structures are used to store nodal and element information. The grid along inter-processor boundaries is refined consistently with the update of these data structures via MPI calls. The parallel adaption scheme has been applied to the solution of an unsteady, three-dimensional, nonlinear, groundwater flow problem. Timings indicate efficiency of the grid refinement process relative to the flow solver calculations.
In recent years, key-value stores (KV stores) [1]-[3] begin to gain popularity as storage engines for large-scale data applications. KV stores are fundamentally different from traditional SQL databases and with the ke...
详细信息
This paper proposes a simple paradigm for constructing heuristics for the static assignment of parallel programs onto asynchronous, distributed memory, multiprocessor architectures. The proposed paradigm involves capt...
详细信息
ISBN:
(纸本)0818626720
This paper proposes a simple paradigm for constructing heuristics for the static assignment of parallel programs onto asynchronous, distributed memory, multiprocessor architectures. The proposed paradigm involves capturing the dominant computation and communication components of an application and using this relatively simpler program representation to determine an assignment. Thus, the mapping problem is reduced from its most general form to a simpler form which often has optimal solutions.
Current estimates of mobile data traffic in the years to come foresee a 1,000 increase of mobile data traffic in 2020 with respect to 2010, or, equivalently, a doubling of mobile data traffic every year. This unpreced...
详细信息
Current estimates of mobile data traffic in the years to come foresee a 1,000 increase of mobile data traffic in 2020 with respect to 2010, or, equivalently, a doubling of mobile data traffic every year. This unprecedented growth demands a significant increase of wireless network capacity. Even if the current evolution of fourth-generation (4G) systems and, in particular, the advancements of the long-term evolution (LTE) standardization process foresees a significant capacity improvement with respect to third-generation (3G) systems, the European Telecommunications Standards Institute (ETSI) has established a roadmap toward the fifth-generation (5G) system, with the aim of deploying a commercial system by the year 2020 [1]. The European Project named ?Mobile and Wireless Communications Enablers for the 2020 Information Society? (METIS), launched in 2012, represents one of the first international and large-scale research projects on fifth generation (5G) [2]. In parallel with this unparalleled growth of data traffic, our everyday life experience shows an increasing habit to run a plethora of applications specifically devised for mobile devices, (smartphones, tablets, laptops)for entertainment, health care, business, social networking, traveling, news, etc. However, the spectacular growth in wireless traffic generated by this lifestyle is not matched with a parallel improvement on mobile handsets? batteries, whose lifetime is not improving at the same pace [3]. This determines a widening gap between the energy required to run sophisticated applications and the energy available on the mobile handset. A possible way to overcome this obstacle is to enable the mobile devices, whenever possible and convenient, to offload their most energy-consuming tasks to nearby fixed servers. This strategy has been studied for a long time and is reported in the literature under different names, such as cyberforaging [4] or computation offloading [5], [6]. In recent years, a strong impul
This paper introduces the design and complexity analysis of a parallel genetic algorithm to generate a "best" path for a robot arm to follow, given a starting position and a goal in three-dimensional space. ...
详细信息
ISBN:
(纸本)0769521320
This paper introduces the design and complexity analysis of a parallel genetic algorithm to generate a "best" path for a robot arm to follow, given a starting position and a goal in three-dimensional space. Path generation takes into account any obstacles near the arm. This algorithm uses multiple optimization criteria, independent cross-pollinating populations, and handles multiple hard constraints. Individuals in the population consist of multiple chromosomes. The complexity of the algorithm is the number of generations processed times O(N2) where N is the total number of individuals used for path generation on all of the optimizations. This research is being sponsored by NASA grant NAG 9-1401.
暂无评论