Professional Documents
Culture Documents
Get Soft Computing Theories and Applications Proceedings of SoCTA 2016 Volume 1 1st Edition Millie Pant free all chapters
Get Soft Computing Theories and Applications Proceedings of SoCTA 2016 Volume 1 1st Edition Millie Pant free all chapters
OR CLICK LINK
https://textbookfull.com/product/soft-computing-
theories-and-applications-proceedings-of-
socta-2016-volume-1-1st-edition-millie-pant/
Read with Our Free App Audiobook Free Format PFD EBook, Ebooks dowload PDF
with Andible trial, Real book, online, KINDLE , Download[PDF] and Read and Read
Read book Format PDF Ebook, Dowload online, Read book Format PDF Ebook,
[PDF] and Real ONLINE Dowload [PDF] and Real ONLINE
More products digital (pdf, epub, mobi) instant
download maybe you interests ...
https://textbookfull.com/product/soft-computing-theories-and-
applications-proceedings-of-socta-2019-advances-in-intelligent-
systems-and-computing-millie-pant-editor/
https://textbookfull.com/product/proceedings-of-fifth-
international-conference-on-soft-computing-for-problem-solving-
socpros-2015-volume-2-1st-edition-millie-pant/
https://textbookfull.com/product/soft-computing-applications-
proceedings-of-the-8th-international-workshop-soft-computing-
applications-sofa-2018-vol-i-valentina-emilia-balas/
https://textbookfull.com/product/soft-computing-applications-
proceedings-of-the-8th-international-workshop-soft-computing-
applications-sofa-2018-vol-ii-valentina-emilia-balas/
https://textbookfull.com/product/international-proceedings-on-
advances-in-soft-computing-intelligent-systems-and-applications-
asisa-2016-1st-edition-m-sreenivasa-reddy/
https://textbookfull.com/product/computational-network-
application-tools-for-performance-management-millie-pant/
https://textbookfull.com/product/progress-in-advanced-computing-
and-intelligent-engineering-proceedings-of-
icacie-2016-volume-1-1st-edition-khalid-saeed/
Advances in Intelligent Systems and Computing 583
Millie Pant
Kanad Ray
Tarun K. Sharma
Sanyog Rawat
Anirban Bandyopadhyay Editors
Soft
Computing:
Theories and
Applications
Proceedings of SoCTA 2016, Volume 1
Advances in Intelligent Systems and Computing
Volume 583
Series editor
Janusz Kacprzyk, Polish Academy of Sciences, Warsaw, Poland
e-mail: kacprzyk@ibspan.waw.pl
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.
The publications within “Advances in Intelligent Systems and Computing” are primarily
textbooks and 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.
Advisory Board
Chairman
Nikhil R. Pal, Indian Statistical Institute, Kolkata, India
e-mail: nikhil@isical.ac.in
Members
Rafael Bello Perez, Universidad Central “Marta Abreu” de Las Villas, Santa Clara, Cuba
e-mail: rbellop@uclv.edu.cu
Emilio S. Corchado, University of Salamanca, Salamanca, Spain
e-mail: escorchado@usal.es
Hani Hagras, University of Essex, Colchester, UK
e-mail: hani@essex.ac.uk
László T. Kóczy, Széchenyi István University, Győr, Hungary
e-mail: koczy@sze.hu
Vladik Kreinovich, University of Texas at El Paso, El Paso, USA
e-mail: vladik@utep.edu
Chin-Teng Lin, National Chiao Tung University, Hsinchu, Taiwan
e-mail: ctlin@mail.nctu.edu.tw
Jie Lu, University of Technology, Sydney, Australia
e-mail: Jie.Lu@uts.edu.au
Patricia Melin, Tijuana Institute of Technology, Tijuana, Mexico
e-mail: epmelin@hafsamx.org
Nadia Nedjah, State University of Rio de Janeiro, Rio de Janeiro, Brazil
e-mail: nadia@eng.uerj.br
Ngoc Thanh Nguyen, Wroclaw University of Technology, Wroclaw, Poland
e-mail: Ngoc-Thanh.Nguyen@pwr.edu.pl
Jun Wang, The Chinese University of Hong Kong, Shatin, Hong Kong
e-mail: jwang@mae.cuhk.edu.hk
Anirban Bandyopadhyay
Editors
123
Editors
Millie Pant Sanyog Rawat
Department of Applied Science Department of Electronics
and Engineering and Communication Engineering
IIT Roorkee SEEC, Manipal University Jaipur
Saharanpur Jaipur, Rajasthan
India India
Tarun K. Sharma
Department of Computer Science
and Engineering
Amity School of Engineering
and Technology, Amity University
Rajasthan
Jaipur, Rajasthan
India
v
vi Preface
Université de Montréal; Prof. Lalit Garg, University of Malta for delivering invited
lectures.
We express our special thanks to Prof. Ajith Abraham, Director, MIR Labs,
USA, for being a General Chair and finding time to come to Jaipur amid his very
busy schedule.
We are grateful to Prof. W. Selvamurthy and Ambassador (Retd.)
R.M. Aggarwal for their benign cooperation and support.
A special mention of thanks is due to our student volunteers for the spirit and
enthusiasm they had shown throughout the duration of the event.
We express special thanks to Springer and its team for the valuable support in
the publication of the proceedings.
With great fervor, we wish to bring together researchers and practitioners in the
field of Soft Computing year after year to explore new avenues in the field.
Patrons-in-Chief
Patron
Co-patron
General Chair
vii
viii Organizing Committee
Program Chairs
Organizing Chair
Finance Chair
Publicity Chair
Registration Chair
Outcome Committee
Web Administrator
Reporting
Hospitality Chair
xiii
xiv Contents
Dr. Tarun K. Sharma has a Ph.D. in artificial intelligence as well as MCA and
MBA degrees and is currently associated with the Amity University Rajasthan
(AUR) in Jaipur. His research interests encompass swarm intelligence,
nature-inspired algorithms, and their applications in software engineering, inven-
tory systems, and image processing. He has published more than 60 research papers
in international journals and conferences. He has over 13 years of teaching expe-
rience and has also been involved in organizing international conferences. He is a
certified internal auditor and a member of the Machine Intelligence Research
(MIR) Labs, WA, USA and Soft Computing Research Society, India.
Dr. Sanyog Rawat is presently associated with the Department of Electronics and
Communication Engineering, SEEC, Manipal University Jaipur, Jaipur, India. He
holds a B.E. in Electronics and Communication, an M.Tech. in Microwave
Engineering and Ph.D. in Planar Antennas. Dr. Rawat has been involved in orga-
nizing various workshops on “LabVIEW” and antenna designs and simulations
using FEKO. He has taught various subjects, including electrical science, circuits
xxi
xxii About the Editors
1 Introduction
Subtask Subtask
Subtask Subtask
Application
program
Processor 3
Processor 2
Subtask Subtask Subtask Subtask
The task scheduling is represented using Directed Acyclic Graph (DAG), which is a
weighted graph defined as G1 = (V, E, Ce, Ev) where V is a collection of the n tasks,
and V= {T1, T2, T3, …, Tn}. E is a collection of edges, Ce is the communication time
between two dependent tasks Ti and Tj. That is., Ce(Ti, Tj). Ev is the execution time
of each task Ti denoted as Ev (Ti).
The DAG also consists of an entry and an exit tasks. The entry task Tentry is the
first task denoted as having no predecessor task. Similarly, an exit task Texit is the
final task of the DAG and have no any successor tasks.
The DAG model of an application program is in Fig. 2.
T2 T3
3 4
4 3
3
T5
2
T4
4 2 5
5
P2 P3
The section contains some existing scheduling attributes, which will be used in
proposed scheduling algorithm. It is necessary to discuss here for DAG scheduling.
These are Critical Path, T-level, Earliest Start Time, and Earliest Finished Time.
Critical Path (CP) [5, 7] is the longest path from an entry task (Tentry) to an exit
task (Texit). It includes execution time of the tasks and communication time between
the tasks. It is defined as follows:
CP ¼ max fLengthðPathÞg
path2G1
X X
LengthðPathÞ ¼ Ev ðTi Þ þ Ce eij
Ti 2V e2E
Another random document with
no related content on Scribd:
»Jane ei ole enää mikään lapsi; sitäpaitsi ei teillä ole
aavistustakaan, miten vähän arvoa liinalla on tämmöisessä
tapauksessa. Kas niin, nyt teidän täytyy laskea kuningatar liikkeelle.»
»Niin se on vaarallista…»
Seuraavana päivänä Hanna sai kirjeen. Hän arvasi heti, että se oli
Ballmannilta, ja aukaisi nopeasti kuoren. Paperi vapisi hänen
kädessään, kun hän luki:
Ewald Ballmann.»
»Nyt kai olen pakotettu antamaan itseni ilmi, täti?» sanoi Hanna
luettuaan kirjeen ystävälleen. »Minusta on vain hiukan harmillista
alentua mustatukkaisesta, 'sielukkaasta' Janesta vaaleakiharaiseksi,
kevytmieliseksi Hannaksi…»
»Niin, en koskaan olisi luullut elämän olevan niin ihanaa. Mutta nyt
minä menen ja jätän tohtorin teille.»
»Ah!»
»Mitä te sanoitte?»
»Sanoin 'ah'…»
»Ero?» toisti Ewald. »Voiko ajatella eroa, kun tuskin vielä lausutut
sanat 'minä rakastan sinua' ovat huulillani? Tai vihaatteko minua,
halveksitteko minua? Onko tieto rikollisesta vaitiolostani voinut
sammuttaa eilisen rakkaudenhehkun?»
Ewald hätkähti.
»Niin. Ja mikä vielä pahempi, minua ei ole hyljätty, vaan olen itse
hyljännyt. Siitä on noin kymmenen vuotta sitten kun viimeksi näin
mieheni…»
»Vai niin, oletko sinä täällä, Jane? Ah, hyvää huomenta, herra
Ballmann!»
»Jane, Jane… rakas lapsi! Minunkin täytyy kiittää sinua siitä ilosta,
minkä olet minulle suonut. Nouse ylös, rakkaani! Älä myöhästy
junasta. Kas, tässä on kirje, joka sinun tulee ottaa mukaasi. Lupaa
minulle, ettet avaa sitä, ennenkuin miehesi on jälleen puolisosi.
Lukekaa se yhdessä.»
»Minä tuntisin kai niin, jos asiat olisivat sillä tavoin kuin luulet.
Mutta sinä et voi tietää mikä minua huolestuttaa, ennenkuin olen
puhunut suuni puhtaaksi. Anna minun ensin kuitenkin tehdä sinulle
joitakuita kysymyksiä ja lupaa minulle, että vastaat niihin
totuudenmukaisesti.»
»Minä en ymmärrä…»
»Ja tuota voit uskoa, Jane?… Tänä hetkenä voit luulla sen olevan
mahdollista?»
*****
»Rakkaat lapseni!