The measured network traffic of compiler-parallelized programs

被引:0
作者
Dinda, PA [1 ]
Garcia, BM [1 ]
Leung, KS [1 ]
机构
[1] Northwestern Univ, Evanston, IL 60208 USA
来源
PROCEEDINGS OF THE 2001 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING | 2001年
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Using work-stations on a LAN as a parallel computer is becoming increasingly common. At the same time, parallelizing compilers are making such systems easier to program. Understanding the traffic of compiler-parallelized programs running on networks is vital for network planning and designing quality of service systems. To provide a basis for such understanding, we measured the traffic of six dense-matrix applications written in a dialect of High Performance Fortran, compiled with the Fx parallelizing compiler and run on an Ethernet LAN. The traffic of these programs is profoundly different from typical network traffic. In particular the programs exhibit global collective communication patterns, correlated traffic along many connections, constant burst sizes, and periodic burstiness with bandwidth dependent periodicity. The traffic of these programs can be characterized by the power spectra of their instantaneous average bandwidth.
引用
收藏
页码:175 / 184
页数:10
相关论文
共 20 条
[1]   AN INTEGRATED RUNTIME AND COMPILE-TIME APPROACH FOR PARALLELIZING STRUCTURED AND BLOCK STRUCTURED APPLICATIONS [J].
AGRAWAL, G ;
SUSSMAN, A ;
SALTZ, J .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1995, 6 (07) :747-754
[2]  
[Anonymous], CLUSTER COMPUTING
[3]  
BIAGIONI E, 1993, IEEE NETWORK MAR, P32
[4]  
Braden R., 1997, 2205 RFC
[5]  
DINDA P, 1996, P 1996 ACM SIGM C ME, P47
[6]  
Dutton T. A., 1992, Digital Technical Journal, V4, P66
[7]  
FERNANDEZ JR, 1995, P SUP 95 SAN DIEG DE
[8]   CLIENT REQUIREMENTS FOR REAL-TIME COMMUNICATION SERVICES [J].
FERRARI, D .
IEEE COMMUNICATIONS MAGAZINE, 1990, 28 (11) :65-72
[9]  
FERRARI D, 1994, COMPUTER NETWORKS IS, V26, P1167
[10]  
GARRETT M, 1994, P SIGCOMM 94 LOND SE