Skip to main content
EURASIP Journal on Wireless Communications and Networking
Fig. 9 | EURASIP Journal on Wireless Communications and Networking

Fig. 9

From: An integrated scheduling algorithm for multi-device-processes with the strategy of exchanging adjacent parallel processes of the same device

Fig. 9

Process tree of product P: Product P is shown in figure, where each processing node represents one processing procedure, which can be divided into common procedure and multi-device procedure. For example, P1/M1/10 means that the procedure is named P1 and processed on device M1, which is a common procedure with a processing duration of 10; P2 / M1M2 /20, which means that the process name is P2, and it is a multi-device process, which needs to be processed on device M1 and M2 at the same time, and the processing time is 20

Back to article page