Probabilistic Approach to Scheduling Divisible Load on Network of Processors

Manar Arafat, Sameer Bataineh, Issa Khalil
2015 International Journal of Sensor Networks and Data Communications  
The time it takes the i th node to process the entire load when w i =1. The entire load can be processed on the i th processor in time w i T cp . T cm : The time it takes to transmit the entire load over a link when z i =1. The entire load can be transmitted over the i th link in time z i T cm . T ij: Time to finish processing α ij . Pj (t ): The probability of finding processor j is willing to contribute its whole computing power at time t during α ij w j T cp , where (i=1...N) and (j=1...M).
more » ... .N) and (j=1...M). c ij T : The time it takes to send α ij . p ij T : The time it takes to process α ij . T finish: The minimum expected finish time for the total load. C i : The equivalent communication power for site i, (i=1,2, ... N ). C T : The total communication power in the system.
doi:10.4172/2090-4886.1000130 fatcat:opvccsxe35chlfimfdnmhzr36u