An analytical model for source code distributability verification

Date

2014-02-01

Author

Isazadeh, Ayaz
Karimpour, Jaber
Elgedawy, Islam
Izadkhah, Habib

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

169
views

0
downloads

One way to speed up the execution of sequential programs is to divide them into concurrent segments and execute such segments in a parallel manner over a distributed computing environment. We argue that the execution speedup primarily depends on the concurrency degree between the identified segments as well as communication overhead between the segments. To guarantee the best speedup, we have to obtain the maximum possible concurrency degree between the identified segments, taking communication overhead into consideration. Existing code distributor and multi-threading approaches do not fulfill such requirements; hence, they cannot provide expected distributability gains in advance. To overcome such limitations, we propose a novel approach for verifying the distributability of sequential object-oriented programs. The proposed approach enables users to see the maximum speedup gains before the actual distributability implementations, as it computes an objective function which is used to measure different distribution values from the same program, taking into consideration both remote and sequential calls. Experimental results showed that the proposed approach successfully determines the distributability of different real-life software applications compared with their real-life sequential and distributed implementations.

Subject Keywords

General Engineering

URI

https://hdl.handle.net/11511/67698

Journal

JOURNAL OF ZHEJIANG UNIVERSITY-SCIENCE C-COMPUTERS & ELECTRONICS

DOI

https://doi.org/10.1631/jzus.c1300066

Collections

Department of Computer Engineering, Article

Suggestions

OpenMETU
Core

Optimization of well placement in complex carbonate reservoirs using artifical intelligence Uraz, İrtek; Akın, Serhat; Department of Petroleum and Natural Gas Engineering (2004) This thesis proposes a framework for determining the optimum location of an injection well by using an inference method, Artificial Neural Networks and a search algorithm to create a search space and locate the global maxima. Theoretical foundation of the proposed framework is followed by description of the field for case study. A complex carbonate reservoir, having a recorded geothermal production history is used to evaluate the proposed framework ( Kizildere Geothermal field, Turkey). In the proposed fram...
A computational procedure for estimating residual stresses and secondary plastic flow limits in nonlinearly strain hardening rotating shafts Eraslan, Ahmet Nedim (Springer Science and Business Media LLC, 2005-03-01) A computational procedure to estimate the residual stress distributions and the limit angular speeds for avoiding secondary plastic deformation in nonlinearly strain hardening rotating elastic-plastic shafts is given. The model is based on von Mises yield condition, J(2) deformation theory and a Swift-type hardening law. The boundary value problem for the governing nonlinear differential equation is solved by a shooting method using Newton iterations with numerically approximated tangent. Solid as well as h...
A robust bi-objective mathematical model for disaster rescue units allocation and scheduling with learning effect Tirkolaee, Erfan Babaee; Aydin, Nadi Serhan; Ranjbar-Bourani, Mehdi; Weber, Gerhard Wilhelm (Elsevier BV, 2020-11-01) This paper proposes a novel bi-objective mixed-integer linear programming (MILP) model for allocating and scheduling disaster rescue units considering the learning effect. When a natural phenomenon (e.g., earthquake or flood) occurs, the presented decision support model is expected to help decision-makers of emergency relief centers to provide efficient planning for rescue units to minimize the total weighted completion time of rescue operations, as well as the total delay in rescue operations. The problem ...
A unifying grid approach for solving potential flows applicable to structured and unstructured grid configurations Cete, A. Ruhsen; Yuekselen, M. Adil; Kaynak, Uenver (Elsevier BV, 2008-01-01) In this study, an efficient numerical method is proposed for unifying the structured and unstructured grid approaches for solving the potential flows. The new method, named as the "alternating cell directions implicit - ACDI", solves for the structured and unstructured grid configurations equally well. The new method in effect applies a line implicit method similar to the Line Gauss Seidel scheme for complex unstructured grids including mixed type quadrilateral and triangle cells. To this end, designated al...
A Hierarchical Partitioning Strategy for an Efficient Parallelization of the Multilevel Fast Multipole Algorithm Ergül, Özgür Salih (Institute of Electrical and Electronics Engineers (IEEE), 2009-06-01) We present a novel hierarchical partitioning strategy for the efficient parallelization of the multilevel fast multipole algorithm (MLFMA) on distributed-memory architectures to solve large-scale problems in electromagnetics. Unlike previous parallelization techniques, the tree structure of MLFMA is distributed among processors by partitioning both clusters and samples of fields at each level. Due to the improved load-balancing, the hierarchical strategy offers a higher parallelization efficiency than previ...

Citation Formats

A. Isazadeh, J. Karimpour, I. Elgedawy, and H. Izadkhah, “An analytical model for source code distributability verification,” JOURNAL OF ZHEJIANG UNIVERSITY-SCIENCE C-COMPUTERS & ELECTRONICS, pp. 126–138, 2014, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/67698.