Task Decomposition for Communication Computation Overlap to Reengineer a Web-Based System

Overcoming Web code defects, such as nested loops, large multimedia packages, and mixed programming languages by decomposing and then composing program into a set of reusable segments can benefit Web-based system reengineering. However, existing methods seldom meet the needs for correct, reliable, and economical program reengineering process. In this paper, program slicing and program transformations within maintainer's assistant software evolution environment are depicted to decompose and transform Web page source code of a Web-based system, with the purpose for communication and computation overlap. The result presents kinds of overlapped code after decomposition and reengineering achieves a relatively speedy quality when being explored

[1]  Thomas W. Reps,et al.  Integrating noninterfering versions of programs , 1989, TOPL.

[2]  Denis Caromel,et al.  Overlapping Communication with Computation in Distributed Object Systems , 1999, HPCN Europe.

[3]  David W. Binkley,et al.  Program integration for languages with procedure calls , 1995, TSEM.

[4]  Mark Weiser,et al.  Programmers use slices when debugging , 1982, CACM.

[5]  Scott B. Baden,et al.  Overlapping communication and computation with OpenMP and MPI , 2001, Sci. Program..

[6]  James M. Bieman,et al.  Measuring Functional Cohesion , 1994, IEEE Trans. Software Eng..

[7]  Hussein Zedan,et al.  Conditioned semantic slicing via abstraction and refinement in FermaT , 2005, Ninth European Conference on Software Maintenance and Reengineering.

[8]  Suraj C. Kothari,et al.  Program Slice Browser , 2001, Proceedings 9th International Workshop on Program Comprehension. IWPC 2001.

[9]  Frank Tip,et al.  A survey of program slicing techniques , 1994, J. Program. Lang..

[10]  Martin P. Ward.  Program slicing via FermaT transformations , 2002, Proceedings 26th Annual International Computer Software and Applications.

[11]  Aniello Cimitile,et al.  A Specification Driven Slicing Process for Identifying Reusable Functions , 1996, J. Softw. Maintenance Res. Pract..

[12]  Francisco Tirado,et al.  Data Locality Exploitation in the Decomposition of Regular Domain Problems , 2000, IEEE Trans. Parallel Distributed Syst..

[13]  Martin P. Ward.  The formal transformation approach to source code analysis and manipulation , 2001, Proceedings First IEEE International Workshop on Source Code Analysis and Manipulation.

[14]  Giuseppe Visaggio,et al.  Extracting Reusable Funtions by Flow Graph-Based Program Slicing , 1997, IEEE Trans. Software Eng..

[15]  Larry Carter,et al.  On the interference of communication on computation in Java , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[16]  Thomas W. Reps,et al.  Integrating non-intering versions of programs , 1988, POPL '88.

[17]  David Eichmann,et al.  Program and interface slicing for reverse engineering , 1993, [1993] Proceedings Working Conference on Reverse Engineering.

[18]  Jian Kang,et al.  UML Modelling Web Applications via Formal Concept Analysis , 2006, SEKE.

[19]  Hongji Yang,et al.  Successful Evolution of Software Systems , 2002 .

[20]  Philip J. Hatcher,et al.  On the Utility of Communication-Computation Overlap in Data-Parallel Programs , 1996, J. Parallel Distributed Comput..

[21]  D. Martin Swany,et al.  Transformations to Parallel Codes for Communication-Computation Overlap , 2005, ACM/IEEE SC 2005 Conference (SC'05).

[22]  Mitsuhisa Sato,et al.  Identifying the capability of overlapping computation with communication , 1996, Proceedings of the 1996 Conference on Parallel Architectures and Compilation Technique.

[23]  David W. Binkley,et al.  Program slicing , 2008, 2008 Frontiers of Software Maintenance.