نتایج جستجو برای: heterogeneous distributed systems
تعداد نتایج: 1479073 فیلتر نتایج به سال:
Martı́n Abadi, Ashish Agarwal, Paul Barham, Eugene Brevdo, Zhifeng Chen, Craig Citro, Greg S. Corrado, Andy Davis, Jeffrey Dean, Matthieu Devin, Sanjay Ghemawat, Ian Goodfellow, Andrew Harp, Geoffrey Irving, Michael Isard, Yangqing Jia, Rafal Jozefowicz, Lukasz Kaiser, Manjunath Kudlur, Josh Levenberg, Dan Mané, Rajat Monga, Sherry Moore, Derek Murray, Chris Olah, Mike Schuster, Jonathon Shlens,...
Distributed computing is a high performance computing that solves complicated tasks and provides powerful computing abilities . The main purpose of distributed computing is to share the computational power, storage memory, and network resources to solve a large problem. Efficient resource management and job scheduling algorithms are two key issues in distributed computing environment. Design of...
This paper introduces a novel architecture of distributed systems—called framed distributed system, or FDS—that braces a given system via a built-in virtual framework that controls the flow of messages between system components, and between them and their environment—while being oblivious of the code of the communicating components. This control is carried out in a decentralized, and thus scala...
One of the open challenges in distributed computing systems is determining how to place tasks onto processors when they are needed (in the Legion project being developed at UVA the basic computational units are modelled as objects, so the problem is one of object placement). The placement decision is crucial because it determines the run-time behavior of an object, including performance, cost a...
Modern distributed systems tend to be conglomerates of heterogeneous subsystems, which have been designed separately, by di erent people, with little, if any, knowledge of each other | and which may be governed by di erent security policies. A single software agent operating within such a system may nd itself interacting with, or even belonging to, several subsystems, and thus be subject to sev...
Data transferring in scientific workflows gradually attracts more attention due to large amounts of data generated by complex scientific workflows will significantly increase the turnaround time of the whole workflow. It is almost impossible to make an optimal or approximate optimal scheduling for the end-to-end workflow without considering the intermediate data movement. In order to reduce the...
In the past few years we have developed an experimental distributed system that supports multi-task applications with different levels of criticality. Software implemented fault-tolerant protocols are used to support dependable computing. This paper first presents Markov models of a distributed system under the occurrence of faults, reconfiguration and repair. As a part of our overall project, ...
exploit effective parallelism on a distributed system, tasks must be properly allocated to the processors. This problem, task assignment, is well-known to be NPhard in most cases.1 A task-assignment algorithm seeks an assignment that optimizes a certain cost function—for example, maximum throughput or minimum turnaround time. However, most reported algorithms yield suboptimal solutions. In gene...
Scheduling is a key problem in distributed heterogeneous computing systems in order to benefit from the large computing capacity of such systems and is an NP-complete problem. In this paper, we present a metaheuristic technique, namely the Particle Swarm Optimization (PSO) algorithm, for this problem. PSO is a population-based search algorithm based on the simulation of the social behavior of b...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید