Fuzzy Based Amalgamated Technique for Optimal Service Time in Distributed Computing System

Abstract

Due to the continuous progress of microprocessor technology and computer network, the distributed computing system (DCS) is currently one of the key areas of interest. The distributed computing system [DCS] provides the ability to share better performance and resources. There are a few registering nodes that communicate with one another through the message transient system. The advancement of new technologies in communication and information leads to the development of distributed systems. Task assignment is a critical step in the distributed computing system. For the proper utilization of available enumeration strength, it is necessary to allocate tasks to the processors, whose features are vastly suitable for execution. In this research paper, we have examined a task allocation problem with fuzzy performance time and fuzzy communication time, which is more realistic and general in nature. The problem of fuzzy task allocation is impure and it has been converted into a single number (i.e crisp one) using the fuzzy magnitude ranking method. Here, a serviceable model has been evolved to establish the system's optimum impedance time by optimal assignment of tasks based on triangular fuzzy execution time and triangular fuzzy communication time processor speed

Distributed System Computation Model Based on Mobile Agent Development Platform

“…In order to ensure the scalability of the system, Distributed Processing System the system adopts the method of dividing different logical computing domains. Participating nodes in a domain perform as many task sets as possible, and implement various load balancing and other algorithms in the domain [10]. A token is set in the domain to identify a domain server.…”

Distributed System Task Assignment Considering Ant Colony Algorithm

“…With the rapid development of computer and information technology and its in-depth integration with traditional technologies in various industries, the data transmitted by task allocation is huge, which will inevitably increase the load pressure of distributed systems. An efficient and reasonable resource scheduling scheme will meet the needs of users At the same time of demand, resources can also be used to the fullest, avoiding the situation that resources are wasted due to idleness or time-consuming due to waiting [1][2]. ACO was initially used to solve the traveling salesman problem by virtue of its good performance in finding optimal paths, and was gradually used in solving task scheduling problems [3].…”