Search Results - (( developing executive computing algorithm ) OR ( java simulation based algorithm ))
Search alternatives:
- developing executive »
- executive computing »
- computing algorithm »
- simulation based »
- java simulation »
-
1
Ant colony optimization algorithm for load balancing in grid computing
Published 2012“…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization. …”
Get full text
Get full text
Get full text
Monograph -
2
Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing
Published 2011“…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
Get full text
Get full text
Get full text
Thesis -
3
Resource management in grid computing using ant colony optimization
Published 2011“…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
Get full text
Get full text
Get full text
Get full text
Monograph -
4
Automated time series forecasting
Published 2011“…While quantitative technique is based on statistical concepts and requires large amount of data in order to formulate the mathematical models.This technique can be classified into projective and causal technique.The projective technique (or univariate modelling) just involve one variable while the causal technique (or econometric modelling) suitable for multi-variables.Since forecasting involves uncertainty, several methods need to be executed on one set of time series data in order to produce accurate forecast.Hence, usually in practice forecaster need to use several softwares to obtain the forecast values.If this practice can be transformed into algorithm (well-defined rules for solving a problem) and then the algorithm can be transformed into a computer program, less time will be needed to compute the forecast values where in business world time is money.In this study, we focused on algorithm development for univariate forecasting techniques only and will expand towards econometric modelling in the future.Two set of simulated data (yearly and non-yearly) and several univariate forecasting techniques (i.e. …”
Get full text
Get full text
Get full text
Monograph -
5
A Toolkit for Simulation of Desktop Grid Environment
Published 2014“…Core functionality of the simulator are job generation, volunteer generation, simulating algorithms, generating graphical charts and generating reports. …”
Get full text
Get full text
Final Year Project -
6
An enhanced ant colony system algorithm for dynamic fault tolerance in grid computing
Published 2020“…The proposed algorithm was developed in a simulated grid environment called GridSim and evaluated against other fault tolerance algorithms such as trust-based ACO, fault tolerance ACO, ACO without fault tolerance and ACO with fault tolerance in terms of total execution time, average latency, average makespan, throughput, execution success rate and load balancing. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
7
RISC-V instruction set extension on blockchain application
Published 2024“…In this project, some instructions were proposed to execute the cryptographic algorithm in shorter clock cycles and shorter execution time. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
8
Bitwise-based Routing Algorithms in Optical Multistage Interconnection Network
Published 2007“…In the first, the Improved Zero algorithm is proposed to solve the problem and secondly, the Bitwise Improved Zero algorithm is developed. …”
Get full text
Get full text
Thesis -
9
Teaching and learning via chatbots with immersive and machine learning capabilities
Published 2019“…In order to address these shortcomings, seven text-based conversational chatbots for the students to learn Java in an interactive and engaging manners had been built. …”
Get full text
Get full text
Conference or Workshop Item -
10
Design of Improved Stream Cipher Algorithms for GSM Communication
Published 2024thesis::master thesis -
11
Improving resource management with multi-instance broker scheduling algorithm in hierarchical grid computing
Published 2016“…The designed modules is in the form of algorithms, GridSim, Java Development Kits and Java Language used to support the design process whereas the Netbeans software serves as the platform to simulate the experiment so as to obtain the results. …”
Get full text
Get full text
Get full text
Thesis -
12
Pengesan lalu lintas dengan kaedah pemerosesan imej
Published 2001“…This study was conducted to develop efficient traffic detector using image-processing with a personal compute I: Traffic images were captured using ordinary analogue video camera and digitised using a video blastel: Four algorithms were developed i. e. algorithm for traffic counting, algorithm for vehicle classification. algorithm to determine the speed of the counted vehicles and algorithm for incident detection. …”
Get full text
Get full text
Article -
13
Greedyzero-based scheduling algorithm to route in optical low stage interconnection networks
Published 2012“…This algorithm has been developed to achieve performance goals in terms of 50% reduction in the number of passes.…”
Get full text
Get full text
Thesis -
14
Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection
Published 2022“…The simulation is implemented with iFogSim and java programming language. …”
Get full text
Get full text
Article -
15
Parallel block methods for solving higher order ordinary differential equations directly
Published 1999“…These methods approximate numerical solution at one point at a time and therefore do not fully exploit the capability of parallel computers. Hence, the development of parallel algorithms to suit these machines becomes essential. …”
Get full text
Get full text
Thesis -
16
Comparative analysis of sine cosine and social network search-based algorithm for software test redundancy reduction optimization
Published 2024Get full text
Get full text
Get full text
Conference or Workshop Item -
17
The visualization of power density and temperature distribution of electronic system using elliptic PDE solver
Published 2008“…Numerical analysis is done in terms of execution time, number of iterations and computational complexity of the algorithm being used. …”
Get full text
Get full text
Article -
18
A discrete event simulation framework for utility accrual scheduling algorithm in uniprocessor environment
Published 2011“…Conclusion: Extensive performance analysis of GUS simulator can be deployed using the developed simulator with low computational overhead. …”
Get full text
Get full text
Get full text
Article -
19
Batch mode heuristic approaches for efficient task scheduling in grid computing system
Published 2016“…We simulate our proposed algorithms using a Java based simulator that is purposedly built for Grid computing simulations. …”
Get full text
Get full text
Get full text
Thesis -
20
The division free parallel algorithm for finding determinant
Published 2013“…A cross multiplication method for determinant was generalized for any size of square matrices using a new permutation strategy.The permutation is generated based on starter sets.However, via permutation, the time execution of sequential algorithm became longer.Thus, in order to reduce the computation time, a parallel strategy was developed which is suited for master and slave paradigm of the high performance computer.A parallel algorithm is integrated with message passing interface.The numerical results showed that the parallel methods computed the determinants faster than the sequential counterparts particularly when the tasks were equally allocated.…”
Get full text
Get full text
Get full text
Article
