DESIGNING A TASK ALLOCATOR FRAMEWORK FOR DISTRIBUTED COMPUTING

Main Article Content

MRITYUNJAY CHAUBEY
MANJARI GUPTA

Abstract

Software Frameworks attempt to capture and implement a software system architecture that is reusable. A frameworks, thus, is a semicode that needs to be customized for a particular reuse. The problem of finding an optimal task allocation in distributed computing system (DCS) is an NP-hard. There are various task allocation algorithms and hence a Task Allocator may implement any of them. Any Task Allocator, hence will have many portions that can be reused to define and implement a Task Allocator. In distributed system a Task Allocation mechanism may be replaced by a new one if a standardized definition of a reusable system architecture for this purpose is available. This work attempts at formalizing a system architecture of a Task Allocator by proposing a framework for the purpose. Here we start the design methodology for OO software and identify the various parts of the software system architecture for task allocation. This effort finally results into a semicode framework. The interesting conclusions include “Identification of that code portion of the semicode framework that does not change when reusedâ€, “Characteristics of the code portion that need customization†and the nature of framework definitions that need to be coded at the time of reuse. In this work OO design of various activities of task allocation process has been carried out as per the OO design methodology. To be objects have been identified the dynamic and functional modeling along with identification use cases, corresponding scenarios and data flow diagrams.

Downloads

Download data is not yet available.

Article Details

Section
Articles

References

Kartik S. and Murthy C. S. R., “Task Allocation Algorithms for Maximizing Reliability of Distributed Computing Systems†IEEE Transactions on Computers, Vol 46, No. 6, Page 719-724, June 1997.

Tripathi A.K., Vidyarthi D.P., Mantri A.N., (1996), “A genetic task allocation algorithm for distributed computing system incorporating problem specific knowledgeâ€, Int. J. of High Speed Computing, Vol. 8 No. 4, 363-370.

Vidyarthi D.P. and Tripathi A.K., “Precedence Constrained Task Allocation in Distributed Computing Systemsâ€, International Journal of High Speed Computing, Vol. 8(1), 1996, pp.47-55.

Sarker B.K., Tripathi A.K. and Kumar N., “Some observations on Load balancing in Distributed Computing Systemsâ€, Proceedings of National Seminar on Applied Systems Engg. and Soft Computing, Agra, 4-5 March, 2000, pp. 167-171.

Tripathi A.K., Sarker B.K., Kumar N. and Vidyarthi D.P., “Multiple Task Allocation with Load Consideration in DCSâ€, International Journal of Information and Computer Science, Vol. 3 No. 1, 2000, pp. 36-44.

Vidyarthi D.P., Tripathi A.K., “A Fuzzy IMC Cost Reduction Model for Task Allocation In Distributed Computing Systemsâ€, fifth International Symposium on Methods and Models in Automation and Robotics, Poland, August 1998, pp 719-721.

Gurp J. V. and Bosch J., “Design, Implementation and Evolution of Object Oriented Frameworks: concepts and guidelinesâ€, Software-Practice and Experience, pp 277-300, 2001.

Fayad M. and Schmidt D. C., “Object-Oriented Application frameworksâ€, Communication of the ACM, Special Issue on Object-Oriented Application Frameworks, Vol 40, No. 10, 1997.

Alhir S. S, “Understanding the Unified Modelling Language (UML)â€, Methods and Tools, published in an International Software Engineering digital newsletter, 1999.

Jalote P., “An Integrated Approach to Software Engfineeringâ€, Narosa, ISBN 81-7319-271-5, Second Edition.

Tripathi A. K. and Gupta M., Some Observations on Reuse Types, Technologies, Practices and Problems, International Journal of Information and Computing Science, Vol.7, No.1, 2004.

Pressman. R. S., “Software Engineering a Practitioner’s Approachâ€, McGraw Hill International Edition, ISBN 007-124083-7, Sixth Edition.