International Journal of Advanced Research in Computer Science, 2018
Multiprocessor scheduling is another name of task scheduling in form of algorithms that are mostl... more Multiprocessor scheduling is another name of task scheduling in form of algorithms that are mostly utilized in systematic as well as engineering appliance that is also known as the issue of NP-complete. The main aim of scheduling is the reduction of execution time. The illustration of task scheduling for multiprocessor scheduling is shown by DAG (Directed Acyclic graph). The categorization for this is into Static as well as dynamic scheduling. The list task scheduling is the example of static task scheduling algorithm. Varied task scheduling algorithms, like ISH, HLFET, MCP, ETF, CNPT and DLS are reviewed in this paper. The comparison of list task scheduling isdependent on metrics, termed as SLR, load balancing, efficiency and speed up.
Proceedings of International Conference on Recent Trends in Machine Learning, IoT, Smart Cities and Applications, 2020
With the explosive growth of technology and the easy availability of content on the web, it creat... more With the explosive growth of technology and the easy availability of content on the web, it creates new challenges to discriminate against the original work from plagiarized material. Content is said to be plagiarized when it is taken from other original sources without giving its reference. To address this issue Plagiarism detection tools are required. Over the years, extensive work has been done in the development of anti-plagiarism tools. This paper presents the types of plagiarism with an aim to review Extrinsic Plagiarism detection techniques using Linguistic-based features, Syntactic-based features, and Semantic-based features. Further, an overview of some current state of art methodologies and their results has been discussed on the dataset of PAN-PC 2009, PAN-PC 2010, and PAN-PC 2011. This paper also analyzes the pros and cons of some existing systems and by comparing results it also identifies that some of the systems have less potency to detect the manual and highly shuffled complex types of plagiarism such as translation obfuscation. Keywords Plagiarism detection • Extrinsic plagiarism detection • Intrinsic plagiarism detection • PAN-PC datasets 1 Introduction World Wide Web provides access to data present in the documents, databases, and other sources of information using internet service. The availability of knowledge and information in the digital form leads to "Plagiarism" by "Plagiarist". Plagiarism
A Survey Of Genetic Algorithm Based Load Balancing Techniques For Task Graph Scheduling Problem In Distributed Environment
International Journal of Scientific & Technology Research, 2019
Evolutionary strategies based on the principle of genetic programming are being used to achieve s... more Evolutionary strategies based on the principle of genetic programming are being used to achieve sub-optimal solutions for various NP-Complete problems. One of the most sought after NP-Complete problem is Task graph scheduling i.e. optimally execute the schedule of tasks on available parallel and distributed environment so as to achieve efficient utilization of available resources. Task scheduling is defined as a multi-objective combinatorial optimization problem, with the aim to achieve reduced completion time and effective load balance on the available resources. Various algorithms have been proposed by various authors to achieve the above mentioned goal with the help of various heuristics based on genetic algorithms. All the proposed algorithms by different researchers have been individually reported to be efficient in some certain restricted environment parameters with certain limitations; offering very preliminary improvement on the state of art of one single type of environment...
A Novel Approach using Image Enhancement based on Genetic Algorithm
A robust wavelet domain method for noise filtering in medical images is one of the techniques use... more A robust wavelet domain method for noise filtering in medical images is one of the techniques used to reduce the noise. The method adapts various types of image noise as well as to the preference of the medical expert: a single parameter is being used to balance the preservation of (expert-dependent) relevant details against the degree of noise reduction. A versatile wavelet domain despeckling technique to visually enhance the medical ultrasound (US) images for improving the clinical diagnosis is used. The method uses the two-sided generalized Nakagami distribution (GND) for modeling the speckle wavelet coefficients and the signal wavelet coefficients are approximated using the generalized Gaussian distribution (GGD) (1). Combining these statistical priors with the Bayesian maximum a posteriori (MAP) criterion, the thresholding/shrinkage estimators are derived for processing the wavelet coefficients of detail subbands. Consequently, two blind speckle suppressors named as GNDThresh a...
International Journal of Engineering and Advanced Technology, 2019
Heuristic based strategies have always been of interest for researchers to achieve sub-optimal so... more Heuristic based strategies have always been of interest for researchers to achieve sub-optimal solutions for various NP-Complete problems. Human evolution based methods have been an inspiration for research since ages. One of the many evolutionary strategies based on the principle of genetic algorithm have been able to provide much sought after sub-optimal solutions for various NP-Complete problems. One of the most sought after NP-Complete problem is Task graph scheduling i.e. optimally execute the schedule of tasks on available parallel and distributed environment so as to achieve efficient utilization of available resources. Task scheduling is a multi-objective combinatorial optimization problem, with key parameters being reduced completion time and effective load balance on the available resources. Various algorithms have been proposed by various authors to achieve the above mentioned goal with the help of various heuristics like list scheduling, task duplication and critical pat...
International Journal of Grid and Distributed Computing, 2018
Network congestion is an emerging issue which degrades the performance of the network and this fu... more Network congestion is an emerging issue which degrades the performance of the network and this further leads to a delay in the delivery of packets from source to destination. Backpressure algorithm is commonly used for providing optimal throughput in scheduling and routing decisions for multi-hop networks with the help of changing traffic. All nodes obey the algorithm rules for the exchange of information. But such an assumption does not always hold in realistic scenarios. In this paper we propose a novel mechanism, for prioritizing emergency and regular packets using Event Aware Backpressure Scheduling scheme with multi-level priority approach. For the protection of backpressure algorithm (based on routing and scheduling protocols) against various insider threats, virtual trust queuing is used. The mechanism overcomes the problem of network congestion and delivers the packets from source to destination on the priority basis. Experimental results show improvement in throughput, loss ratio, delay time, network lifetime, protocol efficiency, dropped node, source frequency rates, and destination frequency rates.
Indian Journal of Computer Science and Engineering, 2018
Cloud computing is a growing technology that provides on demand shared pool of resources over the... more Cloud computing is a growing technology that provides on demand shared pool of resources over the internet. Sharing of resources amongst the number of cloud users makes task scheduling a challenging issue. Task scheduling issue in many cases resolved by meta-heuristic approaches. This paper proposes a solution for task scheduling in a cloud computing environment based on the meta-heuristic, Genetic Algorithm. The proposed solution i.e. Modified Genetic algorithm (MGA) uses a hybrid solution based on Genetic Algorithm along with Predict Earliest Finish Time (PEFT) scheduling on Directed Acyclic Graph (DAG). Simulated results of the Modified Genetic Algorithm are compared with basic GA and with hybrid GA with HEFT (Heterogeneous Finish Time First) scheduling algorithms. Further, comparative analysis has been performed based on makespan, average processor utilization, processing cost metrics. It is observed that MGA gives optimal results in terms of processing cost and processor utilization for the unbounded number of processors.
Journal of Engineering Computers Applied Sciences, Aug 15, 2013
IPv6 is new routing protocol. IPv6 is introduced by IETF mainly due IPv4 address exhaustion but i... more IPv6 is new routing protocol. IPv6 is introduced by IETF mainly due IPv4 address exhaustion but it is also an enhanced version of IPv4. There are many changes in IPv6 header, some fields from IPv6 header has been deprecated from IPv6 and some are newly added. There is also common misconception among people that IPv6 is more secure than IPv4, which is not true. Now a day's intruders are targeting IPv6 networks as it is widely being accepted by many organization for their network. An intruder can do enough damage if it gets unauthorized access to the someone IPv6 network. So, There is need to do more research to secure IPv6 networks. Detecting an intruder in IPv6 network is hot topic among the researchers. Intrusion detection is a technique to detect the unauthorized access to the network. An intrusion-detection system (IDS) monitors system and network to detect intruders that are trying to gather information on network for which they are not authorized. IDS also alerts the administrator for misuse of network. All IDS support IPv4. But only few of them provide good support for IPv6. In this paper, Deployment of small IPv6 network and intrusion detection using Snort in the IPv6 network has been done. Mainly the focus is on intrusion detection in IPv6 network.
International Journal of Innovation and Applied Studies, Aug 2, 2013
Vehicular ad hoc networks (VANETs) are the flaming topic of research. VANET comprises of moving v... more Vehicular ad hoc networks (VANETs) are the flaming topic of research. VANET comprises of moving vehicles communicating with each other. VANETs involve three types of communication: vehicle to vehicle (V2V), vehicle to roadside (V2R) or vehicle to infrastructure (V2I) communication. VANETs consist of some vital components: RSU, OBU and Trusted Authority. Among them Roadside units (RSUs) are one of the fundamental components of Vehicular ad hoc network (VANET). Roadside Units (RSUs) are placed across the road for infrastructure communication. But the deployment cost of RSUs is very high, so to deploy more and more number of RSUs across roads is quite expensive. Thus, there is a need to optimally place a limited number of RSUs in a given region or road in order to achieve maximum performance. In this paper, we present a solution to this problem using parallel processing. A so-called scalable TDB based RSUs deployment algorithm with a goal of minimizing the parallel time taken to place roadside units in a given area and to attain high efficiency and cover maximum area has been presented. The performance of the proposed algorithm and optimization strategy is assessed by evaluating different parameters like efficiency, power consumption, serial elapsed time, parallel elapsed time, speedup and overheads incurred in running the algorithm in parallel.
Multiprocessor task scheduling is considered to be the most important and very difficult issue in... more Multiprocessor task scheduling is considered to be the most important and very difficult issue in High Performance Computing. Task scheduling is performed to match the resource requirement of the job with the available resources resulting in effective utilization of multiprocessor systems. In this paper, a Genetic algorithm (GA) is proposed for static, non-preemptive scheduling problem in homogeneous fully connected multiprocessor systems with the objective of minimizing the job completion time. The proposed GA is used to determine suitable priorities that lead to a sub-optimal solution. To compare the performance of proposed algorithm, Static algorithms of BNP (Bounded Number of Processors) scheduling class i.e. HLFET (Highest Level with First Estimated Time) and MCP (Modified Critical Path) are implemented. HLFET, MCP and proposed GA are tested by mapping our tasks in a directed acyclic graph (DAG). Performance analysis of HLFET, MCP and proposed GA for a given job scheduling problem proves that GA results in better sub-optimal solutions.
International journal of engineering research and technology, 2012
Task Graph Scheduling is an important issue in the distribution of programs on the processors of ... more Task Graph Scheduling is an important issue in the distribution of programs on the processors of a parallel system. Because task graph scheduling is an NPComplete problem, methods of random search are utilized for finding the nearly optimal schedule. Recently, Genetic algorithms have received much awareness as they are robust and guarantee for a good solution. In this paper a new genetic algorithm is proposed based on Object Migration Automaton and is evaluated in comparison with FCFS and MET scheduling. The proposed algorithm begins with an initial population of randomly generated chromosomes and after some stages, each chromosome maps to an automaton.
Uploads
Papers by Ravreet Kaur