公开(公告)号：MY178801A

公开(公告)日：2020-10-20

申请号：MYPI2013001230

申请日：2013-04-05

Applicant: MIMOS BERHAD

Inventor： SOO SAW MENG ,  MOHANAVELU MUDALIAR A/L SENAPEN ,  LIM OON LEONG ,  DR ETTIKAN KANDASAMY A/L KARUPPIAH ,  YONG KEH KOK

Abstract: [0058] The present invention provides a system and method for determining an application execution path on a parallel computing environment. It introduces a data- set analyzer (702), an algorithm analyzer (704), a compute-resource analyzer (706) and a resource selection and configuration unit (708) to manage the execution paths. The system analyses various parameters to determine an optimal execution path. [0059] FIG. 4 for publication.

公开(公告)号：MY173084A

公开(公告)日：2019-12-25

申请号：MYPI2014701350

申请日：2014-05-23

Applicant: MIMOS BERHAD

Inventor： YASZRINA BINTI MOHAMAD YASSIN ,  DR ETTIKAN KANDASAMY A/L KARUPPIAH ,  AZIZAH BINTI MAIDIN ,  KOONG WAH YAN ,  NGO CHUAN HAI

Abstract: The present invention relates to an apparatus and method for performing computation using adaptive-window edit distance algorithm to determine matching possibilities by optimizing ratio of similarity values and weighted order of string, wherein the computation on string performed using parallel forward and backward computation on each sub-string to determine sequential order. The apparatus for parallel moving adaptive window filtering edit distance computation includes: a central processing unit (1), a storage unit (2), a memory module (6), a plurality of input devices (4), a random access memory (7) having connected to the memory module (6), an Input-Output hub (3) having connected to the memory module (6), the input devices (4) and the storage unit (2), and a parallel computation acceleration device (5) having connected to the central processing unit (1) via memory module (6), whereby the parallel computation acceleration device (5) further includes: a match filtering scoping unit to extract a first string from at least one reference list that is most similar to a second string from at least one search list for matching operation, a eliminator unit to extract at least one unmatched string from the first string and second string, a comparator unit to compute the unmatched string, wherein the unmatched string are split to at least one sub-string using a space character and eliminate at least one patronymic character, and at least one edit distance adaptive window determining unit to prepare for adaptive window setting based on the unmatched string and to calculate adaptive distance values on at least one critical path.