Scheduling divisible loads in non-blocking mode of communication: optimal sequencing and arrangement in a single-level tree network
Student Conference on Research and Development - Trang 464-467
Tóm tắt
For the first time, the problem of scheduling divisible loads in a single-level tree network in the non-blocking mode of communication is considered. All earlier studies in divisible load scheduling have considered the blocking mode of communication. A closed-form expression for the processing time in non-blocking mode of communication is derived. Using this closed-form expression, this paper analytically proves a number of significant results on load sequencing and processor-link arrangement in a single-level tree network.
Từ khóa
#Processor scheduling #Closed-form solution #Intelligent networks #Optimal control #Communication system control #Instruments #Coprocessors #Delay #Computer networksTài liệu tham khảo
10.1109/7.106129
10.1109/7.18637
10.1109/7.272269
10.1109/7.259524
kim, 2002, A novel optimal load distribution algorithm for divisible loads, To appear in Special Issue of Cluster Computing Summer/Fall
10.1109/21.120070
10.1109/71.308534
10.1109/7.481247
bharadwaj, 1996, Scheduling Divisible Loads in Parallel and Distributed Systems
kim, 1996, Optimal load distribution for tree network processors, IEEE Transactions on Aerospace and Electronic Systems, 32, 607, 10.1109/7.489505
0