Professional Documents
Culture Documents
Full Chapter Innovations in Computational Intelligence and Computer Vision Proceedings of Icicv 2020 Manoj Kumar Sharma PDF
Full Chapter Innovations in Computational Intelligence and Computer Vision Proceedings of Icicv 2020 Manoj Kumar Sharma PDF
https://textbookfull.com/product/advances-in-computational-
intelligence-proceedings-of-second-international-conference-on-
computational-intelligence-2018-sudip-kumar-sahana/
https://textbookfull.com/product/artificial-intelligence-and-
bioinspired-computational-methods-proceedings-of-the-9th-
computer-science-on-line-conference-2020-vol-2-radek-silhavy/
https://textbookfull.com/product/applied-computer-vision-and-
image-processing-proceedings-of-iccet-2020-volume-1-brijesh-iyer/
https://textbookfull.com/product/advances-in-computer-vision-
proceedings-of-the-2019-computer-vision-conference-cvc-
volume-1-kohei-arai/
Foundations of Mental Health Promotion 2nd Edition
Manoj Sharma
https://textbookfull.com/product/foundations-of-mental-health-
promotion-2nd-edition-manoj-sharma/
https://textbookfull.com/product/computer-vision-and-graphics-
international-conference-iccvg-2020-warsaw-poland-
september-14-16-2020-proceedings-leszek-j-chmielewski/
https://textbookfull.com/product/innovations-in-electrical-and-
electronic-engineering-proceedings-of-iceee-2020-margarita-n-
favorskaya/
https://textbookfull.com/product/computer-vision-eccv-2020-16th-
european-conference-glasgow-uk-august-23-28-2020-proceedings-
part-xvi-andrea-vedaldi/
https://textbookfull.com/product/computer-vision-eccv-2020-16th-
european-conference-glasgow-uk-august-23-28-2020-proceedings-
part-xvii-andrea-vedaldi/
Advances in Intelligent Systems and Computing 1189
Innovations in
Computational
Intelligence and
Computer Vision
Proceedings of ICICV 2020
Advances in Intelligent Systems and Computing
Volume 1189
Series Editor
Janusz Kacprzyk, Systems Research Institute, Polish Academy of Sciences,
Warsaw, Poland
Advisory Editors
Nikhil R. Pal, Indian Statistical Institute, Kolkata, India
Rafael Bello Perez, Faculty of Mathematics, Physics and Computing,
Universidad Central de Las Villas, Santa Clara, Cuba
Emilio S. Corchado, University of Salamanca, Salamanca, Spain
Hani Hagras, School of Computer Science and Electronic Engineering,
University of Essex, Colchester, UK
László T. Kóczy, Department of Automation, Széchenyi István University,
Gyor, Hungary
Vladik Kreinovich, Department of Computer Science, University of Texas
at El Paso, El Paso, TX, USA
Chin-Teng Lin, Department of Electrical Engineering, National Chiao
Tung University, Hsinchu, Taiwan
Jie Lu, Faculty of Engineering and Information Technology,
University of Technology Sydney, Sydney, NSW, Australia
Patricia Melin, Graduate Program of Computer Science, Tijuana Institute
of Technology, Tijuana, Mexico
Nadia Nedjah, Department of Electronics Engineering, University of Rio de Janeiro,
Rio de Janeiro, Brazil
Ngoc Thanh Nguyen , Faculty of Computer Science and Management,
Wrocław University of Technology, Wrocław, Poland
Jun Wang, Department of Mechanical and Automation Engineering,
The Chinese University of Hong Kong, Shatin, Hong Kong
The series “Advances in Intelligent Systems and Computing” contains publications
on theory, applications, and design methods of Intelligent Systems and Intelligent
Computing. Virtually all disciplines such as engineering, natural sciences, computer
and information science, ICT, economics, business, e-commerce, environment,
healthcare, life science are covered. The list of topics spans all the areas of modern
intelligent systems and computing such as: computational intelligence, soft comput-
ing including neural networks, fuzzy systems, evolutionary computing and the fusion
of these paradigms, social intelligence, ambient intelligence, computational neuro-
science, artificial life, virtual worlds and society, cognitive science and systems,
Perception and Vision, DNA and immune based systems, self-organizing and
adaptive systems, e-Learning and teaching, human-centered and human-centric
computing, recommender systems, intelligent control, robotics and mechatronics
including human-machine teaming, knowledge-based paradigms, learning para-
digms, machine ethics, intelligent data analysis, knowledge management, intelligent
agents, intelligent decision making and support, intelligent network security, trust
management, interactive entertainment, Web intelligence and multimedia.
The publications within “Advances in Intelligent Systems and Computing” are
primarily proceedings of important conferences, symposia and congresses. They
cover significant recent developments in the field, both of a foundational and
applicable character. An important characteristic feature of the series is the short
publication time and world-wide distribution. This permits a rapid and broad
dissemination of research results.
** Indexing: The books of this series are submitted to ISI Proceedings,
EI-Compendex, DBLP, SCOPUS, Google Scholar and Springerlink **
Innovations in Computational
Intelligence and Computer
Vision
Proceedings of ICICV 2020
123
Editors
Manoj Kumar Sharma Vijaypal Singh Dhaka
Department of Computer Department of Computer
and Communication Engineering and Communication Engineering
Manipal University Jaipur Manipal University Jaipur
Jaipur, Rajasthan, India Jaipur, Rajasthan, India
This Springer imprint is published by the registered company Springer Nature Singapore Pte Ltd.
The registered company address is: 152 Beach Road, #21-01/04 Gateway East, Singapore 189721,
Singapore
Preface
v
vi Preface
Dey from Techno India College of Technology, Kolkata, India; Dr K.V. Arya,
ABV-IIITM Gwalior, India; and Mr. Aninda Bose, Springer India, for their valu-
able talks for the benefits of the participants. We would like to express our
appreciation to the members of the program committee for their support and
cooperation in this publication. We are also thankful to the team from Springer for
providing a meticulous service for the timely production of this volume.
Our heartfelt thanks to our Honourable President, Manipal University Jaipur,
Dr. G. K. Prabhu; Honourable Pro-president, Manipal University Jaipur, Dr. N. N.
Sharma; Honourable Registrar, Manipal University Jaipur, Dr. Ravishankar
Kamath; Honourable Dean FoE, Dr. Jagannath Korody. Without their support, we
could never have executed such a mega event. Special thanks to all special session
chairs, track managers, and reviewers for their excellent support. Last but not least,
our special thanks go to all the participants who had brightened the event with their
valuable research submissions and presentations.
Advanced Computing
Stochastic Investigation of Two-Unit Redundant System
with Provision of Different Repair Schemes . . . . . . . . . . . . . . . . . . . . . . 3
Monika Saini, Ashish Kumar, and Kuntal Devi
A Workflow Allocation Strategy Under Precedence Constraints
for IaaS Cloud Environment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
Mirza Azeem Beg, Mahfooz Alam, and Mohammad Shahid
Artificial Neural Network Analysis for Predicting Spatial Patterns
of Urbanization in India . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18
Arpana Chaudhary, Chetna Soni, Chilka Sharma, and P. K. Joshi
Satellite Radar Interferometry for DEM Generation Using
Sentinel-1A Imagery . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26
Chetna Soni, Arpana Chaudhary, Uma Sharma, and Chilka Sharma
Cyber Espionage—An Ethical Analysis . . . . . . . . . . . . . . . . . . . . . . . . . 34
Somosri Hore and Kumarshankar Raychaudhuri
Optimized Z-Buffer Using Divide and Conquer . . . . . . . . . . . . . . . . . . . 41
Nitin Bakshi, Shivendra Shivani, Shailendra Tiwari, and Manju Khurana
Data Mining in Cloud Computing: Survey . . . . . . . . . . . . . . . . . . . . . . . 48
Medara Rambabu, Swati Gupta, and Ravi Shankar Singh
Optimal Nodes Communication Coverage Approach for Wireless
Sensor Network Path Planning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57
Usha Soni Verma and Namit Gupta
Reliability Enhancement of Wireless Sensor Network Using Error
Rate Estimation (ERE) Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 69
Usha Soni Verma and Namit Gupta
vii
viii Contents
Innovative Practices
Computer Assisted Classification Framework for Detection of Acute
Myeloid Leukemia in Peripheral Blood Smear Images . . . . . . . . . . . . . . 403
S. Alagu and K. Bhoopathy Bagan
An Efficient Multimodal Biometric System Integrated with Liveness
Detection Technique . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 411
Chander Kant and Komal
Contents xi
Interdisciplinary Areas
Machine Learning Techniques for Predicting Crop Production
in India . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 491
Sarthak Agarwal and Naina Narang
Navier–Stokes-Based Image Inpainting for Restoration of Missing
Data Due to Clouds . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 497
Deepti Maduskar and Nitant Dube
Perception of Plant Diseases in Color Images Through Adaboost . . . . . 506
Cheruku Sandesh Kumar, Vinod Kumar Sharma, Ashwani Kumar Yadav,
and Aishwarya Singh
SWD: Low-Compute Real-Time Object Detection Architecture . . . . . . . 512
Raghav Sharma and Rohit Pandey
Guided Analytics Software for Smart Aggregation, Cognition,
and Interactive Visualisation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 521
Aleksandar Karadimce, Natasa Paunkoska (Dimoska), Dijana Capeska
Bogatinoska, Ninoslav Marina, and Amita Nandal
xii Contents
xiii
xiv About the Editors
Department of Mathematics and Statistics, Manipal University Jaipur, Jaipur, Rajasthan 303007,
India
drmnksaini4@gmail.com, akbrk@rediffmail.com,
kuntal.sangwan@gmail.com
1 Introduction
A lot of studied have been conceded for analysing the consistency and performance of
complex industrial systems. Complexity of any system decreases the productivity of
the system. To enhance the availability and reliability, some researcher suggested that
redundancy is an effective technique. Air crafts, textile manufacturing plants and carbon
reclamation units in fertilizer manufacturing industry get high reliability using various
redundancy approached specially applying cold standby. Chandrasekhar et al. [1] sup-
ported this theory by a study on two-unit cold standby system in which repair rates are
Erlangian distributed. Many researchers like Malik and Deswal [8], Chhillar et al. [2]
and Kumar and Saini [4] using the theories of precautionary maintenance and priority in
repair discipline, constant failure, and repair rates for identical unit redundant systems.
Zhang and Wang [11] developed geometric model using the concept of priority in opera-
tion and repair for a repairable system having cold standby redundancy. Moghassass et al.
© Springer Nature Singapore Pte Ltd. 2021
M. K. Sharma et al. (eds.), Innovations in Computational Intelligence and Computer Vision,
Advances in Intelligent Systems and Computing 1189,
https://doi.org/10.1007/978-981-15-6067-5_1
4 M. Saini et al.
[10] analysed reliability measures of redundant system using concept of shut-off rules.
Kumar and Malik [9] proposed some reliability theories for computer systems using
ideas of priority. All the studies referred above discussed various reliability problems of
cold standby structures having alike units in dissimilar set of conventions. But, several
times due to financial constraints, situations do not permit to retain alike unit in reserve.
Furthermost the effort conceded so far based on the hypothesis of persistent failure and
repair proportions, but it is not seeming realistic for many engineering systems. Some
researchers like Gupta et al. [3], Kishan and Jain [5], and Barak et al. [7] advocated some
consistency models for cold standby of non-similar unit repairable systems with arbi-
trary failure and repair laws. Kumar et al. [6] supported the enactment investigation of
redundant systems with priority in various repair disciplines and Weibull law for failure
and repair.
By keeping in mind, the above facts and figures, the present study is designed to
investigate non-identical redundant systems stochastically using the concept of priority
in various situations of system failures. For this purpose, here two various types of
priorities are given, and three stochastic models are developed. The first model is basic
one in which no priority is given, in second model original unit’s repair got preference
over duplicate unit’s repair activities while in third model original unit’s repair got
preference over PM of duplicate unit. A full-time repairman always remains with system
and PM timings are already specified in advance. Altogether failure and repair period
distributions follow Weibull distribution. The random variables have common shape and
distinct scale parameters. Expressions for numerous procedures of system efficacy have
been acquired and shown graphically to climax the significance of the study.
State Description
The possible states (Following the notations of Kumar et al. [6]) of the system are as
follows:
Common to all Models
Model II
Model III
S7 = (Fwr, DPm)
Stochastic Investigation of Two-Unit Redundant System 5
Transition Probabilities
According to Kumar et al. [6], by probabilistic opinions, we have
α β γ α
P01 = , P02 = , P10 = , P19 = ,
α+β α+β α+h+γ α+γ +h
h k h
P1.10 = , P20 = , P26 ,
α+γ +h α+k +h α+h+k
α l β
P27 = , P30 = , P3.11 = ,
α+h+k l+α+β α+β +l
α γ β
P3.12 = , P40 = , P45 = ,
α+β +l α+β +γ α+β +γ
α
P48 = , P52 = 1, P63 = 1, P74 = 1, P81 = 1,
α+β +γ
h
P94 = 1, P10.3 = 1, P11.2 = 1, P12.1 = 1, p13.10 = ,
α+γ +h
α α h
p14.9 = , p24.7 = , p23.6 = ,
α+γ +h α+h+k α+h+k
α β
p31.12 = , p32.11 = ,
α+β +l α+β +l
α β
p41.8 = , p42.5 = ,
α+β +γ α+β +γ
P32.11 andP42.5 are not available in model II, P54 = 1, P11.3 = 1.
1 + η1 1 + η1
μ2 = 1
, μ0 = 1
(α + k + h) η (α + β) η
6 M. Saini et al.
1 1 (α + β)
μ4 = 1 + + ,
η (α + β + γ )
1
η
1
(α + β + γ )(γ ) η
1 + η1 (1 + η1 )
μ3 = 1
, μ5 = 1
(α + β + l) η (f ) η
1 1 (α)
μ3 = 1 + +
η (α + β + l) η
1 1
(α + β + l)(l) η
1 1 (α)
μ4 = 1 + +
η (α + β + γ ) η
1 1
(α + β + γ )(γ ) η
By applying similar approach availability and mean sojourn times of third model
has been obtained.
Investigation of Availability
By stochastic influences, the recurrence relations for system availability X i (t) are derived
as follows:
(n)
Xi (t) = Ci (t) + qi,j (t) © Xj (t) (1)
j
(n)
EiR (t) = Qi,j (t) ® δj + EjR (t) ;
j
Stochastic Investigation of Two-Unit Redundant System 7
(n)
EiPm (t) = Qi,j (t) ® δj + EjPm (t) ;
j
(n)
Ni (t) = Qi,j (t) ® δj + Nj (t) (4)
j
Here δj = 1, if j is the regenerative stage wherever the server prepares his work
again, otherwise δj = 0. Where i and j represent regenerative states. Taking LST of
above relations (4) and solving for
E0R (s). The expected numbers of repairs per unit time
are given by
Profit Analysis
The profit generated by system in steady state can be obtained by using the following
expression:
Graphical Results
See Figs. 1, 2, 3 and 4.
-0.002
α=2.4
Availability
-0.003
h=0.01
-0.004
-0.005
α=2, h=0.009, l=1.4, k=1.5, γ=5
-0.006 k=1.7
γ=7 l=2
-0.007
Failure Rate
Fig. 1. Availability change (M:I–M:II) versus failure rate (β) for η = 0.5
8 M. Saini et al.
-20
-30
Profit
-40
-50
-60 h=0.01 γ=7
-70
h=0.009,k=1.5,l=1.4,α=2,γ=5 k=1.7
-80
Failure Rate α=2.4
l=2
Fig. 2. Profit change (M:I–M:II) versus failure rate (β) for η = 0.5
-0.008
-0.01 γ=7
-0.012
-0.014
-0.016
h=0.009,k=1.5,l=1.4,α=2,γ=5
-0.018 k=1.7
Failure Rate
l=2
Fig. 3. Availability change (M:I–M:III) versus failure rate (β) for η = 0.5
-20 γ=7
-30 l=2
Profit
-40 h=0.01
-50 k=1.7
-60
-70 α=2.4
l=1.4,k=1.5,h=0.009,α=2,γ=5
-80
Failure Rate
Fig. 4. Profit change (M:I–M:III) versus failure rate (β) for η = 0.5
Stochastic Investigation of Two-Unit Redundant System 9
2 Conclusion
The availability and profit analysis of all the models have been carried out for a specific
situation by assigning shape parameter value η = 0.5 to all the random variables. The
values of all other parameters are kept as constant quantity shown in Figs. 1, 2, 3 and
4 for model I, II, and III. It is observed that the availability and profit rise with respect
to increase of precautionary maintenance rate and repair rate while these declines by
increasing maximum operation time and failure rate in all the three models. From Figs. 1,
2, 3, and 4, it is observed that
• Giving preference to repair of novel unit over preventive maintenance and repair of
replica unit is always beneficial and profitable
• Giving preference to repair of novel unit over precautionary maintenance of replica
unit is profitable.
Hence, use of priority in repair activities is concluded and recommended from the
present study.
References
1. P. Chandrasekhar, R. Natarajan, V.S.S. Yadavalli, A study on a two unit standby system with
Erlangian repair time. Asia-Pac. J. Oper. Res. 21(03), 271–277 (2004)
2. S.K. Chhillar, A.K. Barak, S.C. Malik, Reliability measures of a cold standby system with
priority to repair over corrective maintenance subject to random shocks. Int. J. Stat. Econ.
13(1), 79–89 (2014)
3. R. Gupta, P. Kumar, A. Gupta, Cost-bbenefit analysis of a two dissimilar unit cold standby
system with Weibull failure and repair laws. Int. J. Syst. Assur. Eng. Manag. 4(4), 327–334
(2013)
4. A. Kumar, M. Saini, Cost-benefit analysis of a single-unit system with preventive maintenance
and Weibull distribution for failure and repair activities. J. Appl. Math. Stat. Inform. 10(2),
5–19 (2014)
5. R. Kishan, D. Jain, Classical and Bayesian analysis of reliability characteristics of a two-unit
parallel system with Weibull failure and repair laws. Int. J. Syst. Assur. Eng. Manag. 5(3),
252–261 (2014)
6. A. Kumar, M. Saini, K. Devi, Performance analysis of a redundant system with weibull failure
and repair laws. Revista Investigacion Operacional 37(3), 247–257 (2016)
7. M.S. Barak, D. Yadav, S. Kumari, Stochastic analysis of a two-unit system with standby and
server failure subject to inspection. Life Cycle Reliab. Saf. Eng. (2017). https://doi.org/10.
1007/s41872-017-0033-5
8. S.C. Malik, S. Deswal, Stochastic analysis of a repairable system of non-identical units with
priority for operation and repair subject to weather conditions. Int. J. Comput. Appl. 49(14),
33–41 (2012)
9. A. Kumar, S.C. Malik, Reliability modeling of a computer system with priority to s/w replace-
ment over h/w replacement subject to MOT and MRT. Int. J. Pure Appl. Math. 80, 693–709
(2012)
10. R. Moghassass, M.J. Zuo, J. Qu, Reliability and availability analysis of a repairable-out-of-
system with repairmen subject to shut-off rules. IEEE Trans. Reliab. 60, 658–666 (2011)
11. Y.L. Zhang, G.J. Wang, A geometric process repair model for a repairable cold standby system
with priority in use and repair. Reliab. Eng. Syst. Safety 94, 1782–1787 (2009)
A Workflow Allocation Strategy Under
Precedence Constraints for IaaS Cloud
Environment
mdshahid.cs@gmail.com
Abstract. A big challenge for the adoption of cloud computing in the scientific
community remains the efficient allocation and execution of compute-intensive
scientific workflows to reduce the complexity of workflow application, turnaround
time, and the size of migrated data. The allocation of scientific workflows on
public clouds can be described through a variety of perspectives and parameters.
The workflow allocation problem in cloud environment has been proved to be
NP-complete. This paper presents a new approach for workflow allocation by
managing the precedence constraints on heterogeneous virtual machine in IaaS
cloud with possible minimization of execution time. Here, illustration has been
presented to demonstrate the strategy for a small number of tasks workflow. A
brief comparative performance study has been conducted on the basis of the results
obtained for proposed strategy and HEFT on considered parameters. The study
reveals the better performance of proposed strategy than HEFT on total execution
time (TET) for considered set of tasks.
1 Introduction
platform that is doubter to both user workload and operating system to run different
applications. In this technology, various security threats include as mixed-trust-level
virtual machines (VMs), inter VM attacks, and communication blind spots.
A workflow is a chain management/sequence of steps to achieve finite objective in
any computing environment and to maintain of steps in certain order to ensure effi-
ciency, improve fast execution, and other benefits. Workflow applications are allocated
for processing specially on IaaS cloud. There are many issues on implementation of
workflows viz. machine failures, communication loss, and network congestion [2]. As
heterogeneous VM becomes too massive, computational requirements for running dif-
ficult applications comprise batch of tasks common in order to cater to the parame-
ters in consideration. The process of assigning the tasks onto multiple VMs is known
as scheduling/workflow allocation. Workflow applications represented using Directed
Acyclic Graph (DAG) have always accepted lots of awareness [3, 4]. A schedule for a
DAG is an assignment which specifies the mapping of tasks and VMs and the expected
start time of each task on the mapped machine in the given set of machines with a key
objective to minimize TET. Workflow allocation problems can be major categorized
into two directions such as single workflows and multiple workflows. Some single- and
multiple-workflow applications were proposed to deal with HDSs such as ETF [5], DLS
[6], LMT [7], HEFT [8] LBSIR [9], and many more. Most of the scheduling algorithms
for workflow task allocation require entry and exit task in single vertex. So, if more than
one entry/exit task, they are connected to a pseudo-entry/exit (i.e., called T entry /T exit )
with zero time and communication which does not affect the allocation and the schedule.
In this paper, a new approach for workflow allocation by managing the precedence
constraints on heterogeneous virtual machine in IaaS cloud with possible minimization
of execution time of the workflow is represented by using DAG [10]. The strategy is
consisting of two phases viz. schedule generation and VM selection. In the first phase,
an out degree of vertex-based scheme is used for sorting of all tasks in the workflow
to satisfy the precedence constraints. VM selection phase is same as the HEFT [8].
Further, illustration has been presented to demonstrate the strategy for some small task
size workflows. A brief comparative performance study has been conducted on the basis
of the results obtained for proposed strategy and HEFT on considered parameters.
The paper is organized as follows. Section 2 presents the problem formulation for
the proposed strategy and Sect. 3 presents the proposed strategy for workflow allocation.
Sections 4 and 5 show the illustration and performance study for better understanding
of the work, respectively. Finally, we conclude the work in Sect. 6.
2 Problem Formulation
The formulation of the workflow allocation problem for heterogeneous virtual machines
on cloud computing is considered as making decisions for mapping (f ) of set of tasks
in the workflow (ψ) on set of VMs (V ) with the aim of minimizing the total execution
time (TET) with tasks precedence requirement are satisfied.
f :ψ → V (1)
A workflow is a composition of tasks subject to precedence constraints. First, we
address a deterministic non-preemptive single workflow having batch of task parallel
12 M. A. Beg et al.
where avail[V j ] is available time for task on V j , pred T i is the group of instant predecessor
of task T i , and AFT(T m ) is the actual finish time (AFT) of task (T m ). When all the tasks
are scheduled, the TET will be actual finish time of the last task. Moreover, C m,i , E ij
is the communication cost and execution time of T i on V j as computed as in [8]. After
whole tasks in a DAG are scheduled, the TET will be AFT of the exit task T exit . TET is
the total execution time takes to the current task of workflow and defined as:
In this paper, a new approach is presented for workflow allocation and managing the
precedence constraints on heterogeneous virtual machine for single workflow with possi-
ble aim of minimization of execution time of the workflow for IaaS cloud. The proposed
strategy is an application of DAG scheduling for bounded number of virtual machines.
Proposed strategy has two phases like schedule generation phase and VMs selection
phase for selecting best machine, which minimizes execution time of the task.
This phase provides the order in which tasks are executed with preserving precedence
constraints. The schedule phase for preserving precedence constraints of the tasks is used
in top-to-bottom and left-to-right approaches. In this phase, first, we will find tasks with
maximum out degree (odmax ) from top-to-bottom and left-to right in the given workflow.
Starting from T entry , next task will be selected for execution which has odmax then second
next and so on. Tie-breaking is done using which has largest Average Execution Cost
(E ij ) is first executed. If the average execution cost is equal, then tie-breaking is done
randomly. From this strategy, no need of extra effort upward rank (UPr ) calculation to
preserve precedence constraints for maintaining the Schedule Order (Or ).
Another random document with
no related content on Scribd:
back
back
back
back
back
back
back
back
back
back
back
back
back
back
back
back
back
back