The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - December (2006 vol.17)
pp: 1414-1424
ABSTRACT
<p><b>Abstract</b>—This paper formulates abstract problems of assigning subtasks to agents (processors) in a distributed system with a goal that they can perform its global task efficiently. The paper models the distributed system with a graph that describes the communication capabilities of the constituting agents. This graph is referred to as the "organizational graph.” In addition, the desired task-performing activity is modeled with another graph describing the required communications. Then, a few variants of the task assignment problem are formulated with potentially conflicting objectives (or constraints) of load balancing and communication costs. For some of these variants this paper provides efficient algorithms that solve the assignment problem. Some problems are proven NP-complete, and some others are left open.</p>
INDEX TERMS
Task assignment, distributed systems, load balancing, complexity, information security.
CITATION
Daniel C. Lee, "Some Compartmentalized Secure Task Assignment Models for Distributed Systems", IEEE Transactions on Parallel & Distributed Systems, vol.17, no. 12, pp. 1414-1424, December 2006, doi:10.1109/TPDS.2006.178
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool