SlideShare a Scribd company logo
!
#   $   %
'
( $ 
$  ( $     (
 )   '
*
!
!
!
!
!#$  
    
  
  

% 
 
  

 ! 
 
 
   
 
 
 '
(
)* !
   

 
    *)+,- !
. /

    0
  (
. 1,)2 % 
 
  

 ! 
 
 
   
 
 

'
(
1,)2
To My Family  All Readers
CONTENTS
Chapter 1: Introduction
1.1 Introduction.........................................................................................................2
1.2 Background For this Book...................................................................................3
1.3 Motivation............................................................................................................4
1.4 Contribution Of this Book ...................................................................................5
1.5 Outline of the Book..............................................................................................6
Chapter2: Fault Tolerance Token Based Atomic Broadcast
2.1 Synchronous System And Asynchronous System ............................................8
2.2 Fault tolerance .................................................................................................9
2.2.1 Failure Models in Distributed Systems.................................................11
2.2.1.1 Fault States........................................................................................12
2.2.2 Agreement in faulty distributed systems..............................................13
2.2.2.1 Two Army Problem ..........................................................................13
2.2.2.2 Byzantine Generals Problem............................................................14
2.3 mutual exclusion algorithms............................................................................15
2.3.1 System Model ......................................................................................18
2.3.2 Requirements of Mutual Exclusion Algorithms ………………... 19
2.3.3 Performance Metrics............................................................................20
2.3.4 Algorithm.............................................................................................22
Chapter 3 :Token Based Mutex
3.1 Token Based Algorithms ................................................................................25
3.1.1 Basic Idea.............................................................................................26
3.1.2 Failure Detector ...................................................................................26
3.2 atomic broadcast algorithm.............................................................................27
3.3 Token Based Atomic Broadcast Algorithm....................................................28
3.4 Responsive Property (RP)...............................................................................29
Chapter 4 Proposed Scheme
4.1 Proposed Model .................................................................................................31
4.1.1. Goal.........................................................................................................31
4.1.2 Terminologies ................................................................................. 31
4.1.3 Proposed Algorithm.................................…………… …………. 32
4.1.4 Implementation Details .......................................................................33
4.2 Simulation result and analysis .........................................................................33
Chapter 5 conclusion and future work...............................................................................40
References
1 | P a g e
Chapter1
Introduction
2 | P a g e
1.1 Introduction
The requirement for highly reliable and available services has been continuously
increasing in many domains for the last decade. Several approaches for designing fault tolerant
services exist. The focus of this chapter is on software replication. Replication allows a number
of replicas to crash with-out affecting the availability of the service .Systems involving multiple
processes are often most easily programmed using critical regions. When a process has to read
or update certain shared data structures, it first enters a critical region to achieve mutual
exclusion and ensure that no other process will use the shared data structures at the same time.
Mutual exclusion (often abbreviated as mutex) algorithms are used in concurrent
programming to avoid the simultaneous use of a common resource, such as a global variable,
by pieces of computer code called critical sections. A critical section is a piece of code in which
a process or thread accesses a common resource. The critical section by itself is not a
mechanism or algorithm for mutual exclusion. A program, process, or thread can have the
critical section in it without any mechanism or algorithm which implements mutual exclusion.
ATOMIC BROADCAST/ TOTAL ORDER BROADCAST ensures that messages broadcast
by different processes are delivered to all destination processes in the same order in which they
are initiated. Atomic Broadcast enables ORDERING MECHANISM and TOLERATE
FAILURE. In asynchronous system with crash failures two most widely used mechanisms to
tolerate failure in Atomic Broadcast algorithm are 1) Unreliable Failure Detector 2) Group
Membership Function.
An Unreliable Failure Detector does not provide consistent information about the failure
status of processes. A Group membership service provides consistent membership information
to all the members of a group. For example tell a process P that R has crashed, and to process
Q that R is alive, at the same time. The overhead of a wrong failure suspicion is high when
using a group membership. With group membership service, a wrong suspicion can lead to two
costly membership operations: 1) removal of a process followed by 2) The addition of another
process.
With a failure detector, neither the removal nor the addition of process is needed. Atomic
broadcast algorithms based on a failure detector can be used to implement the group
membership service.
3 | P a g e
1.2 BACKGROUND FOR THIS BOOK
Atomic broadcast (or total order broadcast) is an important abstraction in fault tolerant
distributed computing. Atomic broadcast ensures that messages broadcast by different
processes are delivered by all destination processes in the same order [1]. Fault tolerant
distributed systems are designed to provide reliable and continuous service despite the failure
of some of their components. A basic building block of such systems is the failure detectors
[3]. Atomic broadcast protocols based on tokens need group membership or an equivalent
mechanism. The problem of unavoidable concurrency is greatly reduced byrelying on group
communication primitives that provide higher guarantees thanstandard point-to-point
communication [4].The behavior of faulty com-ponents is important when solving problems in
a distributed system [5]. In Chang and Maxemchuk’s Reliable Broadcast Protocol [10], and its
newer variant [11], an ad-hoc reformation mechanism is called whenever a host fails. A failure
detector provides some information on which processes have crashed. This information
typically given in the form of a list of suspects is not always up to date or correct. A failure
detector may take a long time to start suspecting a process that has crashed and it may
erroneously suspect a process that has not crashed[3]. Group membership is used explicitly in
other atomic broadcast protocols such as Totem [12], the Reliable Multicast Protocol by
Whetten et al. [13] ( [10]), and in [14]. These atomic broadcast protocols also have different
approaches with respect to message broadcasting and delivery. In [10], [13], the moving
sequencer approach is used: any process can broadcast a message at any time. The token holder
then orders the messages that have been broadcast. Other protocols, such as Totem [12] or On-
Demand [14] on the other hand use the privilege based approach, enabling only the token-
holder to broadcast (andsimultaneously order) messages. In [1] only one process is allowed to
broadcast its token at a time to all other processes, maintaining total order broadcast. In these
algorithms, the token is effectively broadcast to all processes, although the token ownership is
passed along the processes on the ring. According to [20] the token is a message, which
contains an FCFS queue, namely token queue, in order to store all pending requests. The token
stores the number of the last completed session in tokensession . Both approaches can be used
in the algorithm presented in this paper. Finally, the different token based atomic broadcast
protocols deliver messages in different ways. In [14], the token
4 | P a g e
holder issues an “update dissemination message” which effectively contains messages and their
global order. A host can deliver a message as soon as it knows that previously ordered messages
havebeen delivered. “Agreed delivery” in the Totem protocol (which corresponds to
adelivering the protocol presented in this paper) is also done in a similar way. On the other
hand, in the Chang-Maxemchuk atomic broadcast protocol [10], a message is only delivered
oncef+ 1sites have received the message. Finally, the Train protocol presented in [15]
transports the ordered messages in a token that is passed among all processes (and is in this
respect related to the token based protocols presented in this paper). Larreaet al. [16] also
consider a logical ring of processes, with a different goal however. They use a ring for an
efficient implementation of the failure detectors 3W, 3Sand 3Pin a partially synchronous
system.Finally, the IEEE 802.4 Standard [2] defines a token-based access control protocol on
top of a bus topology network, essentially implementing total order at the MAC layer.
1.3 MOTIVATION:
Within only a couple of generations, the so called digital revolution has taken the world by
storm: to-day, almost all human beings interact, directly or indirectly, at some point in their
life, with a computer system. As the use of computer systems has increased dramatically over
the past decades, the needs and expectations associated with these systems have also increased.
In the case of critical systems, dependability has always been a major concern, as the price of
a system failure is high, in terms of human lives or economical loss. However, even in the case
of non-critical systems, one of the crucial properties is availability and accuracy.
High availability is achieved in two ways:
(1) By increasing the time a system is up (by avoiding that the system ever goes down) or
(2) By reducing the recovery time in case it is down.
The second approach is difficult or even impossible to apply to critical systems where the
slightest interruption of service is unacceptable.
In the first approach, several system designs are possible. The first design choice is to avoid
system failures (fault avoidance), while the second one is to tolerate and hide failures within
the system (fault tolerance).
5 | P a g e
The second design is however appealing, as it can be implemented by replication: instead of
having a single machine (a replica) providing a service, the system is composed of several
replicas running the service. Thus, if one of the replicas fails, the service is still provided by
the remaining replicas.
1.4. CONTRIBUTION OF THIS BOOK
This book is a contribution to the ongoing research on the different fault tolerant mutual
exclusion algorithms. The research done so far is done on the system level, where a number of
systems are interconnected to a grid network. The existing system needs a number of computers
and a huge backbone of network connection to establish the experimental setup. And the
experimental set up may suffer from any king of unwanted failures that may be the failure of
node or the communication network in either of the case we have to focus more on the
communication network then on the node failure.
Here in this paper we focus on the process level failure in the system, which is a
prototype of the real life communication system. In this paper I am using the existing feature
of the multi-core processor to simulate the behavior of the grid computing environment by
considering a small processor group.
This paper an extension and modification of the Richard Ekwall [1] atomic broadcast
algorithm, which was based on the unreliable failure detector .Here the focus is on the atomic
broadcast of the process which will be using the unreliable failure detector and also satisfying
the responsive property (RP). The quality of service [3] is also maintained in the course of
failure detection process.
The failure is considered to be of crash [4] type. We are preparing a fault tolerant system
which will definitely respond within a specified time limit, otherwise the checking for the
failure or fault in the distributed system will be stopped and the process that does not reacted
or obtained the resource will be declared as faulty and further that process will be removed
from the Quorum. In this paper the main focus is on the tolerance level of the fault as well as
on the atomic broadcast of the token which must be responded by other processes in a specified
time interval.
6 | P a g e
1.5 Outline of the BOOK
The outline of this book is as follows:
Chapter 2 introduces the types of system and a brief idea about the meaning of fault in the
distributed system and a brief idea on the mutual exclusion algorithm
Chapter 3 discusses the literature review. We present an overview of the existing works: The
atomic broadcast algorithms, The token based Mutex.
Chapter 4 discusses the Responsive property and the use of responsive property in the fault
tolerant system discusses proposed scheme. We present ourapproach of fault tolerant
mechanism which is based on the token based approach as well as satisfying the responsive
property. It also includes some simple simulation to justify the work done.
Chapter 5 finally concludes this work and presents some open problems.
$  
   
    
   
$
$ 
 
  
   !
 $   
 $ 
 
  $  

$ 
 
 
  
          
   $ 
$ 
   
!  
! $  
   
$ 
   $  
   
 
  
  
  


     
   
    
 ! 
  
 
  !   !   
     
 
 ! 
 $      
  !    
 
  
   !
     
 !      
# 

$  $  $       ! !
 
  
!$  
  $  
  !$   
 

$   
 
  
    ! 
 
 ! 

      $    !  
$  
! ! 
$  
 
 
  

 
 
     

    
   
   
   
  !  
 
 
 #    ! 
      
 $  
$  $   

 
  
! $  
 

   

  
    

      #
  


$  
 
   !
!   
$ ! 
  !$   
 
   !

 
    

$ 
 
    $ 
 
$  !

 
 
 
 
!  
 !   
 
    $
  
 
    $ 
 #$   
  

 $  
 
  
$
!
!  
      
!     
   
  !
      
     
  !   
! 
  
       
         
     
         
   !
! 
!
%        !  
   
 
    %      
 
           

 
   !     %  !

  %     !     !  %  


 )   %  $ %   !   !  %    # 
  %  %  #
!                  % 
 # !   ! 

 
 )   !   !     !  %   ! 
%       !    ! %   !    
%    !    ! !   %
)   %          
%  !      %      !  
  %  !  #      $   %!%
  #  !     %   % !  
   
  %%     *  % !
!  !         !     
* !       ! 
%      #
%    %    !     !
  %      !      !  #     
       ! %          
 %   !     '%  %   #   
!  !   #  !  %   !     ! 
  %  #  !     ! % 
!  
%  !   !   
!    !% !   
  %     %
+!  *,*!+,!+ ' -$, ,'$* *)-!*
' +!$ ('!, ' !$-*
-$, !+'$,!' ,' ,  !$! '%(',
-$, ',!%, ,' (*., (*'(,!' ' ,  !$-*
.!$!$!,1 ' *.*+!' %'+
-$, '$* )-!*%,+ +-$$1 ,  +1+,% !+ ', *)-!* ,' +,!+1 , '*!!$
+(!!,!' ,*  -$, '-*+ -, !+, '%($1 /!, +'% -$, ,'$* ('$!1 -$,
,'$*(*'(*,!+ * *$$1 $++!! '*! ,'/ , *  '/ , 1 *+(, , 
+,1  $!.++ (*,+ ' ,  '*!!$ +(!!,!'  !+ $++!!,!' 1!$+ , * %!
,1(+ ' ,'$* +#! ,'$*$/1+ *+(,+ ', +,1  $!.++  '
%+#! ,'$* '/.* , +,1 (*'(*,1 %! ,  ,%('**!$1 .!'$, -, !+
-*, ,'  .,-$$1 *+,'* / !$ ,  $!.++ (*, !+ ! $/1+ *+(,

More Related Content

Similar to Fault Tolerance token Based Algorithm

Data replication (software)
Data replication (software) Data replication (software)
Data replication (software)
Masoud Gholami
 
D4.3. Content and Concept Filter V1
D4.3. Content and Concept Filter V1D4.3. Content and Concept Filter V1
D4.3. Content and Concept Filter V1
LinkedTV
 
Getting started erlang
Getting started erlangGetting started erlang
Getting started erlang
Kwanzoo Dev
 
Knapp_Masterarbeit
Knapp_MasterarbeitKnapp_Masterarbeit
Knapp_Masterarbeit
Nathaniel Knapp
 
Resource scheduling algorithm
Resource scheduling algorithmResource scheduling algorithm
Resource scheduling algorithm
Shilpa Damor
 
dmo-phd-thesis
dmo-phd-thesisdmo-phd-thesis
dmo-phd-thesis
David Overton
 
978-3-659-82929-1
978-3-659-82929-1978-3-659-82929-1
978-3-659-82929-1
Sudheer Singampalli
 
zookeeperProgrammers
zookeeperProgrammerszookeeperProgrammers
zookeeperProgrammers
Hiroshi Ono
 
IGCSE & O Level Computer Workbook for P2 by Inqilab Patel
IGCSE & O Level Computer Workbook for P2 by Inqilab PatelIGCSE & O Level Computer Workbook for P2 by Inqilab Patel
IGCSE & O Level Computer Workbook for P2 by Inqilab Patel
Inqilab Patel
 
Arduino bộ vi điều khiển cho tất cả chúng ta part 1
Arduino bộ vi điều khiển cho tất cả chúng ta part 1Arduino bộ vi điều khiển cho tất cả chúng ta part 1
Arduino bộ vi điều khiển cho tất cả chúng ta part 1
tungdientu
 
Rfb
RfbRfb
Documentation - Element and ElementVector
Documentation - Element and ElementVectorDocumentation - Element and ElementVector
Documentation - Element and ElementVector
Michel Alves
 
Guide to MemoQ
Guide to MemoQGuide to MemoQ
Guide to MemoQ
MichelaMuratori1
 
Maharastra EXTC NetSim Experiment Manual
Maharastra EXTC  NetSim Experiment  ManualMaharastra EXTC  NetSim Experiment  Manual
Maharastra EXTC NetSim Experiment Manual
Dr Praveen Jain
 
Time Series Anomaly Detection with .net and Azure
Time Series Anomaly Detection with .net and AzureTime Series Anomaly Detection with .net and Azure
Time Series Anomaly Detection with .net and Azure
Marco Parenzan
 
ImplementationOFDMFPGA
ImplementationOFDMFPGAImplementationOFDMFPGA
ImplementationOFDMFPGA
Nikita Pinto
 
Developing a Reverberation Plugin with the aim of a Genetic Algorithm
Developing a Reverberation Plugin with the aim of a Genetic AlgorithmDeveloping a Reverberation Plugin with the aim of a Genetic Algorithm
Developing a Reverberation Plugin with the aim of a Genetic Algorithm
Lorenzo Monni
 
Composition of Semantic Geo Services
Composition of Semantic Geo ServicesComposition of Semantic Geo Services
Composition of Semantic Geo Services
Felipe Diniz
 
rails_tutorial
rails_tutorialrails_tutorial
rails_tutorial
tutorialsruby
 
rails_tutorial
rails_tutorialrails_tutorial
rails_tutorial
tutorialsruby
 

Similar to Fault Tolerance token Based Algorithm (20)

Data replication (software)
Data replication (software) Data replication (software)
Data replication (software)
 
D4.3. Content and Concept Filter V1
D4.3. Content and Concept Filter V1D4.3. Content and Concept Filter V1
D4.3. Content and Concept Filter V1
 
Getting started erlang
Getting started erlangGetting started erlang
Getting started erlang
 
Knapp_Masterarbeit
Knapp_MasterarbeitKnapp_Masterarbeit
Knapp_Masterarbeit
 
Resource scheduling algorithm
Resource scheduling algorithmResource scheduling algorithm
Resource scheduling algorithm
 
dmo-phd-thesis
dmo-phd-thesisdmo-phd-thesis
dmo-phd-thesis
 
978-3-659-82929-1
978-3-659-82929-1978-3-659-82929-1
978-3-659-82929-1
 
zookeeperProgrammers
zookeeperProgrammerszookeeperProgrammers
zookeeperProgrammers
 
IGCSE & O Level Computer Workbook for P2 by Inqilab Patel
IGCSE & O Level Computer Workbook for P2 by Inqilab PatelIGCSE & O Level Computer Workbook for P2 by Inqilab Patel
IGCSE & O Level Computer Workbook for P2 by Inqilab Patel
 
Arduino bộ vi điều khiển cho tất cả chúng ta part 1
Arduino bộ vi điều khiển cho tất cả chúng ta part 1Arduino bộ vi điều khiển cho tất cả chúng ta part 1
Arduino bộ vi điều khiển cho tất cả chúng ta part 1
 
Rfb
RfbRfb
Rfb
 
Documentation - Element and ElementVector
Documentation - Element and ElementVectorDocumentation - Element and ElementVector
Documentation - Element and ElementVector
 
Guide to MemoQ
Guide to MemoQGuide to MemoQ
Guide to MemoQ
 
Maharastra EXTC NetSim Experiment Manual
Maharastra EXTC  NetSim Experiment  ManualMaharastra EXTC  NetSim Experiment  Manual
Maharastra EXTC NetSim Experiment Manual
 
Time Series Anomaly Detection with .net and Azure
Time Series Anomaly Detection with .net and AzureTime Series Anomaly Detection with .net and Azure
Time Series Anomaly Detection with .net and Azure
 
ImplementationOFDMFPGA
ImplementationOFDMFPGAImplementationOFDMFPGA
ImplementationOFDMFPGA
 
Developing a Reverberation Plugin with the aim of a Genetic Algorithm
Developing a Reverberation Plugin with the aim of a Genetic AlgorithmDeveloping a Reverberation Plugin with the aim of a Genetic Algorithm
Developing a Reverberation Plugin with the aim of a Genetic Algorithm
 
Composition of Semantic Geo Services
Composition of Semantic Geo ServicesComposition of Semantic Geo Services
Composition of Semantic Geo Services
 
rails_tutorial
rails_tutorialrails_tutorial
rails_tutorial
 
rails_tutorial
rails_tutorialrails_tutorial
rails_tutorial
 

More from Neelamani Samal

Os scheduling Algorithms
Os scheduling AlgorithmsOs scheduling Algorithms
Os scheduling Algorithms
Neelamani Samal
 
RTS Question Paper 2012
RTS Question Paper 2012RTS Question Paper 2012
RTS Question Paper 2012
Neelamani Samal
 
A fault tolerant tokenbased atomic broadcast algorithm relying on responsive ...
A fault tolerant tokenbased atomic broadcast algorithm relying on responsive ...A fault tolerant tokenbased atomic broadcast algorithm relying on responsive ...
A fault tolerant tokenbased atomic broadcast algorithm relying on responsive ...
Neelamani Samal
 
Os lab manual
Os lab manualOs lab manual
Os lab manual
Neelamani Samal
 
computer architecture lab manual
computer architecture lab manualcomputer architecture lab manual
computer architecture lab manual
Neelamani Samal
 
Software Engineering Sample Question paper for 2012
Software Engineering Sample Question paper for 2012Software Engineering Sample Question paper for 2012
Software Engineering Sample Question paper for 2012
Neelamani Samal
 
Software Engineering Lab Manual
Software Engineering Lab ManualSoftware Engineering Lab Manual
Software Engineering Lab Manual
Neelamani Samal
 
Software engineering note
Software engineering noteSoftware engineering note
Software engineering note
Neelamani Samal
 
Values oflife
Values oflifeValues oflife
Values oflife
Neelamani Samal
 
Attitute
AttituteAttitute
Attitute
Neelamani Samal
 
Cd writning technology
Cd writning technologyCd writning technology
Cd writning technology
Neelamani Samal
 
Turing machine
Turing machineTuring machine
Turing machine
Neelamani Samal
 
Lamport’s algorithm for mutual exclusion
Lamport’s algorithm for mutual exclusionLamport’s algorithm for mutual exclusion
Lamport’s algorithm for mutual exclusion
Neelamani Samal
 
How to install windows Xp sp2
How to install windows Xp sp2How to install windows Xp sp2
How to install windows Xp sp2
Neelamani Samal
 
Game Playing In A I Final
Game  Playing In  A I  FinalGame  Playing In  A I  Final
Game Playing In A I Final
Neelamani Samal
 
Computer Brain Power
Computer Brain PowerComputer Brain Power
Computer Brain Power
Neelamani Samal
 

More from Neelamani Samal (16)

Os scheduling Algorithms
Os scheduling AlgorithmsOs scheduling Algorithms
Os scheduling Algorithms
 
RTS Question Paper 2012
RTS Question Paper 2012RTS Question Paper 2012
RTS Question Paper 2012
 
A fault tolerant tokenbased atomic broadcast algorithm relying on responsive ...
A fault tolerant tokenbased atomic broadcast algorithm relying on responsive ...A fault tolerant tokenbased atomic broadcast algorithm relying on responsive ...
A fault tolerant tokenbased atomic broadcast algorithm relying on responsive ...
 
Os lab manual
Os lab manualOs lab manual
Os lab manual
 
computer architecture lab manual
computer architecture lab manualcomputer architecture lab manual
computer architecture lab manual
 
Software Engineering Sample Question paper for 2012
Software Engineering Sample Question paper for 2012Software Engineering Sample Question paper for 2012
Software Engineering Sample Question paper for 2012
 
Software Engineering Lab Manual
Software Engineering Lab ManualSoftware Engineering Lab Manual
Software Engineering Lab Manual
 
Software engineering note
Software engineering noteSoftware engineering note
Software engineering note
 
Values oflife
Values oflifeValues oflife
Values oflife
 
Attitute
AttituteAttitute
Attitute
 
Cd writning technology
Cd writning technologyCd writning technology
Cd writning technology
 
Turing machine
Turing machineTuring machine
Turing machine
 
Lamport’s algorithm for mutual exclusion
Lamport’s algorithm for mutual exclusionLamport’s algorithm for mutual exclusion
Lamport’s algorithm for mutual exclusion
 
How to install windows Xp sp2
How to install windows Xp sp2How to install windows Xp sp2
How to install windows Xp sp2
 
Game Playing In A I Final
Game  Playing In  A I  FinalGame  Playing In  A I  Final
Game Playing In A I Final
 
Computer Brain Power
Computer Brain PowerComputer Brain Power
Computer Brain Power
 

Recently uploaded

Pengantar Penggunaan Flutter - Dart programming language1.pptx
Pengantar Penggunaan Flutter - Dart programming language1.pptxPengantar Penggunaan Flutter - Dart programming language1.pptx
Pengantar Penggunaan Flutter - Dart programming language1.pptx
Fajar Baskoro
 
How to Build a Module in Odoo 17 Using the Scaffold Method
How to Build a Module in Odoo 17 Using the Scaffold MethodHow to Build a Module in Odoo 17 Using the Scaffold Method
How to Build a Module in Odoo 17 Using the Scaffold Method
Celine George
 
ANATOMY AND BIOMECHANICS OF HIP JOINT.pdf
ANATOMY AND BIOMECHANICS OF HIP JOINT.pdfANATOMY AND BIOMECHANICS OF HIP JOINT.pdf
ANATOMY AND BIOMECHANICS OF HIP JOINT.pdf
Priyankaranawat4
 
Liberal Approach to the Study of Indian Politics.pdf
Liberal Approach to the Study of Indian Politics.pdfLiberal Approach to the Study of Indian Politics.pdf
Liberal Approach to the Study of Indian Politics.pdf
WaniBasim
 
Advanced Java[Extra Concepts, Not Difficult].docx
Advanced Java[Extra Concepts, Not Difficult].docxAdvanced Java[Extra Concepts, Not Difficult].docx
Advanced Java[Extra Concepts, Not Difficult].docx
adhitya5119
 
clinical examination of hip joint (1).pdf
clinical examination of hip joint (1).pdfclinical examination of hip joint (1).pdf
clinical examination of hip joint (1).pdf
Priyankaranawat4
 
How to Add Chatter in the odoo 17 ERP Module
How to Add Chatter in the odoo 17 ERP ModuleHow to Add Chatter in the odoo 17 ERP Module
How to Add Chatter in the odoo 17 ERP Module
Celine George
 
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Your Skill Boost Masterclass: Strategies for Effective UpskillingYour Skill Boost Masterclass: Strategies for Effective Upskilling
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Excellence Foundation for South Sudan
 
BBR 2024 Summer Sessions Interview Training
BBR  2024 Summer Sessions Interview TrainingBBR  2024 Summer Sessions Interview Training
BBR 2024 Summer Sessions Interview Training
Katrina Pritchard
 
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
GeorgeMilliken2
 
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
Natural birth techniques - Mrs.Akanksha Trivedi Rama UniversityNatural birth techniques - Mrs.Akanksha Trivedi Rama University
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
Akanksha trivedi rama nursing college kanpur.
 
The History of Stoke Newington Street Names
The History of Stoke Newington Street NamesThe History of Stoke Newington Street Names
The History of Stoke Newington Street Names
History of Stoke Newington
 
Executive Directors Chat Leveraging AI for Diversity, Equity, and Inclusion
Executive Directors Chat  Leveraging AI for Diversity, Equity, and InclusionExecutive Directors Chat  Leveraging AI for Diversity, Equity, and Inclusion
Executive Directors Chat Leveraging AI for Diversity, Equity, and Inclusion
TechSoup
 
Walmart Business+ and Spark Good for Nonprofits.pdf
Walmart Business+ and Spark Good for Nonprofits.pdfWalmart Business+ and Spark Good for Nonprofits.pdf
Walmart Business+ and Spark Good for Nonprofits.pdf
TechSoup
 
S1-Introduction-Biopesticides in ICM.pptx
S1-Introduction-Biopesticides in ICM.pptxS1-Introduction-Biopesticides in ICM.pptx
S1-Introduction-Biopesticides in ICM.pptx
tarandeep35
 
Pride Month Slides 2024 David Douglas School District
Pride Month Slides 2024 David Douglas School DistrictPride Month Slides 2024 David Douglas School District
Pride Month Slides 2024 David Douglas School District
David Douglas School District
 
Community pharmacy- Social and preventive pharmacy UNIT 5
Community pharmacy- Social and preventive pharmacy UNIT 5Community pharmacy- Social and preventive pharmacy UNIT 5
Community pharmacy- Social and preventive pharmacy UNIT 5
sayalidalavi006
 
DRUGS AND ITS classification slide share
DRUGS AND ITS classification slide shareDRUGS AND ITS classification slide share
DRUGS AND ITS classification slide share
taiba qazi
 
A Independência da América Espanhola LAPBOOK.pdf
A Independência da América Espanhola LAPBOOK.pdfA Independência da América Espanhola LAPBOOK.pdf
A Independência da América Espanhola LAPBOOK.pdf
Jean Carlos Nunes Paixão
 
Cognitive Development Adolescence Psychology
Cognitive Development Adolescence PsychologyCognitive Development Adolescence Psychology
Cognitive Development Adolescence Psychology
paigestewart1632
 

Recently uploaded (20)

Pengantar Penggunaan Flutter - Dart programming language1.pptx
Pengantar Penggunaan Flutter - Dart programming language1.pptxPengantar Penggunaan Flutter - Dart programming language1.pptx
Pengantar Penggunaan Flutter - Dart programming language1.pptx
 
How to Build a Module in Odoo 17 Using the Scaffold Method
How to Build a Module in Odoo 17 Using the Scaffold MethodHow to Build a Module in Odoo 17 Using the Scaffold Method
How to Build a Module in Odoo 17 Using the Scaffold Method
 
ANATOMY AND BIOMECHANICS OF HIP JOINT.pdf
ANATOMY AND BIOMECHANICS OF HIP JOINT.pdfANATOMY AND BIOMECHANICS OF HIP JOINT.pdf
ANATOMY AND BIOMECHANICS OF HIP JOINT.pdf
 
Liberal Approach to the Study of Indian Politics.pdf
Liberal Approach to the Study of Indian Politics.pdfLiberal Approach to the Study of Indian Politics.pdf
Liberal Approach to the Study of Indian Politics.pdf
 
Advanced Java[Extra Concepts, Not Difficult].docx
Advanced Java[Extra Concepts, Not Difficult].docxAdvanced Java[Extra Concepts, Not Difficult].docx
Advanced Java[Extra Concepts, Not Difficult].docx
 
clinical examination of hip joint (1).pdf
clinical examination of hip joint (1).pdfclinical examination of hip joint (1).pdf
clinical examination of hip joint (1).pdf
 
How to Add Chatter in the odoo 17 ERP Module
How to Add Chatter in the odoo 17 ERP ModuleHow to Add Chatter in the odoo 17 ERP Module
How to Add Chatter in the odoo 17 ERP Module
 
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Your Skill Boost Masterclass: Strategies for Effective UpskillingYour Skill Boost Masterclass: Strategies for Effective Upskilling
Your Skill Boost Masterclass: Strategies for Effective Upskilling
 
BBR 2024 Summer Sessions Interview Training
BBR  2024 Summer Sessions Interview TrainingBBR  2024 Summer Sessions Interview Training
BBR 2024 Summer Sessions Interview Training
 
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
 
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
Natural birth techniques - Mrs.Akanksha Trivedi Rama UniversityNatural birth techniques - Mrs.Akanksha Trivedi Rama University
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
 
The History of Stoke Newington Street Names
The History of Stoke Newington Street NamesThe History of Stoke Newington Street Names
The History of Stoke Newington Street Names
 
Executive Directors Chat Leveraging AI for Diversity, Equity, and Inclusion
Executive Directors Chat  Leveraging AI for Diversity, Equity, and InclusionExecutive Directors Chat  Leveraging AI for Diversity, Equity, and Inclusion
Executive Directors Chat Leveraging AI for Diversity, Equity, and Inclusion
 
Walmart Business+ and Spark Good for Nonprofits.pdf
Walmart Business+ and Spark Good for Nonprofits.pdfWalmart Business+ and Spark Good for Nonprofits.pdf
Walmart Business+ and Spark Good for Nonprofits.pdf
 
S1-Introduction-Biopesticides in ICM.pptx
S1-Introduction-Biopesticides in ICM.pptxS1-Introduction-Biopesticides in ICM.pptx
S1-Introduction-Biopesticides in ICM.pptx
 
Pride Month Slides 2024 David Douglas School District
Pride Month Slides 2024 David Douglas School DistrictPride Month Slides 2024 David Douglas School District
Pride Month Slides 2024 David Douglas School District
 
Community pharmacy- Social and preventive pharmacy UNIT 5
Community pharmacy- Social and preventive pharmacy UNIT 5Community pharmacy- Social and preventive pharmacy UNIT 5
Community pharmacy- Social and preventive pharmacy UNIT 5
 
DRUGS AND ITS classification slide share
DRUGS AND ITS classification slide shareDRUGS AND ITS classification slide share
DRUGS AND ITS classification slide share
 
A Independência da América Espanhola LAPBOOK.pdf
A Independência da América Espanhola LAPBOOK.pdfA Independência da América Espanhola LAPBOOK.pdf
A Independência da América Espanhola LAPBOOK.pdf
 
Cognitive Development Adolescence Psychology
Cognitive Development Adolescence PsychologyCognitive Development Adolescence Psychology
Cognitive Development Adolescence Psychology
 

Fault Tolerance token Based Algorithm

  • 1.
  • 2.
  • 3.
  • 4.
  • 5.
  • 6.
  • 7.
  • 8.
  • 9.
  • 10. !
  • 11. # $ %
  • 12.
  • 13. '
  • 14. ( $ $ ( $ ( ) '
  • 15. *
  • 16. !
  • 17.
  • 18.
  • 19. !
  • 20.
  • 21.
  • 22. !
  • 23. !
  • 24.
  • 25. !#$ % ! '
  • 26. (
  • 27. )* ! *)+,- !
  • 28. . / 0 (
  • 29. . 1,)2 % ! '
  • 30. (
  • 31. 1,)2
  • 32. To My Family All Readers
  • 33. CONTENTS Chapter 1: Introduction 1.1 Introduction.........................................................................................................2 1.2 Background For this Book...................................................................................3 1.3 Motivation............................................................................................................4 1.4 Contribution Of this Book ...................................................................................5 1.5 Outline of the Book..............................................................................................6 Chapter2: Fault Tolerance Token Based Atomic Broadcast 2.1 Synchronous System And Asynchronous System ............................................8 2.2 Fault tolerance .................................................................................................9 2.2.1 Failure Models in Distributed Systems.................................................11 2.2.1.1 Fault States........................................................................................12 2.2.2 Agreement in faulty distributed systems..............................................13 2.2.2.1 Two Army Problem ..........................................................................13 2.2.2.2 Byzantine Generals Problem............................................................14 2.3 mutual exclusion algorithms............................................................................15 2.3.1 System Model ......................................................................................18 2.3.2 Requirements of Mutual Exclusion Algorithms ………………... 19 2.3.3 Performance Metrics............................................................................20 2.3.4 Algorithm.............................................................................................22 Chapter 3 :Token Based Mutex 3.1 Token Based Algorithms ................................................................................25 3.1.1 Basic Idea.............................................................................................26 3.1.2 Failure Detector ...................................................................................26 3.2 atomic broadcast algorithm.............................................................................27 3.3 Token Based Atomic Broadcast Algorithm....................................................28 3.4 Responsive Property (RP)...............................................................................29 Chapter 4 Proposed Scheme 4.1 Proposed Model .................................................................................................31 4.1.1. Goal.........................................................................................................31 4.1.2 Terminologies ................................................................................. 31 4.1.3 Proposed Algorithm.................................…………… …………. 32 4.1.4 Implementation Details .......................................................................33 4.2 Simulation result and analysis .........................................................................33 Chapter 5 conclusion and future work...............................................................................40 References
  • 34. 1 | P a g e Chapter1 Introduction
  • 35. 2 | P a g e 1.1 Introduction The requirement for highly reliable and available services has been continuously increasing in many domains for the last decade. Several approaches for designing fault tolerant services exist. The focus of this chapter is on software replication. Replication allows a number of replicas to crash with-out affecting the availability of the service .Systems involving multiple processes are often most easily programmed using critical regions. When a process has to read or update certain shared data structures, it first enters a critical region to achieve mutual exclusion and ensure that no other process will use the shared data structures at the same time. Mutual exclusion (often abbreviated as mutex) algorithms are used in concurrent programming to avoid the simultaneous use of a common resource, such as a global variable, by pieces of computer code called critical sections. A critical section is a piece of code in which a process or thread accesses a common resource. The critical section by itself is not a mechanism or algorithm for mutual exclusion. A program, process, or thread can have the critical section in it without any mechanism or algorithm which implements mutual exclusion. ATOMIC BROADCAST/ TOTAL ORDER BROADCAST ensures that messages broadcast by different processes are delivered to all destination processes in the same order in which they are initiated. Atomic Broadcast enables ORDERING MECHANISM and TOLERATE FAILURE. In asynchronous system with crash failures two most widely used mechanisms to tolerate failure in Atomic Broadcast algorithm are 1) Unreliable Failure Detector 2) Group Membership Function. An Unreliable Failure Detector does not provide consistent information about the failure status of processes. A Group membership service provides consistent membership information to all the members of a group. For example tell a process P that R has crashed, and to process Q that R is alive, at the same time. The overhead of a wrong failure suspicion is high when using a group membership. With group membership service, a wrong suspicion can lead to two costly membership operations: 1) removal of a process followed by 2) The addition of another process. With a failure detector, neither the removal nor the addition of process is needed. Atomic broadcast algorithms based on a failure detector can be used to implement the group membership service.
  • 36. 3 | P a g e 1.2 BACKGROUND FOR THIS BOOK Atomic broadcast (or total order broadcast) is an important abstraction in fault tolerant distributed computing. Atomic broadcast ensures that messages broadcast by different processes are delivered by all destination processes in the same order [1]. Fault tolerant distributed systems are designed to provide reliable and continuous service despite the failure of some of their components. A basic building block of such systems is the failure detectors [3]. Atomic broadcast protocols based on tokens need group membership or an equivalent mechanism. The problem of unavoidable concurrency is greatly reduced byrelying on group communication primitives that provide higher guarantees thanstandard point-to-point communication [4].The behavior of faulty com-ponents is important when solving problems in a distributed system [5]. In Chang and Maxemchuk’s Reliable Broadcast Protocol [10], and its newer variant [11], an ad-hoc reformation mechanism is called whenever a host fails. A failure detector provides some information on which processes have crashed. This information typically given in the form of a list of suspects is not always up to date or correct. A failure detector may take a long time to start suspecting a process that has crashed and it may erroneously suspect a process that has not crashed[3]. Group membership is used explicitly in other atomic broadcast protocols such as Totem [12], the Reliable Multicast Protocol by Whetten et al. [13] ( [10]), and in [14]. These atomic broadcast protocols also have different approaches with respect to message broadcasting and delivery. In [10], [13], the moving sequencer approach is used: any process can broadcast a message at any time. The token holder then orders the messages that have been broadcast. Other protocols, such as Totem [12] or On- Demand [14] on the other hand use the privilege based approach, enabling only the token- holder to broadcast (andsimultaneously order) messages. In [1] only one process is allowed to broadcast its token at a time to all other processes, maintaining total order broadcast. In these algorithms, the token is effectively broadcast to all processes, although the token ownership is passed along the processes on the ring. According to [20] the token is a message, which contains an FCFS queue, namely token queue, in order to store all pending requests. The token stores the number of the last completed session in tokensession . Both approaches can be used in the algorithm presented in this paper. Finally, the different token based atomic broadcast protocols deliver messages in different ways. In [14], the token
  • 37. 4 | P a g e holder issues an “update dissemination message” which effectively contains messages and their global order. A host can deliver a message as soon as it knows that previously ordered messages havebeen delivered. “Agreed delivery” in the Totem protocol (which corresponds to adelivering the protocol presented in this paper) is also done in a similar way. On the other hand, in the Chang-Maxemchuk atomic broadcast protocol [10], a message is only delivered oncef+ 1sites have received the message. Finally, the Train protocol presented in [15] transports the ordered messages in a token that is passed among all processes (and is in this respect related to the token based protocols presented in this paper). Larreaet al. [16] also consider a logical ring of processes, with a different goal however. They use a ring for an efficient implementation of the failure detectors 3W, 3Sand 3Pin a partially synchronous system.Finally, the IEEE 802.4 Standard [2] defines a token-based access control protocol on top of a bus topology network, essentially implementing total order at the MAC layer. 1.3 MOTIVATION: Within only a couple of generations, the so called digital revolution has taken the world by storm: to-day, almost all human beings interact, directly or indirectly, at some point in their life, with a computer system. As the use of computer systems has increased dramatically over the past decades, the needs and expectations associated with these systems have also increased. In the case of critical systems, dependability has always been a major concern, as the price of a system failure is high, in terms of human lives or economical loss. However, even in the case of non-critical systems, one of the crucial properties is availability and accuracy. High availability is achieved in two ways: (1) By increasing the time a system is up (by avoiding that the system ever goes down) or (2) By reducing the recovery time in case it is down. The second approach is difficult or even impossible to apply to critical systems where the slightest interruption of service is unacceptable. In the first approach, several system designs are possible. The first design choice is to avoid system failures (fault avoidance), while the second one is to tolerate and hide failures within the system (fault tolerance).
  • 38. 5 | P a g e The second design is however appealing, as it can be implemented by replication: instead of having a single machine (a replica) providing a service, the system is composed of several replicas running the service. Thus, if one of the replicas fails, the service is still provided by the remaining replicas. 1.4. CONTRIBUTION OF THIS BOOK This book is a contribution to the ongoing research on the different fault tolerant mutual exclusion algorithms. The research done so far is done on the system level, where a number of systems are interconnected to a grid network. The existing system needs a number of computers and a huge backbone of network connection to establish the experimental setup. And the experimental set up may suffer from any king of unwanted failures that may be the failure of node or the communication network in either of the case we have to focus more on the communication network then on the node failure. Here in this paper we focus on the process level failure in the system, which is a prototype of the real life communication system. In this paper I am using the existing feature of the multi-core processor to simulate the behavior of the grid computing environment by considering a small processor group. This paper an extension and modification of the Richard Ekwall [1] atomic broadcast algorithm, which was based on the unreliable failure detector .Here the focus is on the atomic broadcast of the process which will be using the unreliable failure detector and also satisfying the responsive property (RP). The quality of service [3] is also maintained in the course of failure detection process. The failure is considered to be of crash [4] type. We are preparing a fault tolerant system which will definitely respond within a specified time limit, otherwise the checking for the failure or fault in the distributed system will be stopped and the process that does not reacted or obtained the resource will be declared as faulty and further that process will be removed from the Quorum. In this paper the main focus is on the tolerance level of the fault as well as on the atomic broadcast of the token which must be responded by other processes in a specified time interval.
  • 39. 6 | P a g e 1.5 Outline of the BOOK The outline of this book is as follows: Chapter 2 introduces the types of system and a brief idea about the meaning of fault in the distributed system and a brief idea on the mutual exclusion algorithm Chapter 3 discusses the literature review. We present an overview of the existing works: The atomic broadcast algorithms, The token based Mutex. Chapter 4 discusses the Responsive property and the use of responsive property in the fault tolerant system discusses proposed scheme. We present ourapproach of fault tolerant mechanism which is based on the token based approach as well as satisfying the responsive property. It also includes some simple simulation to justify the work done. Chapter 5 finally concludes this work and presents some open problems.
  • 40. $ $
  • 41. $ ! $ $ $ $ $ $ ! ! $ $ $ ! ! ! ! $ ! ! ! # $ $ $ ! ! !$ $ !$ $ ! ! $ ! $ ! ! $ ! # ! $ $ $ ! $ # $ !
  • 42. ! $ ! !$ ! $ $ $ ! ! ! $ $ #$ $ $
  • 43. !
  • 44.
  • 45. ! ! ! ! ! !
  • 46. ! !
  • 47. % ! % ! % ! % ! ! % ) % $ % ! ! % # % % #
  • 48. ! % # ! ! ) ! ! ! % ! % ! ! % ! % ! ! ! %
  • 49. ) % % ! % ! % ! # $ %!% # ! % % ! %% * % ! ! ! ! * ! ! % #
  • 50. % % ! ! % ! ! # ! % % ! '% % # ! ! # ! % ! ! % # ! ! % ! % ! ! ! !% ! % %
  • 51. +! *,*!+,!+ ' -$, ,'$* *)-!* ' +!$ ('!, ' !$-* -$, !+'$,!' ,' , !$! '%(', -$, ',!%, ,' (*., (*'(,!' ' , !$-*
  • 52. .!$!$!,1 ' *.*+!' %'+ -$, '$* )-!*%,+ +-$$1 , +1+,% !+ ', *)-!* ,' +,!+1 , '*!!$ +(!!,!' ,* -$, '-*+ -, !+, '%($1 /!, +'% -$, ,'$* ('$!1 -$, ,'$*(*'(*,!+ * *$$1 $++!! '*! ,'/ , * '/ , 1 *+(, , +,1 $!.++ (*,+ ' , '*!!$ +(!!,!' !+ $++!!,!' 1!$+ , * %! ,1(+ ' ,'$* +#! ,'$*$/1+ *+(,+ ', +,1 $!.++ ' %+#! ,'$* '/.* , +,1 (*'(*,1 %! , ,%('**!$1 .!'$, -, !+ -*, ,' .,-$$1 *+,'* / !$ , $!.++ (*, !+ ! $/1+ *+(,
  • 53. , !* ,1( !+ !$+ ,'$* '*%$!2! !$ + ,'$* !, !+ ++-% , , , '*!!$ +(!!,!' !+ !. + '-,!' ' +,1 $!.++ +(!!,!'+ ,* -$, '-** '$1 , +,1 '-, + ,' +,!+! 12,! -$,+ -$,1 (*'++'* ',!-+ ,' *- !++-! /*' +/*+ ,' )-+,!'+ ('++!$1 /'*#! ,', * %$!!'-+$1 /!, ', * -$,1 (*'++'*+ !.! !%(*++!' , , ,' /'*# '**,$1 / , 1 * ', ,, +',/* -+ ', 0 !!, 12,! -$,+ $! /!, 12,! -$,+ !+ '! ,' %- %'* !!-$, , $! /!, !$ +!$, '+ ,*% 12,! **+ ,' , 12,! %(!* ,!% ($ ! / ! $++ '+(!*!+ !,*!- -,*-, -$++ /* $$ ,' '%%' ! *-$! !*$+
  • 54. !+,*!-, +1+,%+ . , (*,!$ !$-* (*'(*,1 , , !+ (*, ' , +1+,% !$ / !$ , *+, ',!-+ ,' /'*# *,!$ !$-*+ * ', , $$ ** *'(*$1 +! (($!,!'+ %-+, ,# , % !,' '-, !+ !+ ', '' '* (($!,!' +! (*, !+ , , !, %#+ (($!,!'+ %'* '%($0 '' (*, !+ , , (($!,!'+ ,# ., ' , *-1 '* 1 !+,*!-, +1+,%+ ,' '% %'* *'-+,
  • 55. $ # ! $ $ $ ! $ $ $ $ $ $ $ $ $ $ $ ! $ ! $ $ $ $ $ $ $ $ $ ! $ $ $ !$ ! $ $ $ ! $ $ $ $
  • 56. $
  • 57. !
  • 58. ! ! $ ! !
  • 59. ! $ !
  • 60. $%
  • 61. ! % # %! +/+ /#(! ++-#2 )+ 1'* *+)/##(! +#-++2 +,*)(,, - +#-++2 -#', +/+ ).-*.- #, #(**+)*+#- .- #- #, ()- ,2 -) -+'#( -#, -) #()++- .*#- ',,! . -) . +#(! *+)' '2 !#/( , ( 1'* -+(-#/2 -+ '2 '##)., '(- #(/)/
  • 62. /+#)., #.+ ,(+#), #( #,-+#.- ,2,-', ( -+(,'#,,#)( 2, #( *+-#.+ / #(,-#!- #'*)+-(- 0)+% )( - ).(-#)(, ) #,-+#.- ,) -0+ . ) -#, 0)+% , )., )( - (-+ #,,. ) #,-+#.- !+'(- + + '(2 /+#-#)(, ) -#, *+)' #(.#(! -#' ,2(+)(#3-#)( )(,#,-(- #,-+#.- ,-- #,-+#.- '.-. 1.,#)( #,-+#.- -+(,-#)( )''#- #,-+#.- -+'#(-#)( #,-+#.- -#)( - )0/+ ) -, +. -) - )'')( *+)' ) +#(! !+'(- #( #,-+#.- (/#+)('(- #( - *+,( ) #.+, !+'(- #( .-2 #,-+#.- ,2,-', #, ., -) - ))+#(-)+ *+),, )+ ##(! -) )''#- -+(,-#)( #( #,-+#.- ,2,-', - .,, '$)+#-2 /)-#(! '(#,' 0# ( -)+- .-2 ).- ) *+),,, #, '$)+#-2 ) ) #,-+#.- ,2,-', #, -) / ()( .-2 *+),,, !+#(! ( +#(! !+'(- #( #(#- (.'+ ) )*+-#)(, ( ( .(+# (( #( ( ,2(+)()., ,2,-' () !+'(- #, *),,# /( 0#- ()( .-2 *+),,, ( - ))0#(! ,-#)(, -0) )'')( 1'*, 0# !#/( )+ --+ .(+,-(#(! ) - ,.$- $ % ( -#, 1'* ('2 +'2 ,
  • 63. -+))*, . +'2 , -0) ,*+- !-+#(!, . ( . ) -+))*, )( . 0# ), -)!-+ , ))+#(- --% . ( 0#( )''.(#-#)(, #, 2 .(+# (( ,( ',,(!+ 0) '2 *-.+ 2 + +'2 ,) '2 ()- ++#/ . ,(, -) . 4-, --% -)')++)0 - 0(5-+ . ,(, )( #+'-#)( -) . 4,*(# # , 2). - 0(5 .- . +#3, -- . ), ()- %()0 # - ',,! ++#/ ,) . ,(, -) . 4',,! ++#/ -- ,-5-( . +#3, -- . ), ()- %()0 # - ',,! ++#/- , ,)0( #( - #!.+ )0
  • 64. *# %!, %# ! '*# ( %! )% (% ( # ' (% #!!('# # %' %!' % ( ' !'#
  • 65.
  • 66. ' +!$ !, %!, #% (' ( %!, (% #'%# # % !$ $%' , (#* #(' % % '%'#% * '%, '# $%)' ' #, % % %!'
  • 67. #!!('# % , # '# # ' $# '* $% # % '# + '%##$ '%' #%!'#
  • 68. #* ' ( %!, #, % % %!' # '%##$ '%' # #'% #, % ' ' % #, ' '%##$ '%##$ '%' # % ' ' % #' #, ' '%##$ ( $%# , #%%'
  • 69. $
  • 70. 67+1+ +/)0 /,)* % $+/) 0+!0 *00$ 1, 1% ,1%/ $+/)0 ,6) $+/)0 1)) 1/21% 1/1,/0 ) % /02)10 ,# *00$ 5 %+$0 / ,))1! 6 % $+/) 1, $3 3 1,/ % $+/) 0+!0 3 1,/ 1, )) ,1%/ $+/)0 % $+/) 5*++$ % )*+1 / 3! #/,* 1% ,1%/ ),,( #,/ 1% *',/16 /0-,+0 #,/ % )2 $+/) )$,/1%* 4,/(0 0+ 1/1,/ $+/)0 / 2+) 1, ## 1 *00$0 #/,* ),6) $+/)0 3/ ,*+$ 1/1,/ $+/)0 /.2/0 *+*2* ),6) $+/)0 + 1,1)
  • 71. 601*0 +3,)3+$ *2)1-) -/, 000 / ,#1+ *,01 0)6 -/,$/**! 20+$ /1 ) /$,+0 %+ -/, 00 %0 1, /! ,/ 2-!1 /1+ 0%/! !1 01/2 12/0 1 #/01 +1/0 /1 ) /$,+ 1, %3 *212) 5 )20,+ +! +02/ 1%1 +, ,1%/ -/, 00 4)) 20 1% 0%/! !1 01/2 12/0 1 1% 0* 1* + !01/21! 0601* +1%/ 0%/! 3/)0 0*-%,/0 +,/ ), ) (/+) + 20! + ,/!/ 1, *-)*+1 *212) 5 )20,+ %20 *212) 5 )20,+ %0 1, 0! 5 )203)6,+ *00$ -00+$ + 1% ,+151 ,# 2+-/! 1)*00$ !)60 +! +, ,*-)1 (+,4)!$ ,# 1%011 ,# 1% 0601* ,*1*0 1% /0,2/ 0 *+$! 6 0/3/4% % *-)*+10 10 ,4+ ), ( 1,$1%/ 41% 1%* %+0*0 +!! 1, 06+ %/,+7 00 1, 1%/0,2/ + 0+$) -/, 00,/ 0601*0 /1 ) /$,+0 / -/,1 1! 20+$ 0*-%,/0 *,+1,/0 +! 0*)/ ,+01/2 10 212) 5 )20,+ /#/0 1, 1% -/,)* ,# +02/+$ 1%1 +, 14, -/, 000 ,/ 1%/!0 / + 1%/ /1 ) 0 1,+ 1 1% 0* 1* / /1 ) 0 1,+ /#/0 1, -/,! ,# 1* 4%+ 1% -/, 00 000 0%/! /0,2/ 02 % 0 0%/! **,/6 212) 5 )20,+ 0 #2+!*+1) -/,)* + !01/21! ,*-21+$ 0601*0 212) 5 )20,+ +02/0 1%1 ,+ 2//+1 00 ,# -/, 000 1, 0%/! /0,2/ ,/ !1 0 0/)7! 1%1 0 5 21! + *212))6 5 )203 *++/ 212) 5 )20,+ + !01/21! 0601* 0110 1%1 ,+)6 ,+ -/, 00 0 )),4! 1, 5 21 1% /1 ) 0 1,+ 1 +6 $3+ 1* % /1 ) 1,+ 0 -/*13 4% % )),40 20 1, +#,/ *212) 5 )20,+ + !01/21! 0601* 0%/! 3/)0 0*-%,/0 ,/ ), ) (/+) ++,1 20! 1, *-)*+1 *212) 5 )20,+ % +1)7 /1 ) 1,+ +! )1 /1 ) 1,+ ,-/1,+0 + ,+0!/! 1, 3/6 *2 % 1% 0* 0 %- /1,+ +! !01/2 1,+ ,# ,' 10 + 1% 4%,) 1 0 0+0) 1, (- /1 ) 0 1,+ /1,+ +! !01/2 1,+ 1, ,+ -/1 2)/ 1%/! +,/*))6 1% ),+$01 )3! 3,20)6 )) 1% 1%/!0 1%1 40% 1, 06+ %/,+7 00 20+$ 1%0 -/*13
  • 72. (0./ #1 #)' *- +*$)/ - /* /#$. +-$($/$1 #$. (4 $- / 1$ .#- 1-$' *- $)$- / + -#+. 0. /# -$/$' . /$*) $. ( $) /#- .! '.. /* 2#$# */# /#- . #1 .. ) /# -$/$' . /$*) *% / $. - / $/ ) 0. /* *)/-*' .. /* .#- - .*0- # /2* ($) *+ -/$*). - )/ --$/$' /$*) ) 1 -$/$' /$*) ) - / ' *! /# ./)- '$/ -/0- *) /# /*+$ *! .4)#-*)$5/$*) /# . *+ -/$*). - '.* )*2) .
  • 73. )
  • 74. *- ) - .+ /$1 '4 # . '/ -)/$1 / -(. - '.* 0. !*- */# - .4)#-*)$5/$*) +-$($/$1 . ) #1 -*0#'4 ,0$1' )/ ( )$). 4 !0'/ 2# ) /# -$/$' . /$*) $. - / )*) *! /# /#- . $) /# ++'$/$*) #1 *2) -.#$+ *! $/ * $) *2) -.#$+ /#- ( . '' /* )/ --$/$' /$*) ) $! /# -$/$' . /$*) $. )*/ *2) /# ) /#$. /#- $). *2) -.#$+ # /#- /# ) /4+$''4 + -!*-(. *+ -/$*). 0+*) .#- - .*0- /# -$/$' +$ *! * $''0./-/ 4 *0' '$) ) *) $/ #. !$)$.# $/ - ' . . *2) -.#$+ 1$ '' /* 1 -$/$' /$*) # $(+*-/)/ +-*+ -/4 /#/ -$/$' . /$*). #1 $. /#/ *)'4 *) /#- (4 #1 *2) -.#$+ / )4 *) /$( ! /#- /-$ . /* )/ - -$/$' . /$*) 2# ) )*/# - /#- $. '- 4 $).$ /# -$/$' . /$*) /# ) $/ 2$'' .0.+ ) ) *)'4 - ''*/$*) 2# ) /# */# - /#- #. ' !/ /# -$/$' . /$*) #$. +-*1$ . 0. 2$/# /# - ,0$- (0/0' 3'0.$*) -*0) .#- - .*0- *- /#) *) /#- ) .0.+ ) 2$/$) !*- *2) -.#$+ / *) /$( .* -$/$' . /$*). ) 0. !*- .4)#-*)$5/$*) /2 ) (*- /#) /2* /#- . 4 24 *! ) 3(+' # - . 2#/ #++ ). $! !*0- /#- . /-4 /* $) .. /* /# .( -$/$' . /$*) / -*0#'4 .$($'- /$( . .. +..$) $. /# .*' ( ). !*- $(+' ( )/$) $./-$0/ (0/0' 3'0.$*) # $.$*) . /* 2#$# +-* .. $. ''*2 .. /* /# ) 3/ $. --$1 / 4 ( .. +..$) $) 2#$# # +-* .. ' -). *0/ /# .// *! '' */# - +-* .. . $) .*( *).$./ )/ 24 # .$) *! $./-$0/ (0/0' 3'0.$*) '*-$/#(. $. *(+' 3 0. /# . '*-$/#(. #1 /* ' 2$/# 0)+- $/' ( .. '4. ) $)*(+' / )*2' *! /# .4./ ( .// # - - /#- .$ ++-*# . !*- $(+' ( )/$) $./-$0/ (0/0' 3'0.$*) * ) . ++-*# *) /* ) . ++-*# 0*-0( . ++-*#
  • 75.
  • 76. ! ' '! ##% (!$( '! !*! '
  • 77. % ! ' ' ' * ' !'% ' ' # ' '! ! ' !'!( ' ' '! (!' ' +('! ' )% ('( +(! !(% ( ' '! (!$( %' ! ' ##% !', % ! ' *, ' %% (' ' % % ' '!
  • 78. ! !! '! ('( +(! %' ' (!' *' ' '% ' ' %'%' * ( +(' ' !+' ' !'! %$(' ' '' !'! ' ' % * ' (' $(% #% ! % !'%! '
  • 79. ! ' ##% '* % % () %(! % +! ! ' ' ' '% ! * ' * !'% ' !+' ' !'% ' %' '! *! ! %'! ! ! ' )% '%( ('( +(! !% ( ' %'! '%( !, ' ! ' ' !, )! ' ' ! #% ' ' !, '% ' $(% #% ! % ' ' ! ' %$(' ' % ' ' # (! #%'- *' ' )%'( ' ' # % %) , ' ' !! ' % ' ' # %$(' ) #%%', )% %% ' ' # %$('
  • 80. ! ' $(%( ##% ' %$(' #% ! ' +(' ' % (' ' $(%( $(%( % % ! ( *, '' *! '* ' !(%%!', %$(' ' ' ! ' %) ' ' %$(' ! * %#! ' (% '' !, ! %$(' +(' ' ' !, '
  • 81. ! '%(' ' ,' '%!'! ( +('! ' #%'! ' ('# ' ! ' ', %$(% )%, '%(' '%!'! ' ' ' '%!'! (' ) ' ' ' % %' ' )%, '
  • 82. ! !'*% #%''!! ' % #%''! ! ' #%''! , !' ' (!' *' '% *% $(%( '!$( ! (! !' '' '%!'! +(' ' %', ' )' ' +(' ' )%, ' ! ' ,' ! )' ' ( ( '' ' '' !( % )' ! ' ,' ! ' %' ! ' $(%( % ! %#'), ! ' *! %( (' , ! ' # !''! ' ' #%'
  • 83. 5'$0$ $%-0$ 20 ,1 2(-, - -,$ 1(2$ 2' 2 (1 .0$. 0$ $%-0$ 20 ,1 2(-, +-0$ 1(2$1 2' 2 0$ .0$ '$ %(012 03*$ $,130$1 2' 2 2 '$ ,$62 25- 03*$1 (,#( 2$ 2' -,$ 5 7 -0 2'$ -2'$0
  • 84. '$ 1712$+ -,1(121 -% 1(2 1(,*$.0-$11 (1 03,,(, -, .0-$11$1 -++3,( 2$ 17, .0-$11 5(1'(, 2-$,2$0 2'$ +$11 $1 ,# 5 5 (2(, 2'$ .0-$11 (1 ,-2 ** -,$ -% 2'$ %-**-5(, 2'0$$ 12 ,-0 $6$32(, 2'$ ( $ (# ,,-2 + )$ %302'$0 0$/3$121 , 2'$ 2-)$, ! 1$# *-0(2 (1 $6$32(, -321(#$ 2'$ 2 ,7 (,12 ,2 1(2$ + 7 ' 0$/3$121 ,# 1$04$1 2'$+ -,$ 2 2(+ ' ,,$*1 (% 2'$7 0$ -0 , #$*(4$0 ** +$11 $1 1(2$1 #- +323 * $6*31(-, *-0(2'+1 +.-02 127*$ *-( * *-)1 0$ 31$# 2- #$(#$ 2'$ .0(-0(27 2' 2 2'$ 1+ **$0 2'$ 2(+$12 +. -++(21 (2 +312 -!2 (, -++(2 /3-03+ $# 2- -++(2 ,# 8$0- -0 +-0$ 1(2$1 5 (2(, !-021 (2 +312 -!2 (, , !-02 /3-03+ $. 0$# 2- !-02 -0 ,7 1(2$1 5 (2(, 20 ,1 2(-, ,,-2 !$ -++(22$# ,# !-02$# '$ 4-2$1 2' 2 20 ,1 2(-, ' 1 2- -!2 (, !$%- 2$1 (2'-32 *-11 -% $,$0 *(27 $ ' 1(2$ '$ .0-$11 2 1(2$ ( (1 #$,-2$ ,'0-,-31*7 -4$0 , 3,#$0*7(, -++3,( 0$/3$121 ** -2'$0 -0 13!1$2 -% .0- 5 (21 %-0 ..0-.0( 2$ 0$.*($1 !$%-0$ $,2$0(, -5$# 2- + )$ %302'$0 0$/3$121 2- $,2$0 2'$ 2$1
  • 85. 0$/3$12(, 2'$ $6$32(, 2'$ -0 #*$ , 2'$ 90$/3$12(, 2'$ : 12 2$ 2'$ 1 %-0 2'$ , 2'$ 9(#*$: 12 2$ 2'$ 1(2$ (1 $6 2'+1 1(2$ , *1- !$ (, 12 2$ 5'$0$ 1(2 3' 12 2$ (1 0$%$00$# 2- 1 2'$ 12 2$ ' 4$ 1$4$0 * .$,#(, 0$/3$121 %-0 1(2 +$ $ #- ,-2 + )$ ,7 113+.2(-, 0$ 0#( ,-2 '(1 (1 *-0(2'+ 1.$(%( $ 113+$ 2' - ,-2 0 1' ,# 2'$ ,$25-0) #-$1 ,-2 $2 0$ #$1(,$# 2- ' ,#*$ 13' 1(23 2(-,1 2- 11(, 2(+$12 +. 2- 0(2( * 1$2(-, 0$/ 7 -% 0$/3$121 (, 2'$ 1$ -% -,%*(2 $,$ . -% 0$/3$12 2'$ '('$0 (21 .0(-0(27 2- $6$32 '$ 2-2 * -% 2 *$ 12 '$ 2-2 * -% 8$0- -0 # 2 2'$ 1 +$ 2(+$ -0$ (2 , 2$0+(, 2$ 5$ 113+$ 2' 2 $# !7 .( ** 2'$1$ 2(-, ,$25-0) -$11$1 !7 1$,#(, , 2'$ '(*$ 1(2$ , !$ (, 0 ,$(2'$0 0$/3$12(, 1(2$ (1 !*-)$# ,# 6$32(, -321(#$ 2'$ $ '-*#(, 2'$ 2-)$, 2$ /3$3$1 3. 2'$1$ (, -++3,( 2(-, 2 ' ,,$*1 0$*( !*7 2 . 02(2(-,$# -+$ ,7 *-0(2'+1 31$ /3$121 (+$12 +.1 $0 * 03*$ %-**-5$# (1 $ 2'$
  • 86. '% !!) !! % !% '$ ! $!%%% !$ %% (!( (! $ %! !% ($ %% + !% ($ $%! *'!
  • 87. '' *'%! !$ %!' %%+ !!) $!$% + $! ,!
  • 88. + ! ! %+ $!$+ %% + % ! + ! $!%% *' $ %! % % %% $!$+ ! '' *'%! !$ ! % $!$+ %% % ! ! %$(! )! !$!$ %% %!' ! %%+ ) !$ %%% ) ) ($ $$( ! %'% ! ) + ! *' ) !$ %% $ $+ *' % ($+ $#'% % %!' !!$' + ! *' $ %% ! * ! '' *'%! % $!%% % $ ! *' '' *'%! !$% $ %% $!$+ $+ % *'! $#'%% $ *' !$$ ! $ $$( % $ + ! ! %+% $% $!$+ % %!'+ %%$+ !$ )! $!$% $ ! %$ !$
  • 89. ## #! ! ## #! ! ! ' !# ' % # ! ) # !!! # # ' ! !# # !!! # !!! !'! )
  • 90. ! $! ! # ! ! ' !# !!! ' # ! ! ! !' ( ' !# # # !! # $# !!! %# %! $
  • 91. ) ! $ #! %! ! # $ ! #! !!! $ ! # #! !! ! # #! %! ! ! #! !!! $ ! # #' !%! # # ' $# !! ! # !!
  • 92. . %- .$! ,.! . 1$%$ .$! -3-.!' !2!/.!- ,!+/!-.- ), .$! %- .$! -3($,)(%4.%)( !3 ( %- .$! 0!,#! ,%.% -!.%)( !2!/.%)( .%'! .$!( .$!.$,)/#$*/. %- #%0!( 3 .$! ))1%(# !+/.%)( 3-.!' .$,)/#$*/. $!,! %- .$! 0!,#! 3($,)(%4.%)( !3 %- .$! 0!,#! ,%.% -!.%)( !2!/.%)( .%'! 3 *,)!--), !(!,3 .$! 0/! ) *!,),'(! '!.,% /./.!- -..%-.%3 ,)' ,!+/!-. .) ,!+/!-. ( 1! #!(!,3 )(-% !, .$! 0!,#! 0/! ) -/$ '!.,%
  • 93. $! ) %- !.!,'%(! 3 .$! ,,%0 ,.! ) !2!/.%)(,!+/!-.- !,),'(! ) '/./ !2/-%)( #),%.$' !*!( - /*)( .$! ) ( 1! ).!( -./ 3.$! *!,),'(! ) '/./ !2/-%)( #),%.$'- /( !, .1) -*!% ) %(# )( %.%)(- 0%4 5)1) ( 5$%#$ ) ( !, )( %.%)(- .$!,! %- -! )' '),! .$( )(! ,!+/!-. ), .$!,%.% -!.%)( *,!-!(. %( .$! -3-.!' -%'/.(!)/-3 ( !, )( %.%)(- .$!,! %- 13- *!( %(# ,!+/!-. ), ,%.% -!.%)( . -%.! $/- %( $!03 ) )( %.%)(- .!, $0%(# !2!/.! ,!+/!-. -%.! %''! %.!3 %(%.%.!- .%0%.%!- .) !2!/.! %.- (!2. ,!+/!-. -%.! %- -! )' %( .$! % ! -..! %( $!03 ) )( %.%)(- ), '(3 '/./ !2/-%)( #),%.$'- .$! *!,),'(! '!.,%- ( ! )'*/.! !-%3 /( !, )1 ( $!03 ) - .$,)/#$ -%'*! '.$!'.% ,!-)(%(#
  • 94. !(!,3 '/./ !2/-%)( #),%.$'- $0! !-. ( 1),-. -! ), .$! *!,),'(! '!.,%- ( .$! !-. -! *,!0%%(# )( %.%)(- ,! -/$ .$. *!,),'(! '!.,% ..%(- .$! !-. *)--%! 0/! ), !2'*! %( ')-. '/./ !2/-%)( #),%.$'- .$! !-. 0/! ) .$! ,!-*)(-! .%'! %- ,)/( .,%* '!--#! !3 */- .$! !2!/.%)( .%'!
  • 95. .!( ), '/./ !2/-%)( #),%.$'- .$! !-. ( 1),-. -!- )%(% ! 1%.$ )1 ( $%#$ ) - ,!-*!.%0!3 ), !2'*!- .$! !-. ( 1),-. 0/!- ) .$! ,!-*)(-! .%'! ,! $%!0! 1$!( ) %- ,!-*!.%0!3 )1 ( $%#$ %( -)'! '/./
  • 96. 5 )20,+ )$,/1%*0 1% 01 +! 1% 4,/0 *00$ 1/## 0 $+/1! 1 ),4 +! %36 ),! ,+!1,+0 /0- 13)6 1 5 210 1% #,)),4+$ 1%/ 01-0 1, +3,( *212) 5 )20,+
  • 97. 1-
  • 98. .201 /1 ) 1,+ .201+$ 1/2 +! *00$ 1, )) 010 + 1 2+1) 1 2+1) )) 010 + %3 0+1 /-)6 1, .201+$ #)0 1-
  • 99. 5 21 /1 ) 1,+ 5 21+$ 1/2 5 21 5 21+$ #)0 1-
  • 100. )0 /1 ) 1,+ ,/ 3/6 01 ( + 5 -1 !, $+ 9 7(8 +! *00$ 1, ( 7(8 +!
  • 101. 1 0 %+!)+$ *00$ '
  • 103. $+ # 6 -/,/16 1%+
  • 104. 7'8 6 /,/16 1/2 # -+!+$ /.201 ,# %0 -/,/16 ,3/ + ,*+$ /.201 )0 $+ +! *00$ 1, '
  • 105. ', ! , ! !
  • 106. ! 34 ! ! %++ ,' +!, 0-,!
  • 107. ,*- !
  • 110. $+ ! !
  • 111. ! 34 ! ! %++ ,'
  • 112. !, !!+ $! %++ ! !
  • 114. !5 34 * / + '-$ %# +-* , , %++ $*+ , +,(+ ' , $'*!, % ++ + * , +,*-,-*+ .!2 ! ! ! ' -*, , '**,++ !,7+ !%('*,, , , 0-,!' ' %++ $*+ $$ , * +,(+ ' , $'*!, % 0(, 6/!,'* !
  • 115. ,' '$6 ! ,( %-,-$$1 0$- ', *
  • 116. % $ % )$ #%$ % $ $# $%$ $% !# % %$
  • 117. % ! $$$$$ % % # % % $ % # $% #%$ # )%#* % %#$ %# !% % # $$$ %% '# !# % % #$ $ %% %$ #%$ % # %( # %% * $ % % % ' % ( )! $ !# ( !!$ # $% $$ #%$ (% !# #' !# $$ # % !# # ( %# !# $$ $ ( % # $% $$ * ( % % % % $ #% % $% %# % % #% $% * % $% $ ' % ' % % %$ $ * # %# % %
  • 118. % ( # %# $% % %#$ #$% % %# $% ' % % % * #$ % % % $ % )% %
  • 119. % $% % % %# $% $ !% %$ $%%$
  • 120. %% %# $%$ % # # %# %
  • 121. ('# % % $ #%$ $ ! %* #* # ! #$! $#' ( $ % $$#* !!# )!%* % #% % !% (* $ % $ %# # %#$% % %#* % $ % $ % # $% #%$ %% #* # %% #$ ## % % '% # %% #$ % $ #%$ %# !% (% % $# %* $% '# %$ % !% % #% (# # $$! $ $% %#% % $ #% !# $$$ # #+ # % %#$$$ % * (% %# % !#$$ # $$$ # )!% # $ % ! $% % # $ %(# # $ $%#% ( !# $$ $ $$ ! $% % # # ! $% $ * % # ## %( # #$$$ # $ %# $ % $ % %%# (% % ## $ %% %%#$ $ %% !# $$ ($ ( $ )% %# %$ $ % $ % #$%#%' # # %% # $ #%$
  • 122. %!$ $ '*) %$ $ $ %' )# )% )%!$ ( '%((( ' %'$ . $ % ' $ '%(( ( *' ))%' #%* )) '%+ ( $%'#) %$ %$- %*) )( ## ) '((%' 2 $ '%(( %$- ($( )%!$( )% $ ' +( )%!$( '%# )( '((%'( $ (*((%'( ,' ( ) $*#' % )%') *'(
  • 123.
  • 124. )%!$ %' /+%)(0 %' ) '%%( $ ) )%!$ $ )$ ($( ) )% )( $ %'(
  • 125. ( (%%$ ( (* $) $*#' % )%!$ %'( + +%) %' (%# '%%( + )$ + ( ( %$ ( )$ '%) ( ) )%!$ '*)( %$ ) ' $ %' )# $ %,+' $%) $- $'( ) +%)( (- )) )' ( $ ) )%!$ '*) %$ ) )%!$ ' + - '%(( $ '%*$ '%*$ ( $%) '%# ) )%!$ ,( $%) ($) $ '%*$ '%*$ *) $ (%# '%*$ %' ))
  • 126. ( (%%$ ( )' ( $ ) )%!$ '*) %$ +%)( ( '() - ) ' +'
  • 127. )' )) +%)( ' $'#$) ) )) % $) +%)( ' ')' )$ ) +%) )'(% ( %$ ) () #) % ) )%!$ ( %$ ( )$ '%) , ) ) )%!$ %) )) ( %$ ( )!$ %$- (*(( + '%((( ' + ) )%!$ '%# ) ' '((%' $ )'%' $'#$) ) +%)( , )%*) '()) $ )#
  • 128. %' )%!$ ( %' )#( , $ $, *' ))%' $%) ()$( %' $ +$ '%(( ) *' ))%' )) )% %$- +( $%'#) %$ %*) ) ## ) '((%' %' +'- '%(( $(*'( ) %%, $ '%') ( %#)$(( '(( $ ( %'') )$ ( +$)*- '#$$)- (*() -
  • 129. *'- $ ' %'') )' ( ) # ) )' , ( $+' (*() -
  • 130. ,)-. ), .). ), , ,)-. $- ( $'*),.(. -.,.$)( $( !/. .) ,(. $-.,$/. )'*/.$( .)'$ ,)-. (-/, - .#. ' -- - ,)-. 3 $!! , (. *,) -- - , $0 , 3 -.$(.$)( *,) -- - $( .# -' ), ,
  • 131. .)'$ ,)-. ),$.#'- ( --$!$ ),$( .) .# ' #($-' /- !), ' -- ), ,$( )% ( $,/.$)( $- )( $'*),.(. ), ,$( ' #($-' ( .# - ),$.#'- .)% ( $,/. - ')( .# *,) -- - ( .# .)% ( #) , #- .# *,$0$ .) ), , ' -- - .#. #0 ( ,)-. $.$)(3 -)' .$' - )(3 .# .)% ( #) , $- )1 .) ,)-. ' -- - )1 0 , .# ), ,$( ' #($-' $- (). .# )(3 % 3 ' #($-' )! ( .)'$ ,)-. ),$.#' # ' #($-' /- .) .) ,. !$/, - $- ().# , $'*),.(. #,. ,$-.$ )! .# ),$.#'- ! 1 )(-$ , -3(#,)()/- -3-. '- 1$.# ,-# !$/, - .# .1) ')-. 1$ 3 /- ' #($-'- .) .) ,. !$/, - $( .# )(. 2. )! .)'$ ,)-. ),$.#'- , $ /(, $ !$/, . .),- ( $$ ,)/* ' ' ,-#$* ), 2'* .# .)'$ ,)-. ),$.#' *, - (. 3 #(, ( )/ $( .) .# , 1$.# )(- (-/- ),$.#' /-$( .# !$/, . .), !- $(.) .# !$,-. . ),3 .# .)'$ ,)-. ),$.#' 3 $,'( . $( !- $(.) .# - )( . ),3 .)'$ ,)-. $- )( )! .# , ' (. *,) '- .#. $- $'*)--$ .) -)0 $( ( -3(#,)()/- -3-. ' ( ), , .) $,/'0 (. .# $'*)--$$$.3 )! .)'$ ,)-. .# -3(#,)()/- -3-. ' ( 2. ( 1$.# ), - .#. *,)0$ -)' $.$)( $(!),'.$)( )/. .# -.. )! .# -3-. ' ( -/# ), $- .# /(, $ !$/, . .), 1#$# *,)0$ - /(, $ $(!),'.$)( )/. *,) -- !$/, - ( .#/- )1- *, 0$)/-3 $'*)--$ , ' (. *,) '- .) -)0 /,.# ,'), (3 ),$.#' .#. /- - !$/, . .), $- $, .3 2*)- .) *,) -- !$/, - .)'$ ,)-. ),$.#'- ( -) --$!$ !))1$( .# ), ,$( ' #($-' .#. .# 3 /- ( .# !$2 - +/ ( , **,)# !), 2'* -$( *,) -- $- , -*)(-$ !), ), ,$( ' -- - 1# , - $( -.$(.$)(- , ' (. **,)# .# -.$(.$)( *,) -- - )! ' -- ' , )( .# ), , )! $0 ,3 )! ' 1$.# , -* . .) .# ).# , ,)-. ' -- - .# , ), ,$( ' #($-'- $(/ .# ')0$( - +/ ( , ), *,$0$ - **,)# - 1#$# , ).# , . .) .)% ( - ),$.#'-
  • 132. )% ( - ), ,$( ' #($-'- $'*$$.3 *,)0$ !)1 )(.,) .#. $'$.- .# )(. (.$)( )( .# ( .1),% ( .# *,) -- - ( .#/- )1- #$# -3-. ' )- .)% ( ( /- $( - 0 , 13- $(
  • 133. .# .)% ( , . - .# ), , ' -- - # .)% ( ( -) $'$. .# -- .) .# ( .1),% )(3 .# .)% ( #) , $- )1 .) - ( ' -- - )( .# ( .1),% ( .# ' -- - , .#/- -$3 ), , -$( -$( - ( , 2$-.- . $0 ( *)$(. $( .$' $(3 .# .)% ( ( /- .) - . - +/ ( , *,) -- .#. , $0 - .# ' -- - !,)' ).# , *,) -- - ( --$(- - +/ ( (/' ,- $( .# .)% ( $,/. - .# ) )! --$($( - +/ ( (/' ,.) ' -- - $- $-.,$/. ')( .# *,) -- - $( .# -3-. ' ( .# .)'$ ,)-. *,) ' !$( 3 .# *,$'$.$0 -,)-. ( $0 , *,) -- - #0 .) , )( )'')( .). ), , $0 ,3 )! - . )! ' -- - ),'3 1 !$( /($!),' .)'$ ,)-. 3 !)/, *,)* , .$ - $$.3 ! ),, . *,) -- * ,)-.- ' -- ' .# ( $. 0 (./3 $0 ,-5 ' ($!),' , ' (. ! *,) -- $0 ,- ' .# ( ),, . *,) -- - 0 (./3 $0 , ' ($!),' $(. ,$.3 ), (3 ' -- ' 0 ,3 *,) -- * $0 ,- ' . ')-. )( ( )(3 $! ' 1- *, 0$)/-3 ,)-. ( ($!),' .). ), , ! -)' *,) -- ),, . ), !/.3 $0 ,- ' !), ' .# ( 0 ,3 *,) -- $0 ,- ' )(3 !. , $. #- $0 , '
  • 134. ( .)'$ ,)-. )1- *,) -- - ),($4 $( ,)/* .) ,)-. ' -- - ( $0 , .# ' $( .# -' .). ), , , (/' , )! .)'$ ,)-. ),$.#'- #0 ( *, - (. $( .# $. ,./, 0 , **,)# - 2$-. .) .) ,. !$/, - ( .) ), , ' -- - *, - (. ( 1 ),$.#' .#. /- - .)% ( - ' #($-' .) ), , ' -- - ( /(, $ !$/, . .),- .) .) ,. !$/, - # ) )! .# ),$.#' $- .) ( !$. !,)' .# #,. ,$-.$- ( ,3 --)$. 1$.# !$/, . .), - ),$.#'- .# )1 )-. )! 1,)( -/-*$$)(- ( .)% ( - ),$.#'- !!$$ (3 $( . ,'- )! .#,)/#*/. / .) .# (./, !)1 )(.,) *,)0$ 3 .# .)% ( # * ,!),'( )! )/, .)% ( - ),$.#' $- -$'/. ( )'*, .) .1) ).# , !$/, . .),- ),$.#'- # -$'/.$)( -#)1- .#. .# ( 1 .)% ( - ),$.#' #$ 0 - )1 , . ($ - ( #$# , .#,)/#*/. .#( ).# ).# , ),$.#'- $( ')-. - ..$(- , )(3 )( *,) --), 1$ ,)-.$( .# ' -- !), 2 /.$)( )! .# $! $. $- #0$( .# 0$ .)% ( ( .# -3-. ' (-/, - .# .)'$ ), , )! ,)-.$( )! ' -- #. $- .# ' -- - 1$ , $0 $( .# -'
  • 135. 7!9 !3 )4 7!3 2/!$#!34%$ ()3 -%#(!.)3- 02%3%26%3 4(% !4/-)# /2 4/4!, /2$%2 / 4(% 2/!$#!34 / -%33!'%3
  • 136. (% 02/0%249 34!4%3 4(!4 /2 %!#( 02/#%33 0) 2/- 4(% %')..).' / 4(% !,'/2)4(- %8%#54)/. !.$ 5.4), 0) 0/33),9 #2!3(%3 4(%2% )3 ! 3%4 / 02/#%33%3 7(/3% 3):% )3 '2%!4%2 4(!. 35#( 4(!4 %!#( 02/#%33 0* / 4()3 3%4 2%#%)6%$ ! 2%0,9 -%33!'% 2/- 0) 4/ %!#( / )43 2%15%34 5.4), 0* 0/33),9 #2!3(%$ /4)#% 4(!4 4(% .5-%2 / !5,43 !,3/ $%0%.$3 /. 4(% 5.$%2,9).' 3934%- 4 #!../4 % '2%!4%2 4(!. 4(% .5-%2 / #2!3(%3 7()#( 6)/,!4%3 4(% / 4(% 3934%- 3).#% 4(% ,!44%2 -534 !,7!93 (/,$ $%30)4% !),52%3 . %8!-0,% / ! 3934%- 4(!4 3!4)3)%3 4(% 7/5,$ % ! 3%4 / 02/#%33%3 5,,9 #/..%#4%$ !.$ /2'!.):%$ ). ! ,/')#!, 2).' 7(%2% 0) #!. #/--5.)#!4% 4/ !,, 4(% ./$%3 54 4(% 2%0,)%3 2%#%)6%$ 9 0) !.$ 0)= 0) 3 .%)'(/23 4/ 4(%)2 2%30%#4)6% 2%15%343 !,7!93 ).#,5$%3 0) 3 2%0,9 5.4), 0) 0/33),9 #2!3(%3 . /2$%2 4/ %.352%3 4(!4 4(% !,7!93 (/,$3 4(% 3934%- 3(/5,$ 4/,%2!4% !4 -/34 !5,43 7()#( )-0,)%3 4(!4 + -534 % '2%!4%2 4(!. 5#( ! 3934%- )3 %!3),% ) /2 ).34!.#% /4( #(!..%,3 0) 0) = !.$ 0) 0) !2% .%6%2 4(% 3,/7%34 /.%3 !-/.' !,, 4(% #(!..%,3 #/..%#4).' 0) 4/ !./4(%2 02/#%33 %.#% ) 0) 0) !.$ 0) = !2% ./4 #2!3(%$ !4 4)-% 4 4(%. ;0) = 0) 0) %,/.' 4/ 2%#4 ) !3%$/. /34%!/5) %4 !, . 4(% 2%30/.3)6%.%33 02/0%249 )3 $%).%$ !3 /,,/73 .45)4)6%,9 4(% 02/0%249 34!4%3 4(!4 /2 %!#( 02/#%33 0) 2/- 4(% %')..).' / 4(% !,'/2)4(- %8%#54)/. !.$ 5.4), 0) 0/33),9 #2!3(%3 4(%2% )3 ! 3%4 / 02/#%33%3 7(/3% 3):% )3 '2%!4%2 4(!. 35#( 4(!4 %!#( 02/#%33 0* / 4()3 3%4 2%#%)6%$ ! -%33!'% 2/- 0) 4/ %!#( / )43 2%15%34 5.4), 0* 0/33),9 #2!3(%$ 0) 0)
  • 137.
  • 138. ! ! ! ! !# # ' ! # !'! % % ! $ ! ! $ !'! !# $ ' !# !'! ! #' #' !# !#! !! #' #' !! ! ! ! !! ' !! ! #' #' %! !'!! # !! !# ! # ' ! $ $
  • 139. !! ! $ $ !# ! !! ! !# ' # %!
  • 140.
  • 141. % !'! !# !! #! # ' % ' !! % ! $# !! !# ' #
  • 142. % ! ! !! % % $# !! !# !! ' !! ! ! ! !# ' ! ! ! ! #! % ! ! # ! # !'! ! $# !!! ! !! !! # % # !# ' # ! $# ' % ! !! # ! ! !! !# ' !! ! # ! # % !!# !! ' ' ! ! # ! ! ' ## % ! % % !! ! !# % !# ! !!' $ !! # ! ' !! ! # !# ! ! !! % $# !# % $ ! % ! % ! !
  • 143. ! ,!.%+ !, -, (0' ,- ( 0(+$+, .- 2 ,,(- 0-! '2 '.+ ( %'-, ! ,-+.- ,!.%+ (+ -! #( ' + -$ -! +,)(',%-2 ( ,!.%' -! .,+ *.+, ' - ' ( ,( 2 ,-+.-' -, 0!(% 0(+$ (' -! 0(+$+, ! (.'-(' )+(.+ ( -! %'- ' -! 0(+$+ -!+(. ! -! ,!.%+ , ,!(0' ' -!
  • 144. ( )%'- -! .%- -(%+'- -( +(,- % (+-! 0 ' -( (%%(0 -! (%%(0' ,-), / -! ( '-( '.+ ( ,$,
  • 145. ! -,$ !(%' -($' ,, -! ,(.+ -+- -! -+ (+ ('-(+' 1.-(' - -! -,$ +,)(' 0-!' -.- , %% %+ -! +(,, , %, %+ -! +(,, , .%-2 (/ -! )+(,, -,$ +( +2 ..
  • 146. $ %!#) ) -%'#)! ()*% # (#! $%*)' )$ (*!) ) +$' $ ) ()'*) $%*)# %'$(( , # ) $!!$,# $#*')$# $ ) # , ,!! !)) *( )$ ( ) +$' $ *!) %'$(($' #+'$##) *!) $' %'$(($' #!( )$ %'$' '#) (#)( $ (#! ,$' #( (#! %'$(($' (#)( # ') # -*) . %'$(( !! (#))$# #+*! (#)( + ) %!). )$ ()'*) ) ,$! $ #)$ (!! (!! (#)( , # %'$ #%##)!. )' ,!! #. #)' %##. )# ) !$! (*!' ,!! #!# ) ((*( $ )( %##. # #. ((*( $ !$ $' ()'+)$# #+*! )( ($*! + (( )$ ) %''. $'. # ). ($*! -*)# )' %$')$# $ ,$' * !. $ !)) )( %'$(( , # ) !()
  • 147. $ $' %''. $'. , + ) ()' ) )( # -*) -*)$# ) $' ) '*### ) $ #+*! )( # ## . #'(# ) %). $ ) %'. $'. # $#*'! (*!' )$ !!$) ) '($*' )$ )( (*!' ,!! $!# ) '(%$#(!). $ !!$)# ) '($*' )$ ()'*) )( $ ) #+*! $ $' ) %*'%$( $ !!$)# '($*' )$ )( , # + ) (*!' ! '$'# $%*)# *!' $' , # !($ *( ) -()# *!' %'(#) # ) ' )$ %!#) # )() ) *''#) ,$' # $#)$# $ *!) )$!'# #( , + *( ) -()# (*!' %'(#) # ) ) (*!' (*!' ( %'%)+ (*!' ) !!$)( # #( ) '($*'( ( %' )' %'$'). ' , ' (*!)# ) #)' ,$' # #+'$##) # ) #+'$##) ,) %'$%' $#*')$# )) ( # )$ ') +')*!!. *!)%'$(($' #+'$##) # ()*. ) +$' $ ) ,$! (.()
  • 148. $ (*!) ) -%'#)! ()*% , # )$ '() ') # $#*' )!%$$! , ,!! #! *( )$ (*!) ) *!)%'$((# #+'$##) ' , # + ()'*) (' '($*' )) # +'. %'$(($' # (( $ $' )) , '() ') !$! (*!' # # ) -* (/ $ ) !*()' $' ) ()'*) )( -*)$# !($ # )$ () ) %) $ ) ()'*) $ ( # $# . $!!$,# ) $!!$,# $#*')$# $%)$#
  • 149.
  • 150. ## $#! ( ! #! ## # $#! ( # # ! !$! # # # $# $! !# # # %# # $!# ## # # !#' # '# $#' $!# $ #!$ # # ! # !!# ! #
  • 151. ! % # # $#! (
  • 152. $! $!
  • 153. % #
  • 154. !%! ! ! ' ! $ # ! % ! $ ' ! # ! ' ! % ' !! ! !# # ! % ! ! ! ! % #!
  • 155. $! !! # ! % #
  • 156. !%! ! # !% $! % ! # !# #! ! ! % $ % !# ! ! ! ! ! $!! ! #( ! !# $
  • 157. )' )5)2)/. / ! 2).',% 3!2+ ).3/ ,!2 (% )'41% )' 2(/62 3(% %7%#43)/. 3)-% / 3(% !/5% #!,#4,!3)/. 8 3(% ).$)5)$4!, 01/#%22/1 /1 3(% #,)%.3 ). 3(% 2823%- !2 ! 6(/,% (% %7%#43)/. 3)-% /1 $)5)2)/. 3(% 6(/,% 3!2+ !.$ 3(% !#34!, #!,#4,!3)/. )2 2(/6. ). 3(% %,/6 )'41% ()#( )2 2(/6).' 3(% %%#3 / $)231)43%$ 3!2+ 2#(%$4,).' !.$ 3(% 0%1/1-!.#% %.(!.#%-%.3 8 3(% $)5)2)/. / 3(% 6(/,% 3!2+ ). ! .4-%1 / 24 '1/402 6()#( #!. 14. !.$ %7%#43% !23%1 3(!3 3(% 2823%- ) )3 )2 3!+%. !2 ! 6(/,% )' 7%#43)/. 3)-% / ).$)5)$4!, 01/#%22 ). )231)43%$ */ (!5% 2)-4,!3%$ !,, 3(% 1%24,32 42).' ! ). .3%,: /1% )
  • 158. 9 -!#().% ##/1$).' 3/ 3()2 1%2%!1#( 6/1+ (!5% #1%!3%$ 36%.38 */2 !.$ !22)'.%$ 3(%- 3/ ! ,/#!, 2#(%$4,%1 .#% 3(% 3!2+ (!2 %%. 24-)33%$ 3/ 3(% ,/#!, 2#(%$4,%1 3(% 2#(%$4,%1 6),, % $%#)$).' 6()#( */ 6),, % %7%#43%$ (% */ .%%$2 3/ % 2%,%#3%$ 1/- 3(% 0//, / 36%.38 */2 (% */ 3(!3 )2 2%,%#3%$ 6),, % 0%1/1-).' )32 %7%#43)/. (% 3)-% 3!+%. 8 3(% #,)%.3 3/
  • 159. $ ) ($+! !' $ %% % %)! ! '$ $ # %)% '! ! + ! !(' #$%%$ $ % $! % ) ! % $ # ! $ ) !$%! !' $ %% % $'! ) $%# !$%! !' $ % $! ) $' %'%!+ ) !$%! !' $ %% %# '! %' % '! $%' %)% % $ )$$ $! ! %'$ $! % $# ! $ %$' #$! ) !$%! !' $ )$$% % $'! % !% + (! !$ $ ! $ %' $'#% $ $! % % $'+ $'! ! #+ !! %% !'$$!+ % !$%! + !$%! '%$ %, ! #$%%$ ! $'! %$ ! ! !$ !!
  • 160. + )! ( # ) ! !$ %$' %% ! *' %$ ! !$ % $ (%! ) ! !' $ %% ) ) *' %'$ ) $% $! + ! % % % (! ! ) $ ! *' #$%%$ $ % ( ! %' %% %$ $%'$ $ ' % $ % #$'$ % ( %!% $ *'! !+ % % ! $%#!! $ % # ! %# (! ! ! %' ! %# $ + $! #$%%$ % '+ $$ ) $+ ' (! % $ % % % ! %% %$ $%'$ ) (! ! ! #$%% %' $ '+ $ ) %%' $% #$%%$ ) !+ ! $%#!! ! %# (! ( ! ! ! #$%%$ #% % *'! %' $% ! $ #$%%$ )! !$ ! $ % % # % *'! %' %$+ $ $+ !! $ #$%%$% %% %$' %$ $%'$ '$ %)% ! + !$! % %$+ % $ %'$
  • 161. # '$# ! # $! ## # # $! !# #( ! # ! $! # # $! # ! # $! !# !$( $ # # # # # ( !( $# ! # $#( $# ! $! ! # !! $ # ! # $#( $ # !! # # ! # # !
  • 162. ! ! # ! $ $# !! ( # # # '$# # ( $! # # ( #$$( ! $# ! # # #! # # ! $# $$ # ! $# $ !$ ( # #$ $# ! # # ! % ##! !! ## # ! $# #!#
  • 163.
  • 164.
  • 165. ! ! ! ! # #
  • 166. # # # # # #
  • 167. # #
  • 168. ! ! # ! ! ! # # $ $
  • 169. ( ) !3?*44 ,128.: E ( ' # %' # '#! %#' #%'!E :*6;*,276; 76 -.8.6-*+4. *6- ;.,=:. ,758=260 % .8.5+.: ,7+.: ( ) #73.6 *;;260 =; ,,.;; .17- *6-*:-
  • 170. () 1.6 #7=.0 *6- 0=24.:* D ' ( ', # %) # (% ''#%E #:*6; 758=.:; 74 67 88 *A (
  • 171. ) ' ./*07 ,128.: *6- $:+*6 D#' %% %#' ( '' #%'! +##!, (%),E 758=260 =:.A; 74 67 88
  • 172. .,
  • 173. ( ) ! 3?*44 D '#! %#' ( ' # %' # #%'! %#%! ) ('#E 1 1.;2; ,74. 74A.,1629=..-.:*4. -. *=;*66. *A () ! 3?*44 *6- ,128.: D #!$% '#! %#' #%'! ', '*#%E #.,162,*4 !.87: ! !.87: ,74. 74A.,1629=..C-.C:*4. -. *=;*66. ?2B.:4*6- =4A () ! :2.-5*6 *6- ! *6 !.6.;;. D ## #% ##' ' %#%! # #' %% %#'## E :7, 2@1 A58 201 .:/7:5*6,. 2;:2+=.- 758=260 88
  • 174. =0 () ,128.: *6- #7=.0 D %#! ' !%$ '# %#($ !%$ $%'# # #%E #:*6; .8.6-*+4. *6- .,=:. 758=260 74 67 88 *6 *: () $:+*6 16*A-.:5*6 *6- ,128.: D #!$%# # (% ''#% %#($ !%$ %#%! '(, # '*# '#! %#' #%'!E :7, 64 76/ .8.6-*+4. A;.5; *6- .?7:3; 88
  • 175. =6. ( ) 1*60 *6- *@.5,1=,3 D %#' %#'# # E #:*6; 758=.: A;.5; 74 67 88 =0
  • 176. ( ) *@.5,1=3 *6- 1=: D
  • 177. '%' ( '' ,'! #% ' '# %'E #:*6; 758=.: A;.5; 74 67 88
  • 178.
  • 179. =0
  • 180. % $ 2/6 47+6 +11/'6 2/8. -'6;'1 '3* /'6,+11' ! ! $$! ! $%# $? 6'37 42598+6 78+27 :41 34 55 4: % #.+88+3 438-42+6 '3* '51'3
  • 181. $$ ! * $$ '% $? 64) '-789.1 +2/3'6 43 /786/(98+* 78+27 55
  • 182. % 6/78/'3 /7.6' '3* 1:'6+=
  • 183. $$ ! %*!$!'% $%? /786/(98+* 78+2 3- :41 34 55 93+
  • 184. % 6/78/'3 ! $ ! ! $%%$ $'# $ %# ! *!$!'% %$' *% %? /786/(98+* 42598/3- :41 34 55
  • 185.
  • 186. 56 % '66+' 6+:'14 '3* +63'3*+= ! $ % # ! !$ '$ $% ! $* *!$!'% *% %? 64) 381 25 /786/(98+*42598/3- 55 %
  • 187. '*=/1')47 '3* 49+- + ' $! $%% ! $ %, +).3/)'1 +5468 +58 4, 42598+6 )/+3)+ 463+11 !3/: ' % .'3*6' '3* 49+- !$ '$ $% $ %$' *% %? :41 34 55
  • 188. % .4)01+6 +/*'6 '3* /8+3(+6- $'# '!! #!% #$!%( '*? 42598/3- 96:+7 :41 34 55 +) % .+ 47+1+ +**/ 14278+*8 ?%! $%% ( '!!* )# '# $% $ $!%! ' $!?