Nitin Rakesh

Different Job Scheduling Methodologies for Web Application and Web Server in a Cloud Computing Environment

Cloud computing has come out to be an interesting and beneficial way of changing the whole computing world. In this paper, we deal with the various methodologies adopted to handle all the processes and jobs concurrently executing and waiting into the web application and web server housed into the same system or different systems. Also, these different methods will be compared taking into account the same number of jobs, but varied environmental conditions and hence, the result would be formulated. Various issues like virtual resources, queuing strategies, resource managers etc. has been discussed here apart from the main coverage points. All these aspects will be closely studied, observed and proved with proper explanations.

Analysis of Multi-Sort Algorithm on Multi-Mesh of Trees (MMT) architecture

Various sorting algorithms using parallel architectures have been proposed in the search for more efficient results. This paper introduces the Multi-Sort Algorithm for Multi-Mesh of Trees (MMT) Architecture for N=n4 elements with more efficient time complexity compared to previous architectures. The shear sort algorithm on Single Instruction Multiple Data (SIMD) mesh model requires

Failure recovery in XOR'ed networks

4\sqrt{N}+O\sqrt{N}

Analysis of All to All Broadcast on multi mesh of trees using genetic algorithm

time for sorting N elements, arranged on a

Linear-code multicast on parallel architectures

\sqrt{N}\times \sqrt{N}

Efficient Broadcasting in Parallel Networks Using Network Coding

mesh, whereas Multi-Sort algorithm on the SIMD Multi-Mesh (MM) Architecture takes O(N1/4) time for sorting the same N elements, which proves that Multi-Sort is a better sorting approach. We have improved the time complexity of intrablock Sort. The Communication time complexity for 2D Sort in MM is O(n), whereas this time in MMT is O(log n). The time complexity of compare–exchange step in MMT is same as that in MM, i.e., O(n). It has been found that the time complexity of the Multi-Sort on MMT has been improved as on Multi-Mesh architecture.

Buffered based routing and resiliency approach for WMN

The advantage of network coding has recently been used to several diverse problems of broadcast (single and multi-source), network efficiency, algorithmic complexities and in removal of faulty nodes. In our previous work we have shown the significance of network coding in parallel network communication. The fault tolerance and data loss problems in parallel computation are always a bottleneck in implementing the parallel topologies. Subsequently, the key goal is to minimize the amount of bandwidth required during such failures. In this paper, we exploit the distributed nature of network coding to overcome the issues of data loss due to communication failures. This paper also elucidates the procedure of failure recovery by buffering the communicating data at alternative network levels. With our approach, we are able to minimize the chance of data loss and utilize coding opportunities.

Parallel architecture coding: link failure–recovery mechanism (PAC: LF–RM)

Various communication algorithms have been proposed on a variety of network architectures. However, an efficient algorithm on an efficient architecture is always the focus point. We have proposed All to All Broadcast (AAB) algorithm on multi mesh trees using Parallel Random Access Machine (PRAM), which combines the topological properties of multi-mesh and mesh of trees architecture. The algorithm is elaborated by taking eight processors in each mesh. Further, the proposed algorithm has been scaled by the Genetic Algorithm (GA) approach (for correctness) that passes the algorithm through functions such as fitness, crossover, mutation and evaluation. The fitness function deals with conflicts that occur during communication. Crossover and mutation look for new solutions by computing Probability of Crossover (pcc) and Probability of Mutation (pmm) that are compared by an evaluation function.

Storage vs repair bandwidth for network erasure coding in distributed storage systems

Parallel architectures involve communication with the aim of fast receiving of complete information at each node. Several architectures have been proposed to overcome the problem of high communicational and computational time complexity for transferring and receiving information. To reduce the complexity of such communication, we have implemented Linear Network Coding (LNC) in the parallel environment. For verification of our approach, we have considered some parallel architecture for implementing network coding approach and examined our results on these networks in a generic environment. We have formulated a standard approach for parallel networks, showing that by applying this approach effect of faulty nodes, information size and communication complexity exponentially decreases with code length.

k-k sorting on the Multi Mesh of Trees

Before evolution of network coding, communication in multidimensional networks nominates store-and-forward approach. This approach limits information to process in an in-network manner. Furthermore, this traditional approach was unable to find efficient paths and became a bottleneck for several applications. Network coding was introduced as a remedy and offered a new way to transmit information over acyclic and cyclic networks. In this paper, we identified potential areas of network coding application in parallel architecture and specify the relevant facts and results. To diminish the issues of complexity, we have implemented Linear Network Coding (LNC) on 2D-Mesh as a parallel network. For verification of our approach, we have considered some 2D-Mesh architectures for implementing network coding approach, and we have examined our results on this network. We have developed a Parallel network coding approach, which reduces/removes information size and communication complexity exponentially with code length.