Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014 (2014), Article ID 839121, 13 pages
http://dx.doi.org/10.1155/2014/839121
Research Article

Frequent Statement and Dereference Elimination for Imperative and Object-Oriented Distributed Programs

1College of Computer and Information Sciences, Al Imam Mohammad Ibn Saud Islamic University (IMSIU), Riyadh 11432, Saudi Arabia
2Department of Mathematics, Faculty of Science, Cairo University, Giza 12613, Egypt

Received 18 August 2013; Accepted 21 September 2013; Published 27 April 2014

Academic Editors: P. Bala and S. Choi

Copyright © 2014 Mohamed A. El-Zawawy. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. S. S. Barpanda and D. P. Mohapatra, “Dynamic slicing of distributed object-oriented programs,” IET Software, vol. 5, no. 5, pp. 425–433, 2011. View at Publisher · View at Google Scholar · View at Scopus
  2. C. Seragiotto Jr. and T. Fahringer, “Performance analysis for distributed and parallel Java programs with Aksum,” in Proceedings of the IEEE International Symposium on Cluster Computing and the Grid (CCGrid '05), IEEE Computer Society, pp. 1024–1031, May 2005. View at Publisher · View at Google Scholar · View at Scopus
  3. H.-L. Truong and T. Fahringer, “Soft computing approach to performance analysis of parallel and distributed programs,” in Proceedings of the 11th International Euro-Par Conference (Euro-Par '05), J. C. Cunha and D. Pedro, Eds., vol. 3648 of Lecture Notes in Computer Science,, pp. 50–60, September 2005. View at Scopus
  4. M. A. El-Zawawy, “Probabilistic pointer analysis for multithreaded programs,” ScienceAsia, vol. 37, no. 4, pp. 344–354, 2011. View at Publisher · View at Google Scholar · View at Scopus
  5. M. A. El-Zawawy, “Detection of probabilistic dangling references in multi-core programs using proof-supported tools,” in Proceedings of the International conference on Computational Science and Its Applications (ICCSA '13), B. Murgante, S. Misra, M. Carlini et al., Eds., vol. 7975 of Lecture Notes in Computer Science, pp. 516–530, Springer, 2013.
  6. M. A. El-Zawawy, “Frequent statement and de-reference elimination for distributed programs,” in Proceedings of the International conference on Computational Science and Its Applications (ICCSA '13), B. Murgante, S. Misra, M. Carlini et al., Eds., vol. 7973 of Lecture Notes in Computer Science, pp. 82–97, Springer, 2013.
  7. M. A. El-Zawawy, “Abstraction analysis and certified flow and context sensitive points-to relation for distributed programs,” in Proceedings of the International conference on Computational Science and Its Applications (ICCSA '12), B. Murgante, O. Gervasi, S. Misra et al., Eds., vol. 7336 of Lecture Notes in Computer Science, pp. 83–99, 2012.
  8. H. Ho, V. Szwarc, and T. Kwasniewski, “Low complexity reconfigurable DSP circuit implementations based on common sub-expression elimination,” Journal of Signal Processing Systems, vol. 61, no. 3, pp. 353–365, 2010. View at Publisher · View at Google Scholar · View at Scopus
  9. S. Gopalakrishnan and P. Kalla, “Algebraic techniques to enhance common sub-expression elimination for polynomial system synthesis,” in Proceedings of the Design, Automation and Test in Europe Conference and Exhibition (DATE '09), pp. 1452–1457, April 2009. View at Scopus
  10. A. Saabas and T. Uustalu, “Program and proof optimizations with type systems,” Journal of Logic and Algebraic Programming, vol. 77, no. 1-2, pp. 131–154, 2008. View at Publisher · View at Google Scholar · View at Scopus
  11. A. Nicolau, S. Gupta, M. Reshadi, N. Savoiu, N. Dutt, and R. Gupta, “Dynamic common sub-expression elimination during scheduling in high-level synthesis,” in Proceedings of the 15th International Symposium on System Synthesis, IEEE Computer Society, pp. 261–266, October 2002. View at Scopus
  12. A. Hosangadi, F. Fallah, and R. Kastner, “Optimizing polynomial expressions by algebraic factorization and common subexpression elimination,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 25, no. 10, pp. 2012–2021, 2006. View at Publisher · View at Google Scholar · View at Scopus
  13. P. Maragathavalli and S. Kanmani, “Evolutionary multi-objective optimization for data-flow testing of object-oriented programs,” in Proceedings of the International Conference on Advances in Computing and Information Technology (ACITY '12), N. Meghanathan, D. Nagamalai, and N. Chaki, Eds., vol. 177 of Advances in Intelligent Systems and Computing, pp. 263–271, Springer, 2012.
  14. K. Heffner, D. Tarditi, and M. D. Smith, “Extending object-oriented optimizations for concurrent programs,” in Proceedings of the 16th International Conference on Parallel Architecture and Compilation Techniques (PACT '07), IEEE Computer Society, pp. 119–129, September 2007. View at Publisher · View at Google Scholar · View at Scopus
  15. S. Kumar and D. P. Agrawal, “A concurrency abstraction model for avoiding inheritance anomaly in object-oriented programs,” in Compiler Optimizations for Scalable Parallel Systems Languages, S. Pande and D. P. Agrawal, Eds., vol. 1808 of Lecture Notes in Computer Science, pp. 109–140, Springer, 2001. View at Google Scholar
  16. M. A. El-Zawawy, “Dead code elimination based pointer analysis for multithreaded programs,” Journal of the Egyptian Mathematical Society, vol. 20, no. 1, pp. 28–37, 2012. View at Google Scholar
  17. M. A. El-Zawawy, “Heap slicing using type systems,” in Proceedings of the International conference on Computational Science and Its Applications (ICCSA '12), B. Murgante, O. Gervasi, S. Misra et al., Eds., vol. 7335 of Lecture Notes in Computer Science, pp. 592–606, Springer, 2012.
  18. A. Kamil and K. Yelick, “Hierarchical pointer analysis for distributed programs,” Proceedings of the 14th International Static Analysis Symposium (SAS '07), vol. 4634, pp. 281–297, 2007. View at Google Scholar · View at Scopus
  19. B. Liblit and A. Aiken, “Type systems for distributed data structures,” in Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles og Programming Languages (POPL '00), pp. 199–213, January 2000. View at Scopus
  20. B. Liblit, A. Aiken, and K. A. Yelick, “Type systems for distributed data sharing,” in Proceedings of the International Static Analysis Symposium (SAS '03), R. Cousot, Ed., vol. 2694 of Lecture Notes in Computer Science, pp. 273–294, Springer, 2003.
  21. P. Lindberg, J. Leingang, D. Lysaker, S. U. Khan, and J. Li, “Comparison and analysis of eight scheduling heuristics for the optimization of energy consumption and makespan in large-scale distributed systems,” Journal of Supercomputing, vol. 59, no. 1, pp. 323–360, 2012. View at Google Scholar · View at Scopus
  22. S. Simmons, D. Edwards, and P. Kearns, “Communication analysis of distributed programs,” Scientific Programming, vol. 14, no. 2, pp. 151–170, 2006. View at Google Scholar · View at Scopus
  23. Y.-C. Chiu, C.-K. Shieh, T.-C. Huang, T.-Y. Liang, and K.-C. Chu, “Data race avoidance and replay scheme for developing and debugging parallel programs on distributed shared memory systems,” Parallel Computing, vol. 37, no. 1, pp. 11–25, 2011. View at Publisher · View at Google Scholar · View at Scopus
  24. V. V. Toporkov, “Dataflow analysis of distributed programs using generalized marked nets,” in Proceedings of the International Conference on Dependability of Computer Systems (DepCoS- RELCOMEX '07), pp. 73–80, June 2007. View at Publisher · View at Google Scholar · View at Scopus