3 research outputs found
A Java Distributed Computation Library
This paper describes the design and development of a Java Distributed Computation Library,
which provides a simple development platform for developers who wish to quickly implement
a distributed computation in the context of an SPMD architecture (Single Program, Multiple
Data). The need for this research arose out of the realisation that the currently available
distributed computation libraries and systems do not adequately meet certain criteria, such
as ease of development, dynamic changes to system behaviour, and easy deployment of
distributed software. The proposed solution to this problem was to produce a Java-based
distributed computation library which enables developers to use the Java language to quickly
and easily implement a distributed computation. The results of experiments conducted using
DCL are also presented, as a means of showing that DCL met its design goals
Simulated Annealing Algorithm Combined with Chaos for Task Allocation in Real-Time Distributed Systems
This paper addresses the problem of task allocation in real-time distributed systems with the goal of maximizing the system reliability, which has been shown to be NP-hard. We take account of the deadline constraint to formulate this problem and then propose an algorithm called chaotic adaptive simulated annealing (XASA) to solve the problem. Firstly, XASA begins with chaotic optimization which takes a chaotic walk in the solution space and generates several local minima; secondly XASA improves SA algorithm via several adaptive schemes and continues to search the optimal based on the results of chaotic optimization. The effectiveness of XASA is evaluated by comparing with traditional SA algorithm and improved SA algorithm. The results show that XASA can achieve a satisfactory performance of speedup without loss of solution quality