EXECUTION TIME MODELING WITH SINGLE NODE GATHER PROBLEM ON TRANSPUTERS

Date

1994-01-01

Author

UNAL, E
GURAN, H

Metadata

Show full item record

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

Item Usage Stats

113
views

0
downloads

A methodology is presented for estimating the total execution time of loosely coupled parallel processing applications. The single node gather problem is considered as the communication primitive. The derived model is verified and illustrated on an image processing application with a network of transputers connected as a ternary tree. The expected execution times obtained by the model are validated experimentally and the model is then used to estimate the performance of the system with larger transputer networks.

Subject Keywords

Electrical and Electronic Engineering

URI

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

Journal

INTERNATIONAL JOURNAL OF ELECTRONICS

DOI

https://doi.org/10.1080/00207219408925901

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

Multipath Characteristics of Frequency Diverse Arrays Over a Ground Plane Cetintepe, Cagri; Demir, Şimşek (Institute of Electrical and Electronics Engineers (IEEE), 2014-07-01) This paper presents a theoretical framework for an analytical investigation of multipath characteristics of frequency diverse arrays (FDAs), a task which is attempted for the first time in the open literature. In particular, transmitted field expressions are formulated for an FDA over a perfectly conducting ground plane first in a general analytical form, and these expressions are later simplified under reasonable assumptions. Developed formulation is then applied to a uniform, linear, continuous-wave opera...
Hierarchical parallelisation strategy for multilevel fast multipole algorithm in computational electromagnetics Ergül, Özgür Salih (Institution of Engineering and Technology (IET), 2008-01-03) A hierarchical parallelisation of the multilevel fast multipole algorithm (MLFMA) for the efficient solution of large-scale problems in computational electromagnetics is presented. The tree structure of MLFMA is distributed among the processors by partitioning both the clusters and the samples of the fields appropriately for each level. The parallelisation efficiency is significantly improved compared to previous approaches, where only the clusters or only the fields are partitioned in a level.
3D object recognition from range images using transform invariant object representation AKAGÜNDÜZ, erdem; Ulusoy, İlkay (Institution of Engineering and Technology (IET), 2010-10-28) 3D object recognition is performed using a scale and orientation invariant feature extraction method and a scale and orientation invariant topological representation. 3D surfaces are represented by sparse, repeatable, informative and semantically meaningful 3D surface structures, which are called multiscale features. These features are extracted with their scale (metric size and resolution) using the classified scale-space of 3D surface curvatures. Triplets of these features are used to represent the surfac...
Neural network method for direction of arrival estimation with uniform cylindrical microstrip patch array Caylar, S.; Dural, G.; Leblebicioğlu, Mehmet Kemal (Institution of Engineering and Technology (IET), 2010-02-01) In this study, a new neural network algorithm is proposed for real-time multiple source tracking problem with cylindrical patch antenna array based on a previously reported Modified Neural Multiple Source Tracking (MN-MUST) algorithm. The proposed algorithm, namely cylindrical microstrip patch array modified neural multiple source tracking (CMN-MUST) algorithm implements MN-MUST algorithm on a cylindrical microstrip patch array structure. CMN-MUST algorithm uses the advantage of directive pattern of microst...
Methodology for performance analysis of randomly-spread CDMA systems over multipath fading channels via crosscorrelation matrix non-asymptotic average eigenvalue densities Ertug, O; Baykal, Buyurman; Unal, BS (Institution of Engineering and Technology (IET), 2003-08-07) A new methodology for closed-form theoretical performance analysis of randomly-spread CDMA systems over multipath fading channels with multiuser receivers is presented. The basis of the analysis is the representation of the random signal to interference ratios at finite system parameters in terms of the eigenvalues of crosscorrelation matrices for which the non-asymptotic average densities are found or known, The methodology presented complements the asymptotic Ruining theory used in similar previous work o...

Citation Formats

E. UNAL and H. GURAN, “EXECUTION TIME MODELING WITH SINGLE NODE GATHER PROBLEM ON TRANSPUTERS,” INTERNATIONAL JOURNAL OF ELECTRONICS, pp. 1–13, 1994, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/65252.