Proliferation of digital libraries plus availability of electronic documents from the Internet have created new challenges for computer science researchers and professionals. Documents are easily copied and redistribu...
详细信息
ISBN:
(纸本)354041729X
Proliferation of digital libraries plus availability of electronic documents from the Internet have created new challenges for computer science researchers and professionals. Documents are easily copied and redistributed or used to create plagiarised assignments and conference papers. this paper presents a new, two-stage approach for identifying overlapping documents. the first stage is identifying a set of candidate documents that are compared in the second stage using a matching-engine. the algorithm of the matching-engine is based on suffix trees and it modifies the known matching statistics algorithm. parallel and distributed approaches are discussed at both stages and performance results are presented.
the semidicretization of a time-dependent nonlinear partial differential equation leads to a large-scale initial value problem for ordinary differential equations which often cannot be solved in a reasonable time on a...
详细信息
ISBN:
(纸本)3540663630
the semidicretization of a time-dependent nonlinear partial differential equation leads to a large-scale initial value problem for ordinary differential equations which often cannot be solved in a reasonable time on a sequential computer. We investigate in what extent can be practically exploited the idea of parallelism across method in the case of such large problems, and using a distributed computational system.
Because most of the recognizable queries in deductive databases can be transformed into transitive-closure (TC) problem, the development of efficient algorithms to process the different forms of TC problems within the...
详细信息
Opportunistic managed access to local in-network compute resources can improve the performance of distributed applications and reduce the dependence on shared network resources. Instead of backhauling application data...
详细信息
ISBN:
(纸本)9781665402910
Opportunistic managed access to local in-network compute resources can improve the performance of distributed applications and reduce the dependence on shared network resources. Instead of backhauling application data to a centralized cloud data center for processing, networked services may be adaptively and continuously dispersed into shared compute resources that are closer to the source of need. While this approach has several benefits, support for mission-aware access to computation is often an afterthought, and is implemented as a brittle extension over traditional hold-balancer solutions. In this work, we investigate the design of two priority-aware resource allocation strategies and two brad-balancing dispatching strategies as tint class citizens in an open-source dispersed computing middleware. We present a control theoretic analysis of these load-balancing primitives to identify weaknesses and strengths in our design, and recommend future directions. in parallel, we prototype two priority-aware allocation algorithms to validate our priority predictions. In initial experiments our prototype shows substantial gains in processing prioritized load. Finally, we make our source-code and experimental configurations open source.
Virtual topology design is considered to be one of the key problems in the IP/DWDM optical Internet. Due to its NP-hard nature, withthe objective of minimizing the sum of traffic-weighted hop count, two soft-computin...
详细信息
ISBN:
(纸本)3540240136
Virtual topology design is considered to be one of the key problems in the IP/DWDM optical Internet. Due to its NP-hard nature, withthe objective of minimizing the sum of traffic-weighted hop count, two soft-computing-based methods to design the virtual topology are presented, adopting genetic algorithm and simulated annealing algorithm respectively. A simulation environment is developed and performance evaluations have also been done.
the use of Web caches makes it possible to offer a service of better quality to Internet users. Due to the difficulty in obtaining a real network of caches to experience with, most research projects use Web caches sim...
详细信息
ISBN:
(纸本)0769513484
the use of Web caches makes it possible to offer a service of better quality to Internet users. Due to the difficulty in obtaining a real network of caches to experience with, most research projects use Web caches simulators. this paper presents a Web cache simulator capable of executing simulations of distributed and cooperative Web caches servers. ne simulator allows the measurement of the impact of configuration parameters in the cache performance, making possible to design better cooperative cache networks. To show an example of the simulator use, simulations based in the Brazilian National Research Network - RNP are presented.
in this paper, we extend the Reactive Approach to distributedcomputing. Reactive Systems allow one to use instantaneous broadcast events, which is a very powerful communication means between parallel components, in a...
详细信息
ISBN:
(纸本)081869209X
in this paper, we extend the Reactive Approach to distributedcomputing. Reactive Systems allow one to use instantaneous broadcast events, which is a very powerful communication means between parallel components, in addition to implicit synchronization. Extension to distribution implies that instantaneous broadcast becomes available over the network between local reactive areas. We describe a model of distributed reactive systems, called Synchronized Systems, and several algorithms of detection of instant termination to implement distributed instantaneous broadcast, in the infrastructure we choose to implement systems consist of distributed reactive machines connected to synchronizers. We present various implementations in Java, using SugarCubes, the RMI mechanism and another distributed Processing Environment.
Accelerator based computing platforms have been frequently employed to meet the ever-increasing performance requirements of cloud computing. However, due to their complexity, the efficiency of these platforms is still...
详细信息
ISBN:
(纸本)9781450361248
Accelerator based computing platforms have been frequently employed to meet the ever-increasing performance requirements of cloud computing. However, due to their complexity, the efficiency of these platforms is still an open research question. As a major solution for improving the efficiency of a computing platform, task scheduling, which has been studied extensively in recent decades, should be investigated in the context of accelerator-based cloud computing platforms. For this purpose, this paper compares 10 typical task scheduling algorithms on a classic cloud computing platform proposed by Microsoft, using both random and real application task sets. these 10 task scheduling algorithms can be divided into three categories: the Round Robin algorithm, list-based heuristics and computing-intensive searching algorithms. Experimental results show that searching algorithms outperform the other categories on small task sets;however when the scale of the scheduling problem increases towards that of real situations, list-based heuristics yield better results. Of these, Min-min and CROP are the most prominent.
Known as an NP-Complete problem, the channel routing problem is very important in the automatic layout design of VLSI circuit and printed circuit boards. In this paper, a distributed genetic algorithm for this channel...
详细信息
ISBN:
(纸本)3540240136
Known as an NP-Complete problem, the channel routing problem is very important in the automatic layout design of VLSI circuit and printed circuit boards. In this paper, a distributed genetic algorithm for this channel routing problem is presented in MPI environments. Each node executes genetic operations to own sub-population and communicates synchronously with other nodes to form the global population. the experimental results show that the proposed algorithm maintains the convergence properties of sequential genetic algorithm.
One of the main problems arising when designing distributed High Performance programs, or when restructuring sequential programs for distributed systems, is workload unbalance. the Client-Server paradigm, which is usu...
详细信息
ISBN:
(纸本)354041729X
One of the main problems arising when designing distributed High Performance programs, or when restructuring sequential programs for distributed systems, is workload unbalance. the Client-Server paradigm, which is usually adopted for distributed systems, is not flexible enough to implement effective dynamical workload balancing strategies. the Mobile Agent paradigm can increase the flexibility in the creation of distributed applications (and the restructuring of sequential applications for distributed systems), and can in particular provide with a robust framework for managing dynamical workload balancing. In this paper we show, through a case-study, how the restructuring of a sequential code implementing an irregular algorithm, with adoption of the mobile agent model, allows for yielding a load-balanced distributed version of the algorithm without completely rethinking its structure, and for reusing a great deal of the sequential code.
暂无评论