ORCID Profile
0000-0001-8095-7678
Current Organisation
University of Adelaide
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Publisher: Springer Science and Business Media LLC
Date: 17-05-2012
Publisher: IEEE
Date: 02-2009
Publisher: IEEE
Date: 12-2010
Publisher: College of Science for Women
Date: 20-12-2021
DOI: 10.21123/BSJ.2021.18.4(SUPPL.).1413
Abstract: RNA Sequencing (RNA-Seq) is the sequencing and analysis of transcriptomes. The main purpose of RNA-Seq analysis is to find out the presence and quantity of RNA in an experimental s le under a specific condition. Essentially, RNA raw sequence data was massive. It can be as big as hundreds of Gigabytes (GB). This massive data always makes the processing time become longer and take several days. A multicore processor can speed up a program by separating the tasks and running the tasks’ errands concurrently. Hence, a multicore processor will be a suitable choice to overcome this problem. Therefore, this study aims to use an Intel multicore processor to improve the RNA-Seq speed and analyze RNA-Seq analysis's performance with a multiprocessor. This study only processed RNA-Seq from quality control analysis until sorted the BAM (Binary Alignment/Map) file content. Three different sizes of RNA paired end has been used to make the comparison. The final experiment results showed that the implementation of RNA-Seq on an Intel multicore processor could achieve a higher speedup. The total processing time of RNA-Seq with the largest size of RNA raw sequence data (66.3 Megabytes) decreased from 317.638 seconds to 211.916 seconds. The reduced processing time was 105 seconds and near to 2 minutes. Furthermore, for the smallest RNA raw sequence data size, the total processing time decreased from 212.380 seconds to 163.961 seconds which reduced 48 seconds.
Publisher: Science Publications
Date: 08-2014
Publisher: Springer Science and Business Media LLC
Date: 22-06-2011
Publisher: Elsevier BV
Date: 10-2023
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: IEEE
Date: 08-2014
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2020
Publisher: Springer India
Date: 29-10-2015
Publisher: Oxford University Press (OUP)
Date: 16-06-2013
Publisher: Springer Science and Business Media LLC
Date: 11-09-2013
Publisher: IEEE
Date: 2006
Publisher: Springer Science and Business Media LLC
Date: 27-03-2012
Publisher: MDPI AG
Date: 29-11-2021
DOI: 10.3390/SYM13122270
Abstract: High-performance computing comprises thousands of processing powers in order to deliver higher performance computation than a typical desktop computer or workstation in order to solve large problems in science, engineering, or business. The scheduling of these machines has an important impact on their performance. HPC’s job scheduling is intended to develop an operational strategy which utilises resources efficiently and avoids delays. An optimised schedule results in greater efficiency of the parallel machine. In addition, processes and network heterogeneity is another difficulty for the scheduling algorithm. Another problem for parallel job scheduling is user fairness. One of the issues in this field of study is providing a balanced schedule that enhances efficiency and user fairness. ROA-CONS is a new job scheduling method proposed in this paper. It describes a new scheduling approach, which is a combination of an updated conservative backfilling approach further optimised by the raccoon optimisation algorithm. This algorithm also proposes a technique of selection that combines job waiting and response time optimisation with user fairness. It contributes to the development of a symmetrical schedule that increases user satisfaction and performance. In comparison with other well-known job scheduling algorithms, the simulation assesses the effectiveness of the proposed method. The results demonstrate that the proposed strategy offers improved schedules that reduce the overall system’s job waiting and response times.
Publisher: Elsevier BV
Date: 2015
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: Springer Science and Business Media LLC
Date: 29-06-2013
Publisher: IEEE
Date: 11-2013
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: Medknow
Date: 2011
Publisher: Springer Science and Business Media LLC
Date: 14-06-2012
Publisher: SAGE Publications
Date: 07-06-2010
Abstract: There are several benchmark programs available to measure the performance of MPI on parallel computers. The most common use of MPI benchmarks software are SKaMPI, Pallas MPI Benchmark, MPBench, Mpptest and MPIBench. It is interesting to analyze the differences between different benchmark. Presently, there have been few comparisons done between the different benchmarks. Thus, in this paper we discuss a comparison of the techniques used and the functionality of each benchmark, and also a comparison of the results on a distributed memory machine and shared memory machine for point-to-point communication. All of the MPI benchmarks listed above will be compared in this analysis. It is expected that the results from different benchmarks should be similar, however this analysis found substantial differences in the results for certain MPI communications, particularly for shared memory machines.
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2019
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: Springer Science and Business Media LLC
Date: 23-01-2014
Publisher: Elsevier BV
Date: 09-2016
Publisher: IEEE
Date: 06-2012
Publisher: Springer Science and Business Media LLC
Date: 10-01-2013
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: IEEE
Date: 09-2011
Publisher: ACM
Date: 04-12-2014
Publisher: Springer Science and Business Media LLC
Date: 12-2011
Publisher: IEEE
Date: 2010
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2023
Publisher: IEEE
Date: 04-2009
Publisher: Science Publications
Date: 04-2013
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: IEEE
Date: 08-2015
Publisher: Elsevier BV
Date: 07-2012
Publisher: IEEE
Date: 12-2015
Publisher: American Physical Society (APS)
Date: 09-10-2009
No related grants have been discovered for Nor Asilah Wati Abdul Hamid.