Search Results - parallel satisfaction ((_ algorithm) OR (based algorithm))*
Search alternatives:
- parallel satisfaction »
-
1
GPU-based odd and even hybrid string matching algorithm
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 -
2
Scheduling Problem with Fuzzy Due-dates on Unrelated Parallel Processors
Published 2000“…We propose an efficient algorithm for this problem. (Abstract by authors)…”
Get full text
Conference or Workshop Item -
3
ROA-CONS: raccoon optimization job scheduling
Published 2021“…An optimised schedule results in greater efficiency of the parallel machine. In addition, processes and network heterogeneity is another difficulty for the scheduling algorithm. …”
Get full text
Get full text
Article -
4
Local search approaches for patient scheduling problem in parallel operating theatre
Published 2020“…Patient scheduling in operating theatres (OT) involves high costs to hospitals and may affect treatment and satisfaction to patients. Scheduling for patients in parallel OT can help to schedule a large number of patients and emergency patients are considered in this study .Other than that, emergency patients are able to be scheduled and treated on the day as the modification of schedule is performed during the dynamic processof scheduling. …”
Get full text
Get full text
Thesis -
5
Development of appoinment scheduling agent using distributed constraint satisfaction (DisCS)
Published 2008“…A reservation environment typically refers to a parallel -machine with n jobs available for processing. …”
Get full text
Get full text
Get full text
Monograph -
6
Adaptive resource allocation for reliable performance in heterogeneous distributed systems.
Published 2013Get full text
Book Section -
7
Efficient Numerical Modelling of Extreme Wave
Published 2020“…Future works will be carried out to study the parallelization of the algorithm to allow for larger problem size to be treated.…”
Get full text
Get full text
Final Year Project -
8
Efficient Numerical Modelling of Extreme Waves
Published 2020“…Future works will be carried out to study the parallelization of the algorithm to allow for larger problem size to be treated.…”
Get full text
Get full text
Final Year Project
