Publication

Abstract : Our work falls under the domain of optimal resource allocation, which is a wide area and many researches have been done and are still going on. This paper deals specifically in file allocation to servers in a distributed environment. The whole scenario consists of files, servers and some constraints to each file. The main goal is to compile all these files utilizing the servers available with in a deadline to achieve reward points along with optimal memory usage. Algorithms are developed in distributed scenario with complicated constraints namely replication time, file dependencies and vanishing parameter. The former constraint i.e. Replication time is the time by which a compiled file gets replicated to all the other available servers, whereas file dependencies indicate the prerequisites for compiling a file and vanishing constraint is a special parameter which is independent of file, allows the server to remove the files which are already replicated in it based on a criterion which ensures optimal memory usage. The main novelty of our work comes in allocating the files optimally by handling these constraints in a distributed scenario and comparing this algorithm with the previously existing algorithms.