Availability of a distributed computer system with failures
Acta Informatica
Assignment problems in parallel and distributed computing
Assignment problems in parallel and distributed computing
Distributed algorithms for load balancing in very large homogeneous systems
ACM '87 Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow
Heuristic Algorithms for Task Assignment in Distributed Systems
IEEE Transactions on Computers
GAMMON: A Load Balancing Strategy for Local Computer Systems with Multiaccess Networks
IEEE Transactions on Computers
Distributed Scheduling of Tasks with Deadlines and Resource Requirements
IEEE Transactions on Computers
Load Sharing in Distributed Real-Time Systems with State-Change Broadcasts
IEEE Transactions on Computers
Analysis of the Effects of Delays on Load Sharing
IEEE Transactions on Computers
Analysis of a graph coloring based distributed load balancing algorithm
Journal of Parallel and Distributed Computing
Effect of Fault Tolerance on Response Time-Analysis of the Primary Site Approach
IEEE Transactions on Computers
On the Optimum Checkpoint Interval
Journal of the ACM (JACM)
Performance of rollback recovery systems under intermittent failures
Communications of the ACM
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
IEEE Transactions on Software Engineering
Optimal Load Balancing in a Multiple Processor System with Many Job Classes
IEEE Transactions on Software Engineering
Journal of Parallel and Distributed Computing
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.24 |
The effect of interprocessor communication and fault tolerance on the response time of N processors (nodes) interconnected through a bus type communication medium is discussed. Deterministic as well as probabilistic approaches are considered. Four correction methods to handle the unprocessed data by the faulty processor(s) are studied and compared. It is found that the effect of interprocessor communication and fault tolerance on the response time for communication-extensive programs (I/O bound) is more than that for computation-extensive programs (CPU bound). It is also found that the effect of fault tolerance on the response time is significant, and cannot be ignored when evaluating the performance of multiprocessor systems. We have shown that the work presented in this paper for a bus topology can be generalized and readily adopted by other multiprocessor network topologies.