Papers by pradeep kumar yadav
Surface modification of cotton knitted fabric manufactured by rotor yarn
Properties of six types ofrotor yarns having two navels i.e. spiral and notched have been evaluat... more Properties of six types ofrotor yarns having two navels i.e. spiral and notched have been evaluated and compared with ring spun hosiery yarn. It was observed that two rotor yarns one from spiral with wax coating and otherfrom notched with wax coating were found to be suitable for knitting. The effect of these two navels of rotor yarns In knitted fabric after bio-polishing was evaluated In terms of handle and dyeing behaviour. These results were compared with knitted fabric produced from ring spun carded hosiery yarn. The study indicated that knitted fabric made out of notched yarn, after bio-polishing, is comparable in terms of fabric handle property to fabric made out of ring spun carded hosiery yarn. In case of dyeing behaviour, rotor yarn based knitted fabric picked up more dye from the dye bath than ring carded hosiery yarn made fabric as indicated by higher K/S values.
INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY, 2005
Distributed Computing System [DCS] has attracted several researchers by posing several challengin... more Distributed Computing System [DCS] has attracted several researchers by posing several challenging problems. In this paper we have developed a mathematical model for allocating “M” tasks of distributed program to “N” multiple processors (M>N) that minimizes the total cost of the program. Relocating the tasks from one processor to another at certain points during the course of execution of the program that contributes to the total cost of the running program has been taken into account. Most of the researchers have considered the cost for relocating the task from one processor to another processor at the end of the phase as a constant. But in real life situations the reallocating cost of the tasks may very processor to processor this is due to the execution efficiency of the processors. Phase-wise execution cost [EC], inter task communication cost [ITCT], residence cost [RC] of each task on different processors and relocation cost [REC] for each task have been considered while pre...
International Journal of Systems, Control and Communications, 2019
A distributed real-time system consists of a set of heterogeneous processors located at possibly ... more A distributed real-time system consists of a set of heterogeneous processors located at possibly different sites and connected by a communication link. Task scheduling in distributed real-time system attracts the attention of the researcher in many disciplines. Many researchers have been developed the solution of task scheduling problem by using different types of technique. In this paper, a hybrid genetic algorithm (HGA) is developed which is a combination of k-means and genetic algorithm to form the clusters of tasks in an effort to minimise the communication costs. A genetic algorithm is also developed to schedule the formed clusters of tasks onto set of processors to minimise the execution costs. The results of the algorithm have been compared with various existing techniques. Experiment results shows that the proposed algorithm achieves better efficiency than other existing techniques.
International Journal of Fuzzy System Applications, 2016
Distributed computing systems [DCS] offer the potential for allocating a number of tasks to diffe... more Distributed computing systems [DCS] offer the potential for allocating a number of tasks to different processors for execution. It is desired to assign the tasks dynamically to that processor whose characteristics are most appropriate for the execution in order to make the best use of the computational power available. This paper proposes a new mathematical model for allocating the tasks of distributed program to multiple processors in order to achieve optimal cost and optimal reliability of the system. Phase-wise execution cost, residence cost of each task on different processors, inter task communication cost and relocation cost for each task have been considered as a fuzzy number which is more realistic and general in nature. The fuzzy problem has been transformed into crisp one by using the defuzzification method. The present algorithm is formulated and applied to numerical examples to demonstrate its effectiveness. The present model is suitable for arbitrary number of phases an...
IFAC Proceedings Volumes, 2014
This paper reports and discusses the numerical controller design for an unconventional Micro Aeri... more This paper reports and discusses the numerical controller design for an unconventional Micro Aerial Vehicle (MAV) having coaxial counter rotating propellers and lateral navigation mechanism of shifting the center of gravity of the MAV to tilt the rotor's plane and get a horizontal component of the thrust. Detailed Simulink model for the MAV's dynamics and the controller is presented and discussed. The model is supposed to be a way point command executer and an illustration of orbit and the point to point navigation command is given as a proof of concept.
International Journal of Computer Applications, 2014
Grid computing is the collection of computer resources from multiple locations to reach a common ... more Grid computing is the collection of computer resources from multiple locations to reach a common goal. The grid is a special type of distributed system with non-interactive workloads that involve a large number of files. Partitioning of the application program/ software into a number of small groups of modules among dissimilar processors is an important parameter to determine the efficient utilization of available resources in a grid computing environment. It also enhances the computation speed. The task partitioning and task allocation activities influence the distributed program/ software properties such as IPC. This paper presents a metaheuristic model, that performs static allocation of a set of "m" modules of distributed tasks/program considering the two conflicting objectives i.e. minimizing the makespan time and balanced utilization of a set of "n" available resources of a grid computing. Experimental results using genetic algorithm indicates that the proposed algorithm achieved these two objectives as well as improve the dynamic heuristics presented in literature.
Task Allocation Model for Reliability and Cost Optimization in Distributed Computing System
International Journal of Modeling, Simulation, and Scientific Computing, 2011
A Distributed Computing System (DCS) is defined as a set of processing elements interconnected by... more A Distributed Computing System (DCS) is defined as a set of processing elements interconnected by communication links. Reliability analysis of these processing elements and communication links is one of the important parameters to achieve the system efficiency. The system efficiency can be improved by making the task allocation properly in DCS. In this paper, we have presented a mathematical model, considering DCS with heterogeneous processors in order to achieve optimal cost and optimal reliability by allocating the tasks to the processors, in such a way that the allocated load on each processor is balanced. The task allocation in DCS is known as NP-hard problem even in the best conditions, and based on the present model, an efficient algorithm have been proposed to obtain optimal solutions. To design the mathematical model, execution time of the tasks on each processor as well as communication time between the tasks has been taken in the form of matrices.
Uploads
Papers by pradeep kumar yadav