Two of the main characteristics of computation grids are their heterogeneity and the sharing of resources between different users. This is the cost of the tremendous computing power offered by such platforms. Scheduli...
详细信息
ISBN:
(纸本)9780889867048
Two of the main characteristics of computation grids are their heterogeneity and the sharing of resources between different users. This is the cost of the tremendous computing power offered by such platforms. Scheduling several applications concurrently in such an environment is thus challenging. In this paper we propose a first step towards the scheduling of multiple parallel task graphs (PTG), a class of applications that can benefit of large and powerful platforms, by focusing on the allocation process. We consider the application of a resource constraint on the schedule and determine the number of processors allocated to the different tasks of a PTG while respecting that constraint. We present two different allocation procedures and validate them in simulation over a wide range of scenarios with regard to their respect of the resource constraint and their impact on the completion time of the scheduled applications. We find that our procedures provide a guarantee on the resource usage for a low cost in terms of execution time.
As data collection technologies advance, almost every field of scientific research sees an increase in the amount and frequency of data that can be collected. In many cases, the first best method for preprocessing two...
详细信息
ISBN:
(纸本)9780889867048
As data collection technologies advance, almost every field of scientific research sees an increase in the amount and frequency of data that can be collected. In many cases, the first best method for preprocessing two and three dimensional data sets is to examine them visually, using some sort of plotting software. Although display technology is advancing and monitors are becoming available with increasing resolutions, this increase in available resolution does not necessarily match the rapid increase in data collection. This mismatch leaves researchers with only three choices for visual processing: to view the data in many small chunks, to view only a representative subset of the data, or to create a custom display for viewing much larger data sets at higher resolutions. This paper discusses one method of fullfilling the third option. The process used here is to create a customized display using nine consumer level monitors mounted in a three by three configuration resulting in a display with nine times the resolution of a single monitor. A custom viewing environment is also developed within this project that is designed to lend itself better to the tiled display than would an existing three dimensional data visualization application. The data used for this project consists of a large set of Oceanographic sensor readings taken from several deployments throughout the Gulf of Maine.
Measuring knowledge assets of a company is difficult. Most existing approaches either fail to select the right indicators, to facilitate aggregation of indicators, to reveal correlations between indicators or to forec...
详细信息
ISBN:
(纸本)9780889866560
Measuring knowledge assets of a company is difficult. Most existing approaches either fail to select the right indicators, to facilitate aggregation of indicators, to reveal correlations between indicators or to forecast future indicator values. An approach to overcome these obstacles using Computational Intelligence (CI) is introduced. Different CI techniques are used to enhance two prominent knowledge assessment approaches, the Intellectual Capital Navigator and the Technology Balance.
A distributed constraint optimization problem (DCOP) distributes the variables and constraints among intelligent agents to enable it to be treated as a constraint satisfaction problem. In this paper, we propose a sear...
详细信息
ISBN:
(纸本)9780889866560
A distributed constraint optimization problem (DCOP) distributes the variables and constraints among intelligent agents to enable it to be treated as a constraint satisfaction problem. In this paper, we propose a search method based on the asynchronous distributed optimization (Adopt) algorithm that has been proposed for DCOP. Adopt is a complete method based on a depth-first-search, and operates asynchronously to find the optimal solution for the overall cost. We propose a distributed search method that builds on the merits of Adopt by considering the local load of each agent as opposed to overall optimization. The effect of the proposal was evaluated in simulations.
In the group mutual exclusion problem, each critical section has a type or a group associated with it. Processes requesting critical sections belonging to the same group (that is, of the same type) may execute their c...
详细信息
In the group mutual exclusion problem, each critical section has a type or a group associated with it. Processes requesting critical sections belonging to the same group (that is, of the same type) may execute their critical sections concurrently. However, processes requesting critical sections belonging to different groups (that is, of different types) must execute their critical sections in a mutually exclusive manner. Most algorithms for solving the group mutual exclusion problem that have been proposed so far in the literature treat all groups equally. This is quite acceptable if a process, at the time of making a request for critical section, selects a group for the critical section uniformly. However, if some groups are more likely to be selected than others, then better performance can be achieved by treating different groups in a different manner. In this paper, we propose an efficient algorithm for solving the group mutual exclusion problem when group selection probabilities are nonuniformly distributed. Our algorithm has a message complexity of 2n - 1 per request for critical section, where n is the number of processes in the system. It has low synchronization delay of one message hop and low waiting time of two message hops. The maximum concurrency of our algorithm is n, which implies that if all processes have requested critical sections of the same type then all of them may execute their critical sections concurrently. Finally, the amortized message-size complexity of our algorithm is O(1). Our experimental results indicate that our algorithm outperforms the existing algorithms, whose complexity measures are comparable to that of ours, by as much as 50% in some cases. (C) 2007 Elsevier Inc. All rights reserved.
Although a number of risk management processes and guidelines have been developed, many IT projects still fail due to inadequate management of project risks. In fact, risk management is an emerging practice to be appl...
详细信息
ISBN:
(纸本)9780889866560
Although a number of risk management processes and guidelines have been developed, many IT projects still fail due to inadequate management of project risks. In fact, risk management is an emerging practice to be applied in managing IT projects, and very few studies have been conducted to transfer it into industrial practices. In this paper, some weaknesses are identified in the available tools and techniques that affect the effective use of risk management practices. Two new practices and an implementation model are proposed to address these weaknesses.
With the advent of Grid and application technologies, scientists and engineers are building more and more complex applications to manage and process large data sets, and execute scientific experiments on distributed r...
详细信息
ISBN:
(纸本)9780889866560
With the advent of Grid and application technologies, scientists and engineers are building more and more complex applications to manage and process large data sets, and execute scientific experiments on distributed resources. Such application scenarios require means for composing and executing complex workflows. Therefore, many efforts have been made towards the development of workflow management systems for Grid computing. In this paper, we propose a QoS-based workflow management system and scheduling algorithm that find the best match between workflow applications and resources while meeting QoS requests. The infrastructure is based on the event condition action (ECA) rules in active database. In none of reported works, the ECA rules haven't been used so far. We also attempt to solve the fault tolerance problem by duplicating delayed tasks using proper rules. Some rules are used for QoS monitoring. We implement the ECA rules in Grid-JQA [1, 2] in order to show that using the rules in the grid environment have better performance. The results of a simulation are provided to evaluate the main idea of the paper.
This paper presents the new approach to parallel calculations with the use of mixed formats. Usually parallel computations are done in multibit Pulse Code Modulation (PCM). Using this format requires doing multibit mu...
详细信息
ISBN:
(纸本)9780889866560
This paper presents the new approach to parallel calculations with the use of mixed formats. Usually parallel computations are done in multibit Pulse Code Modulation (PCM). Using this format requires doing multibit multiplications what often decreases the speed of calculations. Mixed formats, which join differential modulation codes such as Delta Modulation (DM) with PCM, can lead to the decrease of code word length and speed-up operation in DSP (Digital Signal Processing). Some kinds of DM such as MDPCM-PCM (Modified Differential Pulse Code Modulation) and SDPCM-PCM (Synthetic DPCM) enable to replace the time-consuming multiplications with fast shift operations. The purpose of this work is working out the new processing methods for the fast-acting increase of DSP algorithms on the basis of parallel computations in mixed formats, especially with the use of MDPCM-PCM and SDPCM-PCM formats.
Surveillance systems based on distributed sensor networks are massively emerging today, as the interest in enhanced safety in this ever changing world gets more actual than ever. Traditional "CCTV" surveilla...
详细信息
ISBN:
(纸本)9780889866560
Surveillance systems based on distributed sensor networks are massively emerging today, as the interest in enhanced safety in this ever changing world gets more actual than ever. Traditional "CCTV" surveillance systems with their centralized processing (compression) and recording architecture together with a simple multi-monitor visualization of the raw video streams bear several drawbacks and limitations. The necessary communication bandwidth to each camera and the computational requirements on the centralized servers strongly limit such systems in terms of the expandability, installation size (cable lengths) and spatial/ temporal resolution of each camera. Additionally, the visualization is counter intuitive and fatiguing due to the massive load of raw video data. We present a distributed network of smart cameras and its integrated visualization. The smart cameras' tracking results are embedded in a common 3D environment as live textures and can be viewed from arbitrary perspectives. Also a georeferenced live visualization embedded in Google Earth is presented. This offers a visualization more abstract from the camera perspective yet more intuitive in terms of integration.
The proceedings contain 51 papers. The topics discussed include: using an updating of DHCP in mobile ad-hoc networks;searching and detecting spatial LSB steganographic images on the Internet;development of parallel di...
详细信息
ISBN:
(纸本)0889865701
The proceedings contain 51 papers. The topics discussed include: using an updating of DHCP in mobile ad-hoc networks;searching and detecting spatial LSB steganographic images on the Internet;development of parallel direct sparse linear solvers within a parallel finite element code;checkpointing and rollback-recovery protocol integrated with VsSG protocol for RYW session guarantee;achieving realtime capabilities in Ethernet networks by edge-coloring of communication conflict-multigraphs;cross-layer designs for mitigating range attacks in ad hoc networks;grid load balancing using an echo system of intelligent ants;critical path routing (CPR) protocol for mobile ad hoc networks;ADPROC: an adaptive routing framework to provide QoS in wireless sensor networks;evaluating the use of Motes and Tinyos for a mobile sensor platform;and a comparison study of optical MIN networks with parallel planes.
暂无评论