The proceedings contain 55 papers. The topics discussed include: infrastructures for collaborative networks - an application in elderly care;scalable overlay network deployment for dynamic collaborative groups;on arch...
ISBN:
(纸本)0769522629
The proceedings contain 55 papers. The topics discussed include: infrastructures for collaborative networks - an application in elderly care;scalable overlay network deployment for dynamic collaborative groups;on architecting business performance management grid for adaptive enterprises;a multicast routing algorithm for overlay network built on leased lines;design and analysis of an e-transaction protocol tailored for OCC;a two-level distributed architecture for efficient web content adaptation and delivery;performance evaluations of DCCP for bursty traffic in real-time applications;dual metrics fair queueing: improving fairness and file transfer time;a lightweight approach to authenticated web caching;a case study in running a parallel branch and bound application on the grid;and goal description language for semantic web service automatic composition.
In this study, we have successfully developed a grid-enabled software distributed shared memory called Teamster-G. This system provides users with not only a shared memory programming interface but also a transparent ...
详细信息
This paper deals with distributed CA-CFAR detection in presence of Gaussian and non-Gaussian clutter. In Gaussian environment, we propose to apply a wavelet transform based on soft-thresholding in multisensor CA-CFAR ...
详细信息
The computational cost of training Artificial Neural Network (ANN) algorithms limits the use of large systems capable of processing complex problems. Implementing ANNs on a parallel or distributed platform to improve ...
详细信息
This work presents a new parallel environment for interactive simulations. This environment integrates a MPI-based parallel simulation engine, a visualization module, and a user interface that supports modification of...
详细信息
Presents the introductory welcome message from the conference proceedings. May include the conference officers' congratulations to all involved with the conference event and publication of the proceedings record.
Presents the introductory welcome message from the conference proceedings. May include the conference officers' congratulations to all involved with the conference event and publication of the proceedings record.
Heterogeneous computing systems composed of interconnected machines with varied computational capabilities often operate in environments where there may be sudden machine failures, higher than expected load, or inaccu...
详细信息
ISBN:
(纸本)0769523129
Heterogeneous computing systems composed of interconnected machines with varied computational capabilities often operate in environments where there may be sudden machine failures, higher than expected load, or inaccuracies in estimation of system parameters, Makespan (defined as the completion time for an entire set of tasks) is often the performance feature that is optimized in such systems. It is important that the makespan of a resource allocation (mapping) be robust against errors in task computation time estimates. The problem of optimally mapping tasks onto machines of a heterogeneous computing environment has been shown, in general, to be NP-complete. Therefore, heuristic techniques to find near optimal solutions to this mapping problem are required. The goal of this research is to find a static mapping of tasks so that the robustness of the desired system feature, makespan, is maximized against the errors in task execution time estimates. Seven heuristics to derive near-optimal solutions and an upper bound to this problem are presented and evaluated.
The low-cost and availability of network of workstations have made them attractive solution for high performance computing. Striking progress of network technology is enabling high-performance global computing, with t...
详细信息
Electronic fair-exchange protocols have received significant attention from the research community in the recent past. In loose terms, the fair exchange problem is defined as atomically exchanging electronic items bet...
详细信息
Electronic fair-exchange protocols have received significant attention from the research community in the recent past. In loose terms, the fair exchange problem is defined as atomically exchanging electronic items between two parties. All the known fair exchange protocols today utilize a centralized trusted third party server either actively or passively. In this paper, we propose a distributed protocol for exchange of electronic items using untrusted servers. We perform detailed security analysis and show that the protocol guarantees effectiveness and fairness with Byzantine failures of up to one third of the untrusted servers. We also give the probability of a fair exchange otherwise. Finally we discuss how to deploy the protocol to large online electronic communities and peer-to-peer systems and demonstrate its security guarantees, scalability and load balancing properties.
暂无评论