Task programming in cloud computing

May 13, 20210 likes446 views

This document discusses task programming in cloud computing. It introduces task computing as a way to distribute code execution across remote computing nodes. The document then describes an experiment using RabbitMQ to distribute data analysis tasks across varying numbers of workers. The results show that increasing the number of workers reduces the total time to complete the tasks. Finally, the document concludes that task programming is well-suited for applications that require large-scale distributed computing over long periods of time and can provide a low-cost alternative to grid computing through the use of cloud resources.

Task Programming in Cloud
Computing
Presented By:
Suresh Pokharel (074MSCSK015)
M.Sc. in Computer System and Knowledge Engineering
Institute of Engineering, Pulchowk Campus

Introduction : Task Computing
● A distinct unit of code, or a program, that can be separated
and executed in a remote runtime environment
● Task computing provides distribution by harnessing the
computer power of several computing nodes
● Task computing is categorized into: High-performance
computing (HPC), High-throughput computing (HTC) and
Many-task computing (MTC).

Introduction
● Used a RabbitMQ, A popular open source message broker to distribute a task
on queue
○ Asynchronous Messaging system
○ 100% Availability
○ Distributed Deployment
○ Enterprise & Cloud Ready
● A large task was divided into diﬀerent independent subtask and supplied to
multiple worker to perform the task

Methodology
Data Set:
● Numeric value in large volume
● an individual household electric power consumption time series data set
with 2,075,259 diﬀerent records are considered, each record consists of 9
attributes but this research has considered only 4 attributes

Methodology(Cont...)
Task Separation and Distribution:
● The objective of the workers is to ﬁnd average of Sub_metering_1,
Sub_metering_2, Sub_metering_3.
● To accomplish the task, 2075259 records are divided into diﬀerent 1442
sub-tasks grouped by date attribute
● Message queueing system used to queue the task for higher availability to
workers
● Available workers take the task complete them and wait for next task to be
assigned by message broker

Experiment
● Cloud Platform Used: Heroku
● Server :
○ Memory (RAM): 512 MB
○ Processor: 4 virtual core Intel Xeon X5550 @ 2.67GHz
○ CPU Share: 1x
○ OS: Ubuntu 18.04 LTS
● Internet bandwidth: 5 Mbps (Approx.)
● The main task is performed by varying number of workers i.e. 1, 2, 3, 4 and 5
workers and each worker with Intel core i3-8145U, 3.45 GHz Processor and
4GiB main memory

Result
● The time taken to complete the task using diﬀerent conﬁguration is as follows:
MapReduce Programming Model:
Machine conﬁgurations: I5-4200U intel core 1.6-2.3 ghz(4 cpu)
Main Memory of 4 GiB and result is completed in 3.6s

● Task based programming is most intuitive approach for
distributing the computation of an application over set of nodes
● Increasing number of workers reduces the total work completion
time
● Data to compute in task programming must have large
computing power over a long period of time
● By use of cloud computing it can be low cost alternative over
grid computing
Conclusion

References
[1] Lee, Edward A. "The problem with threads." Computer 39.5 (2006): 33-42.
[2] Buyya, Rajkumar, Christian Vecchiola, and S. Thamarai Selvi. Mastering cloud computing: foundations and
applications programming. Newnes, 2013.
[3] Gunarathne, Thilina, et al. "MapReduce in the Clouds for Science." 2010 IEEE second international conference
on cloud computing technology and science. IEEE, 2010.
[4] Ge, Yujia, and Guiyi Wei. "GA-based task scheduler for the cloud computing systems." 2010 International
Conference on Web Information Systems and Mining. Vol. 2. IEEE, 2010.
[5] Lin, Weiwei, et al. "Bandwidth‐aware divisible task scheduling for cloud computing." Software: Practice and
Experience 44.2 (2014): 163-174.
[6] Mocanu, Eleonora Maria, et al. "Cloud computing—task scheduling based on genetic algorithms." 2012 IEEE
International Systems Conference SysCon 2012. IEEE, 2012.
[7] Rostanski, Maciej, Krzysztof Grochla, and Aleksander Seman. "Evaluation of highly available and fault-tolerant
middleware clustered architectures using RabbitMQ." 2014 federated conference on computer science and
information systems. IEEE, 2014.
[8] Foster, Ian, et al. "Cloud computing and grid computing 360-degree compared." arXiv preprint arXiv:0901.0131
(2008).

Support vector machines (SVM) are a supervised learning method used for classification and regression analysis. SVMs find a hyperplane that maximizes the margin between two classes of objects. They can handle non-linear classification problems by projecting data into a higher dimensional space. The training points closest to the separating hyperplane are called support vectors. SVMs learn the discrimination boundary between classes rather than modeling each class individually.

Pram modelMANASYJAYASURYA

This document discusses Parallel Random Access Machines (PRAM), a parallel computing model where multiple processors share a single memory space. It describes the PRAM model, including different types like EREW, ERCW, CREW, and CRCW. It also summarizes approaches to parallel programming like shared memory, message passing, and data parallel models. The shared memory model emphasizes control parallelism over data parallelism, while message passing is commonly used in distributed memory systems. Data parallel programming focuses on performing operations on data sets simultaneously across processors.

Adhoc and Sensor Networks - Chapter 07Ali Habeeb

This document discusses TCP performance over mobile ad hoc networks (MANETs). It begins with an overview of TCP and how it was designed for wired networks. In MANETs, TCP faces challenges from node mobility, which can cause network partitions and route changes. It also discusses how lower network layers like the MAC layer and routing protocols can impact TCP. Several solutions are presented to improve TCP for MANETs, including modifying TCP to better handle mobility-related issues and providing it feedback to distinguish route failures from congestion.

Michal Erel's SIFT presentationwolf

SIFT is a scale-invariant feature transform algorithm used to detect and describe local features in images. It detects keypoints that are invariant to scale, rotation, and partially invariant to illumination and viewpoint changes. The algorithm involves 4 main steps: (1) scale-space extrema detection, (2) keypoint localization, (3) orientation assignment, and (4) keypoint descriptor generation. SIFT descriptors provide a feature vector for each keypoint that is highly distinctive and partially invariant to remaining variations.

Introduction to Parallel and Distributed ComputingSayed Chhattan Shah

Task programmingYogendra Tamang

This document discusses task-based programming models for distributed computing. It defines tasks as distinct units of code that can be executed remotely. Task computing provides distribution by harnessing multiple computing nodes, unlike multithreaded computing within a single machine. The document categorizes task computing into high-performance, high-throughput, and many-task computing. It also describes popular task computing frameworks like Aneka, Condor, Globus Toolkit, and describes developing applications using the Aneka task programming model.

DBSCAN : A Clustering AlgorithmPınar Yahşi

Feedforward neural networkSopheaktra YONG

Evaluating hypothesisswapnac12

This document discusses evaluating hypotheses and estimating hypothesis accuracy. It provides the following key points: - The accuracy of a hypothesis estimated from a training set may be different from its true accuracy due to bias and variance. Testing the hypothesis on an independent test set provides an unbiased estimate. - Given a hypothesis h that makes r errors on a test set of n examples, the sample error r/n provides an unbiased estimate of the true error. The variance of this estimate depends on r and n based on the binomial distribution. - For large n, the binomial distribution can be approximated by the normal distribution. Confidence intervals for the true error can then be determined based on the sample error and standard deviation

Decision Tree - C4.5&CARTXueping Peng

This document discusses decision tree algorithms C4.5 and CART. It explains that ID3 has limitations in dealing with continuous data and noisy data, which C4.5 aims to address through techniques like post-pruning trees to avoid overfitting. CART uses binary splits and measures like Gini index or entropy to produce classification trees, and sum of squared errors to produce regression trees. It also performs cost-complexity pruning to find an optimal trade-off between accuracy and model complexity.

PAC LearningSanghyuk Chun

This document provides an overview of PAC (Probably Approximately Correct) learning theory. It discusses how PAC learning relates the probability of successful learning to the number of training examples, complexity of the hypothesis space, and accuracy of approximating the target function. Key concepts explained include training error vs true error, overfitting, the VC dimension as a measure of hypothesis space complexity, and how PAC learning bounds can be derived for finite and infinite hypothesis spaces based on factors like the training size and VC dimension.

Raster animationabhijit754

Raster animation is created by displaying a sequence of raster images rapidly to create the illusion of motion. Each raster image is stored as a bitmap in system memory and contains information about individual pixels that make up the image. By refreshing the frame buffer with a new bitmap, raster animation is created. There are two main types - traditional using sprite sheets and modern using programming languages. Raster animation provides more realistic images than vector animation but requires more memory and processing power. It is used for applications like 3D/2D animation, games, and movies.

program partitioning and scheduling IN Advanced Computer ArchitecturePankaj Kumar Jain

Support Vector Machines ( SVM ) Mohammad Junaid Khan

Introduction to Graph Neural Networks: Basics and Applications - Katsuhiko Is...Preferred Networks

This presentation explains basic ideas of graph neural networks (GNNs) and their common applications. Primary target audiences are students, engineers and researchers who are new to GNNs but interested in using GNNs for their projects. This is a modified version of the course material for a special lecture on Data Science at Nara Institute of Science and Technology (NAIST), given by Preferred Networks researcher Katsuhiko Ishiguro, PhD.

Machine learning clusteringCosmoAIMS Bassett

This document discusses machine learning concepts including supervised vs. unsupervised learning, clustering algorithms, and specific clustering methods like k-means and k-nearest neighbors. It provides examples of how clustering can be used for applications such as market segmentation and astronomical data analysis. Key clustering algorithms covered are hierarchy methods, partitioning methods, k-means which groups data by assigning objects to the closest cluster center, and k-nearest neighbors which classifies new data based on its closest training examples.

Distributed systems schedulingPragati Startup Presentation Designer firm

This document discusses scheduling in distributed systems. It covers: 1) Common scheduling techniques like min-min, max-min, and sufferage for scheduling independent tasks on dedicated systems. 2) Scheduling dependent tasks modeled as directed acyclic graphs (DAGs) using techniques like critical path on a processor (CPOP) and heterogeneous earliest finish time (HEFT). 3) The need for scheduling algorithms to adapt to dynamic grid environments where tasks may have dependencies on shared files and network transfer times vary.

Genetic algorithm raktimRaktim Halder

This document provides an overview of genetic algorithms. It discusses how genetic algorithms are inspired by natural evolution and use techniques like selection, crossover, and mutation to arrive at optimal solutions. The document covers the history of genetic algorithms, how they work, examples of using genetic algorithms to optimize problems, and their applications in fields like electromagnetism. Genetic algorithms provide a way to find optimal solutions to complex problems by simulating the natural evolutionary process of reproduction, mutation, and selection of offspring.

Kernels and Support Vector MachinesEdgar Marca

This document summarizes a seminar on kernels and support vector machines. It begins by explaining why kernels are useful for increasing flexibility and speed compared to direct inner product calculations. It then covers definitions of positive definite kernels and how to prove a function is a kernel. Several kernel families are discussed, including translation invariant, polynomial, and non-Mercer kernels. Finally, the document derives the primal and dual problems for support vector machines and explains how the kernel trick allows non-linear classification.

Dimensionality Reductionmrizwan969

This document discusses dimensionality reduction techniques for data mining. It begins with an introduction to dimensionality reduction and reasons for using it. These include dealing with high-dimensional data issues like the curse of dimensionality. It then covers major dimensionality reduction techniques of feature selection and feature extraction. Feature selection techniques discussed include search strategies, feature ranking, and evaluation measures. Feature extraction maps data to a lower-dimensional space. The document outlines applications of dimensionality reduction like text mining and gene expression analysis. It concludes with trends in the field.

Graph Based ClusteringSSA KPI

The document discusses graph-based clustering methods. It describes how graphs can be used to represent real-world networks from domains like biology, technology, social networks, and economics. It introduces the idea of using minimal spanning trees and hierarchical clustering to identify clusters in graph data. Two common algorithms for finding minimal spanning trees are described: Prim's algorithm and Kruskal's algorithm. Different strategies for iteratively deleting branches from the minimal spanning tree are also summarized to form clusters, such as deleting the branch with the maximum weight or inconsistent branches based on a reference value.

Chapter 10AbDul ThaYyal

This document provides an overview of concepts related to time and clock synchronization in distributed systems. It discusses the need to synchronize clocks across different computers to accurately timestamp events. Physical clocks drift over time so various clock synchronization algorithms like Cristian's algorithm and Berkeley algorithm are presented to synchronize clocks within a known bound. The Network Time Protocol (NTP) used on the internet to synchronize client clocks to UTC sources through a hierarchy of time servers is also summarized. Logical clocks provide an alternative to physical clock synchronization by assigning timestamps to events based on their order of occurrence.

Data Parallel and Object Oriented ModelNikhil Sharma

Bayesian decesion theoryVARUN KUMAR

IT6601 MOBILE COMPUTINGKathirvel Ayyaswamy

System models in distributed systemishapadhy

The document discusses different models for distributed systems including physical, architectural and fundamental models. It describes the physical model which captures the hardware composition and different generations of distributed systems. The architectural model specifies the components and relationships in a system. Key architectural elements discussed include communicating entities like processes and objects, communication paradigms like remote invocation and indirect communication, roles and responsibilities of entities, and their physical placement. Common architectures like client-server, layered and tiered are also summarized.

Radial basis function network ppt bySheetal,Samreen and Dhanashrisheetal katkar

Data discretizationHadi M.Abachi

The document discusses discretization, which is the process of converting continuous numeric attributes in data into discrete intervals. Discretization is important for data mining algorithms that can only handle discrete attributes. The key steps in discretization are sorting values, selecting cut points to split intervals, and stopping the process based on criteria. Different discretization methods vary in their approach, such as being supervised or unsupervised, and splitting versus merging intervals. The document provides examples of discretization methods like K-means and minimum description length, and discusses properties and criteria for evaluating discretization techniques.

Task Scheduling methodology in cloud computing Qutub-ud- Din

This document outlines a proposed methodology for developing efficient task scheduling strategies in cloud computing. It begins with introductions to cloud computing and task scheduling. It then reviews several relevant existing task scheduling algorithms from literature that focus on objectives like reducing costs, minimizing completion time, and maximizing resource utilization. The problem statement indicates the goals are to reduce costs, minimize completion time, and maximize resource allocation. An overview of the proposed methodology's flow is then provided, followed by references.

A STUDY ON JOB SCHEDULING IN CLOUD ENVIRONMENTpharmaindexing

This document discusses job scheduling algorithms in cloud computing environments. It begins with an introduction to cloud computing and job scheduling challenges. It then reviews several existing job scheduling algorithms that aim to minimize completion time and costs while improving performance and quality of service. These algorithms use approaches like genetic algorithms, priority queues, and workload prediction. The document also discusses issues like priority-based scheduling and balancing mixed workloads. Overall, the document analyzes the problem of job scheduling in clouds and surveys different proposed scheduling algorithms and their objectives.

More Related Content

What's hot (20)

Evaluating hypothesisswapnac12

Decision Tree - C4.5&CARTXueping Peng

PAC LearningSanghyuk Chun

Raster animationabhijit754

program partitioning and scheduling IN Advanced Computer ArchitecturePankaj Kumar Jain

Support Vector Machines ( SVM ) Mohammad Junaid Khan

Introduction to Graph Neural Networks: Basics and Applications - Katsuhiko Is...Preferred Networks

Machine learning clusteringCosmoAIMS Bassett

Distributed systems schedulingPragati Startup Presentation Designer firm

Genetic algorithm raktimRaktim Halder

Kernels and Support Vector MachinesEdgar Marca

Dimensionality Reductionmrizwan969

Graph Based ClusteringSSA KPI

Chapter 10AbDul ThaYyal

Data Parallel and Object Oriented ModelNikhil Sharma

Bayesian decesion theoryVARUN KUMAR

IT6601 MOBILE COMPUTINGKathirvel Ayyaswamy

System models in distributed systemishapadhy

Radial basis function network ppt bySheetal,Samreen and Dhanashrisheetal katkar

Data discretizationHadi M.Abachi

Evaluating hypothesisswapnac12

Decision Tree - C4.5&CARTXueping Peng

PAC LearningSanghyuk Chun

Raster animationabhijit754

program partitioning and scheduling IN Advanced Computer ArchitecturePankaj Kumar Jain

Support Vector Machines ( SVM ) Mohammad Junaid Khan

Introduction to Graph Neural Networks: Basics and Applications - Katsuhiko Is...Preferred Networks

Machine learning clusteringCosmoAIMS Bassett

Distributed systems schedulingPragati Startup Presentation Designer firm

Genetic algorithm raktimRaktim Halder

Kernels and Support Vector MachinesEdgar Marca

Dimensionality Reductionmrizwan969

Graph Based ClusteringSSA KPI

Chapter 10AbDul ThaYyal

Data Parallel and Object Oriented ModelNikhil Sharma

Bayesian decesion theoryVARUN KUMAR

IT6601 MOBILE COMPUTINGKathirvel Ayyaswamy

System models in distributed systemishapadhy

Radial basis function network ppt bySheetal,Samreen and Dhanashrisheetal katkar

Data discretizationHadi M.Abachi

Similar to Task programming in cloud computing (20)

Task Scheduling methodology in cloud computing Qutub-ud- Din

A STUDY ON JOB SCHEDULING IN CLOUD ENVIRONMENTpharmaindexing

A01260104IOSR Journals

This document discusses architectural and security management for grid computing. It begins by defining grid computing as an environment that enables sharing of distributed resources across organizations to achieve common goals. It then describes the key components of a grid, including computation resources, storage, communications, software/licenses, and special equipment. The document outlines a four-level grid architecture including a fabric level, core middleware level, user middleware level, and application level. It also discusses important aspects of grid computing such as resource balancing, reliability through distribution, parallel CPU capacity, and management of different projects. Finally, it emphasizes that security is a major concern for grid computing due to the open nature of sharing resources across organizational boundaries.

GRID COMPUTINGAbhiram Kanigolla

The document discusses grid computing in remote sensing data processing. It describes how grid computing can help process huge amounts of remote sensing data in real-time by distributing processing across networked computers. Key requirements for a grid environment for remote sensing include sharing computational and software resources, managing resources, and supporting different data formats. Case studies demonstrate how grid middleware can improve the efficiency of tasks like image deblurring and generating lookup tables for aerosol analysis.

Scheduling Divisible Jobs to Optimize the Computation and Energy Costsinventionjournals

ABSTRACT : The important challenge in cloud computing environment is to design a scheduling strategy to handle jobs, and to process them in a heterogeneous environment with shared data centers. In this paper, we attempt to investigate a new analytical framework model that enables an existing private cloud data-center for scheduling jobs and minimizing the overall computation and energy cost together. Our model is based on Divisible Load Theory (DLT) model to derive closed-form solution for the load fractions to be assigned to each machines considering computation and energy cost. Our analysis also attempts to schedule the jobs such a way that cloud provider can gain maximum benefit for his service and Quality of Service (QoS) requirement user’s job. Finally, we quantify the performance of the strategies via rigorous simulation studies.

035Kasun Rodrigo

This document summarizes a paper on deploying CPU load balancing in a Linux cluster. It discusses: 1) Maintaining load balancing in computing clusters is challenging due to unpredictable load variations. The paper addresses this challenge by designing a dynamic load balancing algorithm. 2) The algorithm designates one node as the master server to maintain CPU and IP information for all nodes. Nodes report their status every 30 seconds. 3) A load balancer node selects the least busy node to process new tasks in a non-repetitive way, maintaining an even load distribution. It solves the readers-writers problem using sockets instead of file locking.

Achieving High Performance Distributed System: Using Grid, Cluster and Cloud ...IJERA Editor

To increase the efficiency of any task, we require a system that would provide high performance along with flexibilities and cost efficiencies for user. Distributed computing, as we are all aware, has become very popular over the past decade. Distributed computing has three major types, namely, cluster, grid and cloud. In order to develop a high performance distributed system, we need to utilize all the above mentioned three types of computing. In this paper, we shall first have an introduction of all the three types of distributed computing. Subsequently examining them we shall explore trends in computing and green sustainable computing to enhance the performance of a distributed system. Finally presenting the future scope, we conclude the paper suggesting a path to achieve a Green high performance distributed system using cluster, grid and cloud computing.

J41046368IJERA Editor

International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.

A customized task scheduling in cloud using genetic algorithmeSAT Journals

Abstract Cloud computing is an emerging technology in distributed computing which provides pay per use according to user demand and requirement. The primary aim of the Cloud computing is to provide efficient access to distributed resources. Scheduling of task is a critical issue in cloud computing, because it serves many users. The An approach for categorizing the tasks as Hard Real-Time Tasks (critical tasks that need to be completed on time with high rates of confidentiality) and Soft Real-Time Tasks (tasks that can be completed with certain delay and still can be efficient in its own way) before they are scheduled is applied. From the results observed the efficient processor for a particular combination of the tasks is determined thus producing customized results for each of the tasks. Efficient task scheduling is of high criticality for obtaining high performance in heterogeneous multiprocessor systems. Since task scheduling is a NP-hard problem, The Genetic Algorithm, an Evolutionary Algorithm which make use of techniques inspired by evolutionary biology such as inheritance, mutation, selection and crossover that is capable of producing optimal solutions. Keywords-Task Scheduling, NP-hard problem, Genetic Algorithm, Hard Real-Time Tasks, Soft Real –Time Tasks

PERFORMANCE FACTORS OF CLOUD COMPUTING DATA CENTERS USING [(M/G/1) : (∞/GDM O...ijgca

The ever-increasing status of the cloud computing h ypothesis and the budding concept of federated clou d computing have enthused research efforts towards in tellectual cloud service selection aimed at develop ing techniques for enabling the cloud users to gain max imum benefit from cloud computing by selecting services which provide optimal performance at lowes t possible cost. Cloud computing is a novel paradig m for the provision of computing infrastructure, whic h aims to shift the location of the computing infrastructure to the network in order to reduce th e maintenance costs of hardware and software resour ces. Cloud computing systems vitally provide access to l arge pools of resources. Resources provided by clou d computing systems hide a great deal of services fro m the user through virtualization. In this paper, t he cloud data center is modelled as queuing system with a single task arrivals and a task request buffer of infinite capacity.

Hadoop scheduler with deadline constraintijccsa

A popular programming model for running data intensive applications on the cloud is map reduce. In the Hadoop usually, jobs are scheduled in FIFO order by default. There are many map reduce applications which require strict deadline. In Hadoop framework, scheduler wi t h deadline con s t ra in t s has not been implemented. Existing schedulers d o not guarantee that the job will be completed by a specific deadline. Some schedulers address the issue of deadlines but focus more on improving s y s t em utilization. We have proposed an algorithm which facilitates the user to specify a jobs deadline and evaluates whether the job can be finished before the deadline. Scheduler with deadlines for Hadoop, which ensures that only jobs, whose deadlines can be met are scheduled for execution. If the job submitted does not satisfy the specified deadline, physical or virtual nodes can be added dynamically to complete the job within deadline[8].

Resisting skew accumulationMd. Hasibur Rashid

This paper addresses the issue of accumulated computational and communication skew in time-stepped scientific applications running on cloud environments. It proposes a new approach called AsyTick that fully exploits parallelism among application ticks to resist skew accumulation. AsyTick uses a data-centric programming model and runtime system to allow decomposing computational parts of objects into asynchronous sub-processes. Experimental results show the proposed approach improves performance over state-of-the-art skew-resistant approaches by up to 2.53 times for time-stepped applications in the cloud.

Lecture_IIITD.pptxachakracu

The document discusses IoT, edge computing, and machine learning. It provides an overview of edge computing and how it differs from cloud computing by processing data near its source to improve response times. It also discusses edge intelligence, which combines AI and edge computing by enabling machine learning algorithms to run on edge devices. The document outlines some challenges in edge computing like real-time scheduling on reconfigurable platforms. It summarizes some of the speaker's research on techniques like voltage scaling partitions to enable low-power edge inference on FPGAs.

D04573033IOSR-JEN

This document provides an overview of scheduling mechanisms in cloud computing. It discusses task scheduling, gang scheduling based on performance and cost evaluation, and resource scheduling. For task scheduling, it describes classifying tasks based on quality of service parameters and MapReduce level scheduling. It then explains two gang scheduling algorithms - Adaptive First Come First Serve (AFCFS) and Largest Job First Serve (LJFS) - and how they are used to evaluate performance and cost. Finally, it briefly discusses resource scheduling and factors that affect scheduling mechanisms in cloud computing like efficiency, fairness, costs, and communication patterns.

Efficient Offloading and Task Scheduling in Internet of Thingth-Cloud-Fog Env...waelgamal27

call for papers, research paper publishing, where to publish research paper, ...International Journal of Engineering Inventions www.ijeijournal.com

This document summarizes and compares various scheduling algorithms used in cloud computing environments. It begins with an introduction to cloud computing and the need for scheduling algorithms in cloud environments. It then describes several existing scheduling algorithms, including compromised-time-cost scheduling, particle swarm optimization-based heuristic, improved cost-based algorithm, resource-aware scheduling, innovative transaction intensive cost-constraint scheduling, scalable heterogeneous earliest-finish-time algorithm, and multiple QoS constrained scheduling strategy of multi-workflows. These algorithms aim to optimize metrics such as execution time, cost, deadline, load balancing, and quality of service. The document concludes by comparing the different scheduling strategies.

An Efficient Cloud Scheduling Algorithm for the Conservation of Energy throug...IJECEIAES

Method of broadcasting is the well known operation that is used for providing support to different computing protocols in cloud computing. Attaining energy efficiency is one of the prominent challenges, that is quite significant in the scheduling process that is used in cloud computing as, there are fixed limits that have to be met by the system. In this research paper, we are particularly focusing on the cloud server maintenance and scheduling process and to do so, we are using the interactive broadcasting energy efficient computing technique along with the cloud computing server. Additionally, the remote host machines used for cloud services are dissipating more power and with that they are consuming more and more energy. The effect of the power consumption is one of the main factors for determining the cost of the computing resources. With the idea of using the avoidance technology for assigning the data center resources that dynamically depend on the application demands and supports the cloud computing with the optimization of the servers in use.

IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...IJERD Editor

This document summarizes and compares three computing models: cluster computing, grid computing, and cloud computing. Cluster computing involves linking together multiple computers to work as a single system for high performance computing tasks. Grid computing divides and distributes large programs across interconnected computers. Cloud computing provides on-demand access to shared computing resources over the internet. The document discusses challenges, examples of projects and applications for each model to provide an overview of how they differ and are applied.

A NOVEL METHODOLOGY FOR TASK DISTRIBUTION IN HETEROGENEOUS RECONFIGURABLE COM...ijesajournal

Modern embedded systems are being modeled as Heterogeneous Reconfigurable Computing Systems (HRCS) where Reconfigurable Hardware i.e. Field Programmable Gate Array (FPGA) and soft core processors acts as computing elements. So, an efficient task distribution methodology is essential for obtaining high performance in modern embedded systems. In this paper, we present a novel methodology for task distribution called Minimum Laxity First (MLF) algorithm that takes the advantage of runtime reconfiguration of FPGA in order to effectively utilize the available resources. The MLF algorithm is a list based dynamic scheduling algorithm that uses attributes of tasks as well computing resources as cost function to distribute the tasks of an application to HRCS. In this paper, an on chip HRCS computing platform is configured on Virtex 5 FPGA using Xilinx EDK. The real time applications JPEG, OFDM transmitters are represented as task graph and then the task are distributed, statically as well dynamically, to the platform HRCS in order to evaluate the performance of the designed task distribution model. Finally, the performance of MLF algorithm is compared with existing static scheduling algorithms. The comparison shows that the MLF algorithm outperforms in terms of efficient utilization of resources on chip and also speedup an application execution.

A NOVEL METHODOLOGY FOR TASK DISTRIBUTION IN HETEROGENEOUS RECONFIGURABLE COM...ijesajournal

Task Scheduling methodology in cloud computing Qutub-ud- Din

A STUDY ON JOB SCHEDULING IN CLOUD ENVIRONMENTpharmaindexing

A01260104IOSR Journals

GRID COMPUTINGAbhiram Kanigolla

Scheduling Divisible Jobs to Optimize the Computation and Energy Costsinventionjournals

035Kasun Rodrigo

Achieving High Performance Distributed System: Using Grid, Cluster and Cloud ...IJERA Editor

J41046368IJERA Editor

A customized task scheduling in cloud using genetic algorithmeSAT Journals

PERFORMANCE FACTORS OF CLOUD COMPUTING DATA CENTERS USING [(M/G/1) : (∞/GDM O...ijgca

Hadoop scheduler with deadline constraintijccsa

Resisting skew accumulationMd. Hasibur Rashid

Lecture_IIITD.pptxachakracu

D04573033IOSR-JEN

Efficient Offloading and Task Scheduling in Internet of Thingth-Cloud-Fog Env...waelgamal27

call for papers, research paper publishing, where to publish research paper, ...International Journal of Engineering Inventions www.ijeijournal.com

An Efficient Cloud Scheduling Algorithm for the Conservation of Energy throug...IJECEIAES

IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...IJERD Editor

A NOVEL METHODOLOGY FOR TASK DISTRIBUTION IN HETEROGENEOUS RECONFIGURABLE COM...ijesajournal

More from Suresh Pokharel (10)

Sequential and Parallel Searching AlgorithmsSuresh Pokharel

Information System ArchitectureSuresh Pokharel

Application of Knowledge Engineering in Legal Data : A case study of the info...Suresh Pokharel

Case Based ReasoningSuresh Pokharel

CNN based Handwritten Signature RecognitionSuresh Pokharel

Signature is commonly accepted as a means of verifying the legality of documents such as certificates, checks, drafts, letters, approvals, etc. The pre-trained CNN model, GoogleNet is used for the experiment and the TensorFlow platform is used. GoogleNet model consists of two parts; a classification layer and a feature extraction layer. The parameters on the classification layer are removed and trained with the transfer values from the feature extraction layer of the model. Problems in countering the forgery and falsification of such documents in diverse financial, legal, academic, and other commercial settings.

Comparison of ANN Algorithm for Water Quality Prediction of River GangaSuresh Pokharel

Study of Vitellogenin MotifSuresh Pokharel

Gene Identification in Alzheimer Disease Using Bioinformatics AnalysisSuresh Pokharel

This document summarizes a bioinformatics study that aimed to identify genes associated with Alzheimer's disease (AD) by analyzing gene expression data from neurocytes treated with excess manganese, which is toxic to neurons and implicated in AD development, and from AD patients versus controls. The methodology involved analyzing two gene expression datasets with Venn analysis to find differentially expressed genes shared between manganese-treated neurocytes and AD patients. The results found a significant intersection between the two groups, identifying key genes involved in both manganese toxicity and AD processes.

Conditional Random FieldsSuresh Pokharel

Principal component analysis and ldaSuresh Pokharel

PCA and LDA are dimensionality reduction techniques. PCA transforms variables into uncorrelated principal components while maximizing variance. It is unsupervised. LDA finds axes that maximize separation between classes while minimizing within-class variance. It is supervised and finds axes that separate classes well. The document provides mathematical explanations of how PCA and LDA work including calculating covariance matrices, eigenvalues, eigenvectors, and transformations.

Sequential and Parallel Searching AlgorithmsSuresh Pokharel

Information System ArchitectureSuresh Pokharel

Application of Knowledge Engineering in Legal Data : A case study of the info...Suresh Pokharel

Case Based ReasoningSuresh Pokharel

CNN based Handwritten Signature RecognitionSuresh Pokharel

Comparison of ANN Algorithm for Water Quality Prediction of River GangaSuresh Pokharel

Study of Vitellogenin MotifSuresh Pokharel

Gene Identification in Alzheimer Disease Using Bioinformatics AnalysisSuresh Pokharel

Conditional Random FieldsSuresh Pokharel

Principal component analysis and ldaSuresh Pokharel

Recently uploaded (20)

new ppt artificial intelligence historyyyPianoPianist

Smart Storage Solutions.pptx for production engineeringrushikeshnavghare94

211421893-M-Tech-CIVIL-Structural-Engineering-pdf.pdfinmishra17121973

Artificial Intelligence introduction.pptxDrMarwaElsherif

Raish Khanji GTU 8th sem Internship Report.pdfRaishKhanji

This report details the practical experiences gained during an internship at Indo German Tool Room, Ahmedabad. The internship provided hands-on training in various manufacturing technologies, encompassing both conventional and advanced techniques. Significant emphasis was placed on machining processes, including operation and fundamental understanding of lathe and milling machines. Furthermore, the internship incorporated modern welding technology, notably through the application of an Augmented Reality (AR) simulator, offering a safe and effective environment for skill development. Exposure to industrial automation was achieved through practical exercises in Programmable Logic Controllers (PLCs) using Siemens TIA software and direct operation of industrial robots utilizing teach pendants. The principles and practical aspects of Computer Numerical Control (CNC) technology were also explored. Complementing these manufacturing processes, the internship included extensive application of SolidWorks software for design and modeling tasks. This comprehensive practical training has provided a foundational understanding of key aspects of modern manufacturing and design, enhancing the technical proficiency and readiness for future engineering endeavors.

ADVXAI IN MALWARE ANALYSIS FRAMEWORK: BALANCING EXPLAINABILITY WITH SECURITYijscai

With the increased use of Artificial Intelligence (AI) in malware analysis there is also an increased need to understand the decisions models make when identifying malicious artifacts. Explainable AI (XAI) becomes the answer to interpreting the decision-making process that AI malware analysis models use to determine malicious benign samples to gain trust that in a production environment, the system is able to catch malware. With any cyber innovation brings a new set of challenges and literature soon came out about XAI as a new attack vector. Adversarial XAI (AdvXAI) is a relatively new concept but with AI applications in many sectors, it is crucial to quickly respond to the attack surface that it creates. This paper seeks to conceptualize a theoretical framework focused on addressing AdvXAI in malware analysis in an effort to balance explainability with security. Following this framework, designing a machine with an AI malware detection and analysis model will ensure that it can effectively analyze malware, explain how it came to its decision, and be built securely to avoid adversarial attacks and manipulations. The framework focuses on choosing malware datasets to train the model, choosing the AI model, choosing an XAI technique, implementing AdvXAI defensive measures, and continually evaluating the model. This framework will significantly contribute to automated malware detection and XAI efforts allowing for secure systems that are resilient to adversarial attacks.

Degree_of_Automation.pdf for Instrumentation and industrial specialistshreyabhosale19

Introduction to Zoomlion Earthmoving.pptxAS1920

introduction to machine learining for beginersJoydebSheet

Value Stream Mapping Worskshops for Intelligent Continuous SecurityMarc Hornbeek

DSP and MV the Color image processing.pptHafizAhamed8

Lidar for Autonomous Driving, LiDAR Mapping for Driverless Cars.pptxRishavKumar530754

fluke dealers in bangalore..............Haresh Vaswani

The Fluke 925 is a vane anemometer, a handheld device designed to measure wind speed, air flow (volume), and temperature. It features a separate sensor and display unit, allowing greater flexibility and ease of use in tight or hard-to-reach spaces. The Fluke 925 is particularly suitable for HVAC (heating, ventilation, and air conditioning) maintenance in both residential and commercial buildings, offering a durable and cost-effective solution for routine airflow diagnostics.

MAQUINARIA MINAS CEMA 6th Edition (1).pdfssuser562df4

lecture5.pptxJHKGJFHDGTFGYIUOIUIPIOIPUOHIYGUYFGIHAbodahab

Structural Response of Reinforced Self-Compacting Concrete Deep Beam Using Fi...Journal of Soft Computing in Civil Engineering

Analysis of reinforced concrete deep beam is based on simplified approximate method due to the complexity of the exact analysis. The complexity is due to a number of parameters affecting its response. To evaluate some of this parameters, finite element study of the structural behavior of the reinforced self-compacting concrete deep beam was carried out using Abaqus finite element modeling tool. The model was validated against experimental data from the literature. The parametric effects of varied concrete compressive strength, vertical web reinforcement ratio and horizontal web reinforcement ratio on the beam were tested on eight (8) different specimens under four points loads. The results of the validation work showed good agreement with the experimental studies. The parametric study revealed that the concrete compressive strength most significantly influenced the specimens’ response with the average of 41.1% and 49 % increment in the diagonal cracking and ultimate load respectively due to doubling of concrete compressive strength. Although the increase in horizontal web reinforcement ratio from 0.31 % to 0.63 % lead to average of 6.24 % increment on the diagonal cracking load, it does not influence the ultimate strength and the load-deflection response of the beams. Similar variation in vertical web reinforcement ratio leads to an average of 2.4 % and 15 % increment in cracking and ultimate load respectively with no appreciable effect on the load-deflection response.

Resistance measurement and cfd test on darpa subboff modelINDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR

How to use nRF24L01 module with ArduinoCircuitDigest

some basics electrical and electronics knowledgenguyentrungdo88

Compiler Design_Lexical Analysis phase.pptxRushaliDeshmukh2

new ppt artificial intelligence historyyyPianoPianist

Smart Storage Solutions.pptx for production engineeringrushikeshnavghare94

211421893-M-Tech-CIVIL-Structural-Engineering-pdf.pdfinmishra17121973

Artificial Intelligence introduction.pptxDrMarwaElsherif

Raish Khanji GTU 8th sem Internship Report.pdfRaishKhanji

ADVXAI IN MALWARE ANALYSIS FRAMEWORK: BALANCING EXPLAINABILITY WITH SECURITYijscai

Degree_of_Automation.pdf for Instrumentation and industrial specialistshreyabhosale19

Introduction to Zoomlion Earthmoving.pptxAS1920

introduction to machine learining for beginersJoydebSheet

Value Stream Mapping Worskshops for Intelligent Continuous SecurityMarc Hornbeek

DSP and MV the Color image processing.pptHafizAhamed8

Lidar for Autonomous Driving, LiDAR Mapping for Driverless Cars.pptxRishavKumar530754

fluke dealers in bangalore..............Haresh Vaswani

MAQUINARIA MINAS CEMA 6th Edition (1).pdfssuser562df4

lecture5.pptxJHKGJFHDGTFGYIUOIUIPIOIPUOHIYGUYFGIHAbodahab

Structural Response of Reinforced Self-Compacting Concrete Deep Beam Using Fi...Journal of Soft Computing in Civil Engineering

Resistance measurement and cfd test on darpa subboff modelINDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR

How to use nRF24L01 module with ArduinoCircuitDigest

some basics electrical and electronics knowledgenguyentrungdo88

Compiler Design_Lexical Analysis phase.pptxRushaliDeshmukh2

Task programming in cloud computing

1. Task Programming in Cloud Computing Presented By: Suresh Pokharel (074MSCSK015) M.Sc. in Computer System and Knowledge Engineering Institute of Engineering, Pulchowk Campus

2. Introduction : Task Computing ● A distinct unit of code, or a program, that can be separated and executed in a remote runtime environment ● Task computing provides distribution by harnessing the computer power of several computing nodes ● Task computing is categorized into: High-performance computing (HPC), High-throughput computing (HTC) and Many-task computing (MTC).

3. Introduction ● Used a RabbitMQ, A popular open source message broker to distribute a task on queue ○ Asynchronous Messaging system ○ 100% Availability ○ Distributed Deployment ○ Enterprise & Cloud Ready ● A large task was divided into diﬀerent independent subtask and supplied to multiple worker to perform the task

4. Methodology Data Set: ● Numeric value in large volume ● an individual household electric power consumption time series data set with 2,075,259 diﬀerent records are considered, each record consists of 9 attributes but this research has considered only 4 attributes

5. Methodology(Cont...) Task Separation and Distribution: ● The objective of the workers is to ﬁnd average of Sub_metering_1, Sub_metering_2, Sub_metering_3. ● To accomplish the task, 2075259 records are divided into diﬀerent 1442 sub-tasks grouped by date attribute ● Message queueing system used to queue the task for higher availability to workers ● Available workers take the task complete them and wait for next task to be assigned by message broker

6. Experiment ● Cloud Platform Used: Heroku ● Server : ○ Memory (RAM): 512 MB ○ Processor: 4 virtual core Intel Xeon X5550 @ 2.67GHz ○ CPU Share: 1x ○ OS: Ubuntu 18.04 LTS ● Internet bandwidth: 5 Mbps (Approx.) ● The main task is performed by varying number of workers i.e. 1, 2, 3, 4 and 5 workers and each worker with Intel core i3-8145U, 3.45 GHz Processor and 4GiB main memory

7. Result ● The time taken to complete the task using different configuration is as follows: MapReduce Programming Model: Machine configurations: I5-4200U intel core 1.6-2.3 ghz(4 cpu) Main Memory of 4 GiB and result is completed in 3.6s

8. Demonstration

9. ● Task based programming is most intuitive approach for distributing the computation of an application over set of nodes ● Increasing number of workers reduces the total work completion time ● Data to compute in task programming must have large computing power over a long period of time ● By use of cloud computing it can be low cost alternative over grid computing Conclusion

10. References [1] Lee, Edward A. "The problem with threads." Computer 39.5 (2006): 33-42. [2] Buyya, Rajkumar, Christian Vecchiola, and S. Thamarai Selvi. Mastering cloud computing: foundations and applications programming. Newnes, 2013. [3] Gunarathne, Thilina, et al. "MapReduce in the Clouds for Science." 2010 IEEE second international conference on cloud computing technology and science. IEEE, 2010. [4] Ge, Yujia, and Guiyi Wei. "GA-based task scheduler for the cloud computing systems." 2010 International Conference on Web Information Systems and Mining. Vol. 2. IEEE, 2010. [5] Lin, Weiwei, et al. "Bandwidth‐aware divisible task scheduling for cloud computing." Software: Practice and Experience 44.2 (2014): 163-174. [6] Mocanu, Eleonora Maria, et al. "Cloud computing—task scheduling based on genetic algorithms." 2012 IEEE International Systems Conference SysCon 2012. IEEE, 2012. [7] Rostanski, Maciej, Krzysztof Grochla, and Aleksander Seman. "Evaluation of highly available and fault-tolerant middleware clustered architectures using RabbitMQ." 2014 federated conference on computer science and information systems. IEEE, 2014. [8] Foster, Ian, et al. "Cloud computing and grid computing 360-degree compared." arXiv preprint arXiv:0901.0131 (2008).

11. Thank You!

Task programming in cloud computing

Recommended

More Related Content

What's hot (20)

Similar to Task programming in cloud computing (20)

More from Suresh Pokharel (10)

Recently uploaded (20)

Task programming in cloud computing