Data flow testing in concurrent programs with message passing and shared memory paradigms

被引:8
|
作者
Souza, Paulo S. L. [1 ]
Souza, Simone S. [1 ]
Rocha, Murilo G. [1 ]
Prado, Rafael R. [1 ]
Batista, Raphael N. [1 ]
机构
[1] Univ Sao Paulo, SSC ICMC, PO 668, BR-13566590 Sao Carlos, SP, Brazil
基金
巴西圣保罗研究基金会;
关键词
structural testing criterion; concurrent programs; distributed applications; message passing; shared memory; PARALLEL PROGRAMS;
D O I
10.1016/j.procs.2013.05.178
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper proposes a novel structural test model to capture information about flows of data, control, communication and synchronization of parallel and distributed applications interacting through both message passing and shared memory paradigms. Our main focus is the data flow among threads of different processes, considering the operations of communication and synchronization related to such flow. This inter-process data-flow represents a challenge to the tester, who must consider the heterogeneity of programming paradigms and languages. The information captured by the test model is used by new testing criteria, which improve the testing activity quality. The proposed model and criteria were applied to an object-oriented and distributed application developed in Java. The results suggest that the model and the criteria are able to represent distributed applications developed with message passing and shared memory paradigms. The main contribution of this paper is to present a more flexible test model capable of improving the structural test activity related to the data flow on processes and threads simultaneously.
引用
收藏
页码:149 / 158
页数:10
相关论文
共 50 条
  • [1] Efficient memory management for concurrent programs that use message passing
    Sagonas, Konstantinos
    Wilhelmsson, Jesper
    [J]. SCIENCE OF COMPUTER PROGRAMMING, 2006, 62 (02) : 98 - 121
  • [2] Restructuring and extensible simulator for shared memory and message passing parallel programs
    Ramesh, T.
    Sudhakar, Chaprarn
    [J]. 2006 INTERNATIONAL CONFERENCE ON ADVANCED COMPUTING AND COMMUNICATIONS, VOLS 1 AND 2, 2007, : 1 - 6
  • [3] Critical path profiling of message passing and shared-memory programs
    Hollingsworth, JK
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1998, 9 (10) : 1029 - 1040
  • [4] Critical path profiling of message passing and shared-memory programs
    Univ of Maryland, College Park, United States
    [J]. IEEE Trans Parallel Distrib Syst, 10 (1029-1040):
  • [5] Message analysis for concurrent programs using message passing
    Carlsson, Richard
    Sagonas, Konstantinos
    Wilhelmsson, Jesper
    [J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 2006, 28 (04): : 715 - 746
  • [6] WHERE IS TIME SPENT IN MESSAGE-PASSING AND SHARED-MEMORY PROGRAMS
    CHANDRA, S
    LARUS, JR
    ROGERS, A
    [J]. SIGPLAN NOTICES, 1994, 29 (11): : 61 - 73
  • [7] Structural testing for message-passing concurrent programs: an extended test model
    Souza, Paulo S. L.
    Souza, Simone R. S.
    Zaluska, Ed
    [J]. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2014, 26 (01): : 21 - 50
  • [8] Efficient message passing on shared memory multiprocessors
    [J]. Lect Notes Comput Sci, (221):
  • [9] QR factorization for shared memory and message passing
    Dunn, IN
    Meyer, GGL
    [J]. PARALLEL COMPUTING, 2002, 28 (11) : 1507 - 1530
  • [10] Comparing shared memory and message passing middleware
    Ahuja, SP
    Jha, AK
    [J]. PDPTA '04: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS 1-3, 2004, : 1250 - 1255