Efficient scheduling algorithms for Mapping resources using differential Evolution for grid computing Environment;
Institution: | Anna University |
---|---|
Department: | Efficient scheduling algorithms for Mapping resources using differential Evolution for grid computing Environment |
Year: | 2015 |
Keywords: | Distributed Computing Grid Computing; Science and humanities |
Record ID: | 1192947 |
Full text PDF: | http://shodhganga.inflibnet.ac.in/handle/10603/35495 |
The last few decades have witnessed a remarkable advancement newlinein the field of Distributed Computing Grid Computing is a form of distributed newlinecomputing It is a wide scale infrastructure that supports sharing of newlineresources and plays a greater role in coordinating problem solving It is a newlinecollection of resources that involves computational capacities and storage newlineresources owned and administered by many different organizations newlineProblems persisting in many fields that could not be solved newlineusing limited resources can be solved with resources in grid computing It newlineprovides dependable consistent pervasive and inexpensive access to newlinehigh end computational capabilities It aggregates the resources of newlinemultiple computers in a network for a single problem at the same time for newlinea scientific or technical one that requires a large number of computer newlineprocessing cycles or access to large amounts of data newlineRecently many methods proposed for grid scheduling have newlinegained attention for achieving high throughput However it results in newlinehigh computation cost and consumes more time In order to overcome newlinethe above stated issues a grid scheduling algorithm is required that newlinecould reduce these overheads and could enhance the throughput newline newline newline%%%reference p103-114.