IMPROVING SCHEDULING OF COMMUNICATION INTENSIVE PARALLEL APPLICATIONS ON HETEROGENEOUS COMPUTING ENVIRONMENTS

2005 ◽  
Vol 15 (04) ◽  
pp. 423-438
Author(s):  
RENATO P. ISHII ◽  
RODRIGO F. DE MELLO ◽  
LUCIANO J. SENGER ◽  
MARCOS J. SANTANA ◽  
REGINA H. C. SANTANA ◽  
...  

This paper presents a new model for the evaluation of the impacts of processing operations resulting from the communication among processes. This model quantifies the traffic volume imposed on the communication network by means of the latency parameters and the overhead. Such parameters represent the load that each process imposes over the network and the delay on CPU, as a consequence of the network operations. This delay is represented on the model by means of metric measurements slowdown. The equations that quantify the costs involved in the processing operation and message exchange are defined. In the same way, equations to determine the maximum network bandwidth are used in the decision-making scheduling. The proposed model uses a constant that delimitates the communication network maximum allowed usage, this constant defines two possible scheduling techniques: group scheduling or through communication network. Such techniques are incorporated to the DPWP policy, generating an extension of this policy. Experimental and simulation results confirm the performance enhancement of parallel applications under supervision of the extended DPWP policy, compared to the executions supervised by the original DPWP.

2018 ◽  
Vol 19 (1) ◽  
Author(s):  
Shakuntala Baichoo ◽  
Yassine Souilmi ◽  
Sumir Panji ◽  
Gerrit Botha ◽  
Ayton Meintjes ◽  
...  

2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Li Sun ◽  
Lei Ning ◽  
Jia-zhen Huo

In this paper, we introduce a group scheduling model with time-dependent and position-dependent DeJong’s learning effect. The objectives of scheduling problems are to minimize makespan, the total completion time, and the total weighted completion time, respectively. We show that the problems remain solvable in polynomial time under the proposed model.


2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Bo Hu ◽  
Xin Liu ◽  
Jinghong Zhao ◽  
Siya Xu ◽  
Zhenjiang Lei ◽  
...  

With the development of the energy Internet, power communication services are heterogeneous, and different power communication services have different business priorities. The power communication services with different priorities have different requirements for network bandwidth and real-time performance. For traditional unified service, a scheduling method cannot meet these service requirements at the same time, and electric power communication network cannot guarantee the quality of service. Therefore, how to make full use of the time-varying characteristics of communication resources to meet the business needs of different priorities and achieve the goals of high resource utilization and transmission quality has become one of the urgent problems in the power communication network. For this reason, in order to adapt to the real-time congestion of the network, we have designed a packet scheduling method based on the dynamic adjustment of service priority, which dynamically adjusts the priority of the power service on the node; in addition, an evaluation method for the trust value of wireless forwarding nodes is introduced to improve the security of data transmission; and finally, we valuate the channel quality to establish a reasonable and efficient packet scheduling mechanism for services of different priorities. Simulation results show that this method improves the communication performance of high-priority services and improves the spectrum resource utilization of the entire system.


1996 ◽  
Vol 4 (2-3) ◽  
pp. 97-117 ◽  
Author(s):  
R. Aversa ◽  
N. Mazzocca ◽  
U. Villano

Sign in / Sign up

Export Citation Format

Share Document