iosr-JCE   Volume-2 ~ Issue-6

Abstract: Edge is the basic characteristic of image, edge detection plays an important role in computer vision and image analysis. The pretty usefull and identical information contained in edge of sub-image enable edge detection to be the main approach to image analysis and recognition. This paper compares and analyzes several kinds of classical algorithms of image edge detection, including Roberts, Sobel, Prewitt, LOG and Canny with MATLAB tool.
Keywords – Canny, LOG, Prewitt, Roberts, Sobel

Journal Papers:
[1] L.P. Han and W.B. Yin. An Effective Adaptive Filter Scale Adjustment Edge Detection Method(China, Tsinghua university, 1997).
[2] D. Marr and E. Hildreth, Theory of Edge Detection(London, 1980).
[3] Q.H Zhang, S Gao, and T.D Bui, Edge detection models, Lecture Notes in Computer Science, 32(4), 2005, 133-140.
[4] D.H Lim, Robust Edge Detection In Noisy Images, Computational Statistics & Data Analysis, 96(3), 2006, 803-812.
[5] Abbasi TA, Abbasi MU, A novel FPGA-based architecture for Sobel edge detection operator, International Journal of Electronics, 13(9), 2007, 889-896.
[6] Canny John, A Computational Approach to Edge Detection, IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-8(6), 1986, 679-6987
[7] X.L Xu, Application of Matlab In Digital Image Processing, Modern Computer, 43(5), 2008, 35-37.
[8] Y.Q Lv and G.Y Zeng , Detection Algorithm of Picture Edge, TAIYUANSCIENCE & TECHNOLOGY, 27(2), 2009, 34-35
[9] D.F Zhang, MATLAB Digital Image Processing(Beijing, Mechanical Industry, 2009)

Abstract : In statically-typed object-oriented languages optimization plays an important role to make program compilation faster. A number of methods have been used, and a variety of algorithms have been suggested and designed for optimization of statically typed object-oriented languages like C++ and Java. One of the important considerations inoptimization of statically typed object-oriented language is function de-virtualization. Function de-virtualization converts virtual function calls to direct calls, i.e. a virtual function call is replaced by a call to the method of some class. The direct calls can be further inlined to enhance the performance. Class hierarchy Analysis (CHA) [3] is the well-known technique used to identify the virtual calls in a program that can be converted into direct calls. The class hierarchy Analysis starts with a building a Class Hierarchy Graph (CHG) that represents the relation between the various classes of program and the visible methods within these classes. In fact the most basic data structure for developing optimization algorithms is the CHG, which abstracts the Base-derived class relationship that use virtual functions.
A number of algorithms have been designed for constructingClass Hierarchy Graph (CHG) like the one designed by Bacon, D.F[1]that uses the source level information to build CHG. Several alternatives have been presented to this approach as well. In this article we will present the method for construction of CHG by reusing the RTTI (RuntimeType Identification) generated by the complier.

[1]. David F. Bacon and Peter F. Sweeney "Fast and Static Analysis of C++ Virtual Function Calls",object oriented programming systems, languages, and applications (OOPSLA) 1996. [2]. UrsHolzle and GerladAigner "Eliminating Virtual Function Calls in C++ Programs"Conference Proceedings, Springer Verlag LNCS 1098, pp. 142-166 ECOOP 1996. [3]. Grove, Chambers. And Dean, J., D. "Optimization of Object-Oriented Programs Using Static Class Hierarchy Analysis" Tech Report, Dept. of CSE, University of Washington, 1994.
[4]. David Bernstein, YaroslavFedorov, Sara Porat, Joseph Rodrigue, and EranYahav.Compiler Optimization of C++ Virtual Function Calls. 2nd Conference on Object-Oriented Technologies and Systems, Toronto, Canada, June 1996. [5]. David F. Bacon, [Fast and Effective Optimization of Statically Typed Object-Oriented Languages] Ph.D. Thesis, University of California Berkeley, 1997. [6]. Wu, P.-C. And Wang, F.-J. 1996. On efficiency and optimization of C++ programs. Softw. Pract. Exper., 26, 4 (Apr.), 453{465. [7]. Porat, S., Bernstein, D., Fedorov, Y., Rodrigue, J., and Yahav, E. 1996. [Compiler optimizations of C++ virtual function calls]. In Proceedings of the Second Conference on Object-Oriented Technologies and Systems, (Toronto, Canada, June). Usenix Association, pp. 3{14.
[8]. Bacon, D. F., Graham, S. L., and Sharp, O. J. 1994. Compiler transformations for high-performance computing. ACM Comput. Surv., 26, 4 (Dec.), 345{420.
[9]. Pande, H. D. and Ryder, B. G. 1995. Static type determination and aliasing for C++. Tech. Rep. LCSR-TR-250, Dept. of Computer Science, Rutgers University, (July).
[10]. Pande, H. D. and Ryder, B. G. 1996. Data-flow-based virtual function resolution. In Proceedings of the Third International Static Analysis Symposium, volume 1145 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Germany, pp. 238{254.
[11]. Nackman, L. R. and Barton, J. J. 1994. Base-Class Composition with Multiple Derivation and Virtual Bases. In Proceedings of the 1994 USENIX C++ Conference, (Cambridge, Mass., Apr.). Usenix Association, Berkeley, Calif., pp. 57{71.
[12]. Calder, B. and Grunwald, D. 1994. Reducing indirect function call overhead in C++ pro-grams. In Conference Record of the Twenty-First ACM Symposium on Principles of Programming Languages, (Portland, Ore., Jan.). ACM Press, New York, N.Y., pp. 397{408.
[13]. Dean, J., Grove, D., and Chambers, C. 1995. [Optimization of object-oriented programs using static class hierarchy analysis]. In Olthoff, W., Ed., Proceedings of the Ninth European Conference on Object-Oriented Programming { ECOOP'95, volume 952 of Lecture Notes in Computer Science, (Aarhus, Denmark, Aug.). Springer-Verlag, Berlin, Germany, pp. 77{101.
[14]. Ellis, M. and Stroustroup, B. 1990. [The Annotated C++ Reference Manual]. Addison-Wesley, Reading, Mass.

Abstrac: The proposed system has addressed issues that are imperative to Grid computing environments by introducing job migration algorithms. The proposed algorithms differ within the manner load balancing is disbursed and is shown to be cost effective in minimizing the response time on Grid environments. The algorithm is enhanced for large-scale systems to take into account the job migration value, resource heterogeneity, and network heterogeneity when load balancing is considered. The algorithm is applicable to small-scale systems, performs load balancing by estimating the expected end time of employment on individual processors on every job arrival to estimate system parameters like the job arrival rate, processing rate, and load on the processor and balance the load by migrating jobs to individual processors by considering job transfer value, resource heterogeneity, and network heterogeneity.
Keywords-component; Grid Computing, Load balancing, Inter arrival time, processing elements

[1] Nadia Ranaldo, Giancarlo Tretola, and Eugenio Zimeo ―A Scheduler for a Multi-paradigm Grid Environment‖ INRIA Sophia-Antipolis - Universit´ de Nice - CNRS/I3Se 2004, Route des Lucioles, BP 93 FR-06902 Sophia Antipolis, France
[2] Mrs. Sharada Patil, Prof. Dr. Arpita Gopal ―Comparison of Cluster Scheduling Mechanism using Workload and System Parameters‖ International Journal of Computer Science and Application ISSN: 0974-0767
[3] Malarvizhi Nandagopal Rhymend V Uthariaraj and ―Hierarchical Status Information Exchange Scheduling and Load Balancing For Computational Grid Environments Balancing For Computational Grid Environments‖ IJCSNS International Journal of Computer Science and Network Security, VOL.10 No.2, February 2010
[4] Fangpeng Dong and Selim G. Ak ―Scheduling Algorithms for Grid Computing: State of the Art and Open Problems‖ International Conference on e-Science and Grid Computing
[4] Malarvizhi Nandagopal, Rhymend V. Uthariaraj ―Hierarchical Load Balancing Approach in Computational Grid Environment‖ International J. of Recent Trends in Engineering and Technology, Vol. 3, No. 1, May 2010
[5] P.Neelakantan ―DECENTRALIZED LOAD BALANCING IN HETEROGENEOUS SYSTEMS USING DIFFUSION APPROACH‖ International Journal of Distributed and Parallel Systems (IJDPS) Vol.3, No.1, January 2012
[6] Hongzhang Shan, Leonid Oliker, Warren Smith, Rupak Biswas ―Scheduling in Heterogeneous Grid Environments: The Effects of Data Migration‖ International Conference on Advanced Computing and Communication, Ahmedabad
[7] Satish Penmatsa, Anthony T. Chronopoulos ―Comparison of Price-based Static and Dynamic Job Allocation Schemes for Grid Computing Systems‖ 2009 Eighth IEEE International Symposium on Network Computing and Applications
[8] Jeremy K. Chen Theodore S. Rappaport Gustavo de Veciana ―Iterative Water-filling for Load-balancing in Wireless LAN or Microcellular Networks‖ Vehicular Technology Conference, 2006. VTC 2006-Spring. IEEE 63rd, Volume: 1 Page(s): 117 - 121
[9] Giuseppe Di Fatta , Michael R. Berthold ―Decentralized Load Balancing for Highly Irregular Search Problems‖ Microprocessors & Microsystems,Volume31Issue4,June,2007 Pages 273-281
[10] Lorenzo Muttoni, Giuliano Casale, Federico Granata, Stefano Zanero ―Optimal number of nodes for computation in grid environments‖ Dipt. di Elettronica ed Informazione, Politecnico di Milano, Italy Page(s): 282 – 289, 11-13 Feb. 2004