In this paper we propose two price-based job allocation schemes for computational grids. A grid system tries to solve problems submitted by various grid users by allocating the jobs to the computing resources governed...
详细信息
ISBN:
(纸本)0769523129
In this paper we propose two price-based job allocation schemes for computational grids. A grid system tries to solve problems submitted by various grid users by allocating the jobs to the computing resources governed by different resource owners. The prices charged by these owners are obtained based on a pricing model using a bargaining game theory framework. These prices are then used for job allocation. We present the grid system model and formulate the two schemes as a constraint minimization problem and as a non-cooperative game respectively. The objective of these schemes is to minimize the cost for the grid users. We present algorithms to compute the optimal load (job) fractions to allocate jobs to the computers. Finally, the two schemes are compared under simulations with various system loads and configurations and conclusions are drawn.
The paper considers the problem of constructing a planer orthogonal grid drawing (or more simply, layout) of an n-vertex graph, with the goal of minimizing the number of bends along the edges. It exhibits graphs that ...
详细信息
A distributed Monte Carlo simulation which models the propagation of light through tissue has been developed. It will allow for improved calibration of medical imaging devices for investigating tissue oxygenation in t...
详细信息
This paper describes agent technology and the various ways in which it can be applied to command. control. communications and intelligence in general, and to network-centric warfare in particular The paper provides a ...
详细信息
ISBN:
(纸本)0769510655
This paper describes agent technology and the various ways in which it can be applied to command. control. communications and intelligence in general, and to network-centric warfare in particular The paper provides a brief overview of agents, their properties, and their advantages. it covers the concept of the current military trend, network-centric warfare. Problems associated with agents are described, including the conflict between security and autonomy in a distributed environment. The paper concludes with a discussion of reseal ch trends in mobile agents, particularly with regard to applications in the Department of Defense.
A novel architecture to implement distributed arithmetic in VLSI is presented. This architecture comprises a serial-in random-out multiport memory and a multi-input adder. The design of a 1.25-μm CMOS convolution pro...
详细信息
ISBN:
(纸本)9517212402
A novel architecture to implement distributed arithmetic in VLSI is presented. This architecture comprises a serial-in random-out multiport memory and a multi-input adder. The design of a 1.25-μm CMOS convolution processor chip based on the architecture is reported. Issues in the development of chip architecture and design tools are discussed.
A self-stabilizing distributed system is a faulttolerant distributed system that tolerates any kind and any finite number of transient faults, such as message loss and memory corruption. In this paper, we formulate a ...
详细信息
In our earlier papers, we investigated the parallelization and implementation of Gauss-Seidel (G-S) and Successive Overrelaxation (SOR) power flow analysis on shared memory (SM) and distributed (DM) machines. For the ...
详细信息
In our earlier papers, we investigated the parallelization and implementation of Gauss-Seidel (G-S) and Successive Overrelaxation (SOR) power flow analysis on shared memory (SM) and distributed (DM) machines. For the SOR case, constant acceleration factors obtained from experiments are used to speedup convergence. In this paper, we introduce a new adaptive nonlinear SOR (ANSOR) algorithm which uses an approximated optimal acceleration factor obtained during the iteration process. The algorithm is shown to be faster due to the significant reduction in the number of iterations, and to converge robustly under heavily-loaded conditions on large power systems. We also implement parallel and sequential versions of our ANSOR algorithm on the nCUBE2 machine, and show that our algorithm is competitive with the fast decoupled load flow (FDLF) algorithm. Moreover, the portability of the parallel ANSOR code is demonstrated by porting the code to the Intel iPSC/860 hypercube and the Paragon mesh MIMD machines. However, our new algorithm is not a panacea for all problems, as we demonstrate with an example from transient stability analysis.
A new class of parallel normalized preconditioned conjugate gradient type methods in conjunction with normalized approximate inverses algorithms, based on normalized approximate factorization procedures, for solving s...
详细信息
This paper deals with general nested loops and proposes a novel scheduling methodology for reducing the communication cost of parallel programs. General loops contain complex loop bodies (consisting of arbitrary progr...
详细信息
ISBN:
(纸本)0769523269
This paper deals with general nested loops and proposes a novel scheduling methodology for reducing the communication cost of parallel programs. General loops contain complex loop bodies (consisting of arbitrary program statements, such as assignments, conditions and repetitions) that exhibit uniform loop-carried dependencies. Therefore it is now possible to achieve efficient parallelization for a vast class of loops, mostly found in DSP PDEs, signal and video coding. We use computational geometry methods, that exploit efficiently the regularity of nested loops index spaces, in order to significantly reduce the communication cost, which in most cases is the main drawback of parallel programs' performance. Through extensive testing, we show that the proposed method outperforms in all cases the classic cyclic mapping, succeeding to reduce the communication by 15%-35%. This significant reduction of the communication volume makes our method a promising candidate to be incorporated into existing automatic parallel code generation tools.
Every database systems needs to employ searching algorithms to locate and retrieve data. With the proliferation of NoSQL databases, there is a need to design search algorithms that are optimised for the non-relational...
详细信息
ISBN:
(纸本)9781509060290
Every database systems needs to employ searching algorithms to locate and retrieve data. With the proliferation of NoSQL databases, there is a need to design search algorithms that are optimised for the non-relational files and record structures. We propose several search algorithms for document-based databases. The algorithms were designed with parallelism in mind, considering many of the NoSQL databases have very large volume of data. The algorithms were implemented and extensively tested on MongoDB and Apache Spark environment. The test results shows a promising performance of our proposed algorithms.
暂无评论