Search Results - (( parallel distribution max algorithm ) OR ( parallel evaluation method algorithm ))

Refine Results
  1. 1

    Parallel Execution of Runge-Kutta Methods for Solving Ordinary Differential Equations by Siri, Zailan

    Published 2004
    “…The method used here is actually have been tailored made for the purpose of parallel machine where the subsequent functions evaluations do not depend on the previous function evaluations. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Parallel algorithms for numerical simulations of EHD ion-drag micropump on distributed parallel computing systems by Shakeel Ahmed, Kamboh

    Published 2014
    “…To implement the parallel algorithms a distributed parallel computing laboratory using easily available low cost computers is setup. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Enhancing performance of XTS cryptography mode of operation using parallel design by Ahmed Alomari, Mohammad

    Published 2009
    “…In addition, the parallel XTS mode was also simulated using Twofish and RC6 encryption algorithms. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Parallel execution of diagonally implicit Runge-Kutta methods for solving IVPs. by Ismail, Fudziah, Siri, Zailan, Othman, Mohamad, Suleiman, Mohamed

    Published 2009
    “…Diagonally Implicit Runge-Kutta (DIRK) methods are amongst the most useful and cost-effective methods for solving initial value problems but the dependency of the functions evaluations on the previous functions evaluations makes DIRK method not so favourable for parallel computers. …”
    Get full text
    Get full text
    Article
  5. 5

    Communication and computational cost on parallel algorithm of PDE elliptic type by Alias, Norma

    Published 2009
    “…Due to this needs, this paper presents the parallel performance evaluations of algorithms that will be discussed in term of communication and computational cost.…”
    Get full text
    Get full text
    Book Section
  6. 6
  7. 7

    Analysis of evolutionary computing performance via mapreduce parallel processing architecture / Ahmad Firdaus Ahmad Fadzil by Ahmad, Ahmad Firdaus

    Published 2014
    “…MR is an emerging parallel processing framework that hides the complex parallelization processes by employing the functional abstraction of "map and reduce" The Performance of the parallelized GA via MR and PSO via MR are evaluated using an analogous case study to find out the speedup and efficiency in order to measure the scalability of both proposed algorithms. …”
    Get full text
    Get full text
    Thesis
  8. 8
  9. 9

    The Parallel Fuzzy C-Median Clustering Algorithm Using Spark for the Big Data by Mallik, Moksud Alam, Zulkurnain, Nurul Fariza, Siddiqui, Sumrana, Sarkar, Rashel

    Published 2024
    “…Therefore, we develop a Parallel Fuzzy C-Median Clustering Algorithm Using Spark for Big Data that can handle large datasets while maintaining high accuracy and scalability. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    Sequential and parallel multiple tabu search algorithm for multiobjective urban transit scheduling problems by Uvaraja, Vikneswary

    Published 2018
    “…Additionally, the MTS algorithm is also implemented in parallel computing to produce parallel MTS for generating comparable solutions in shorter computational times. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Improving parallel self-organizing map using heterogeneous uniform memory access / Muhammad Firdaus Mustapha by Mustapha, Muhammad Firdaus

    Published 2018
    “…Finally, this research designs and implements an enhanced parallel SOM architecture through combining two parallel methods which are network and data partitioning. …”
    Get full text
    Get full text
    Thesis
  12. 12

    A spark-based parallel fuzzy C median algorithm for web log big data by Mallik, Moksud Alam, Zulkurnain, Nurul Fariza, Nizamuddin, Mohammed Khaja, Sarkar, Rashal, Chalil, Aboosalih Kakkat

    Published 2022
    “…Based on the Rand Index and SSE (sum of squared error), the parallel Fuzzy C median algorithm's performance is evaluated in the PySpark platform. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Topology-aware hypergraph based approach to optimize scheduling of parallel applications onto distributed parallel architectures by Koohi, Sina Zangbari

    Published 2020
    “…The first step lies at the modelling of parallel applications running on heterogeneous parallel computers. …”
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15

    Solving ordinary differential equations using block multistep method by Mehrkanoon, Siamak

    Published 2011
    “…The parallelism across the system is considered for the implementation of the parallel block methods. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Efficient 3D temperature propagation for laser glass interaction by Alias, Norma, Shahril, Rosdiana, Islam, Md. Rajibul, Satam, Noriza, Darwis, Roziha

    Published 2008
    “…The performance evaluations of the algorithm are increasing in terms of speed-up, efficiency and effectiveness.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  17. 17

    Parallel system for abnormal cell growth prediction based on fast numerical simulation by Alias, Norma, Islam, Md. Rajibul, Shahir, Rosdiana, Hamzah, Norhafizah, Satam, Noriza, Abd. Ghaffar, Zarith Safiza, Darwis, Roziha, Ludin, Eliana, Azami, Masrin

    Published 2010
    “…The development of the prediction system is the combinations of the parallel algorithms, open source software on Linux environment and distributed multiprocessor system. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    GPU-based odd and even hybrid string matching algorithm by Rahbari, Ghazal, Abdul Rashid, Nur’Aini, Husain, Wahidah

    Published 2016
    “…String matching is considered as one of the fundamental problems in computer science.Many computer applications provide the string matching utility for their users, and how fast one or more occurrences of a given pattern can be found in a text plays a prominent role in their user satisfaction.Although numerous algorithms and methods are available to solve the string matching problem, the remarkable increase in the amount of data which is produced and stored by modern computational devices demands researchers to find much more efficient ways for dealing with this issue.In this research, the Odd and Even (OE) hybrid string matching algorithm is redesigned to be executed on the Graphics Processing Unit (GPU), which can be utilized to reduce the burden of compute-intensive operations from the Central Processing Unit (CPU).In fact, capabilities of the GPU as a massively parallel processor are employed to enhance the performance of the existing hybrid string matching algorithms.Different types of data are used to evaluate the impact of parallelization and implementation of both algorithms on the GPU. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

    Online system identification development based on recursive weighted least square neural networks of nonlinear hammerstein and wiener models. by Kwad, Ayad Mahmood

    Published 2022
    “…Best Hammerstein parallel NN polynomial based model and series-parallel NN polynomial model are 88.75% and 93.9% respectively, for best Hammerstein parallel NN sigmoid based model and series-parallel NN sigmoid based model 78.26% and 95.95% respectively, and for best Hammerstein parallel NN hyperbolic tangent based model and series-parallel NN hyperbolic tangent based model 70.7% and 96.4% respectively. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    Computationally efficient sequential learning algorithms for direct link resource-allocating networks by Asirvadam , Vijanth Sagayan, McLoone, Sean, Irwin, George W

    Published 2005
    “…The new algorithms, which also incorporate a pruning strategy to control network growth, are evaluated on three different system identification benchmark problems and shown to outperform existing methods both in terms of training error convergence and computational efficiency.…”
    Get full text
    Get full text
    Article