Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Apisit Rattanatranurak"'
Publikováno v:
Scientific Reports, Vol 13, Iss 1, Pp 1-13 (2023)
Abstract Quicksort is an important algorithm that uses the divide and conquer concept, and it can be run to solve any problem. The performance of the algorithm can be improved by implementing this algorithm in parallel. In this paper, the parallel so
Externí odkaz:
https://doaj.org/article/fc23e16a20b2479fbd33ee0eedb71942
Publikováno v:
Applied Computing and Informatics.
PurposeSorting is a very important algorithm to solve problems in computer science. The most well-known divide and conquer sorting algorithm is quicksort. It starts with dividing the data into subarrays and finally sorting them.Design/methodology/app
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::69e6dd4056d8400ea84cbba70c076482
https://doi.org/10.1108/aci-10-2021-0288
https://doi.org/10.1108/aci-10-2021-0288
Autor:
Pawin Chuayjaroen, Wunchissanuphong Wissawatmontri, Farida Jamnongpot, Apisit Rattanatranurak
Publikováno v:
The EUrASEANs: journal on global socio-economic dynamics. :23-29
This paper presents the development of web applications to support smart classroom. This research describes the web application which teachers and students can use on their mobile devices such as smartphones, tablets or laptops. The core idea behind
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e4df0b3c592dbc61ed2fbc0f96436d5d
https://doi.org/10.35678/2539-5645.1(20).2020.23-29
https://doi.org/10.35678/2539-5645.1(20).2020.23-29
Publikováno v:
Journal of Mobile Multimedia.
Mobile smartphones/laptops are becoming much more powerful in terms of core count and memory capacity. Demanding games and parallel applications/algorithms can hopefully take advantages of the hardware. Our parallel MSPSort algorithm is one of those
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::62270cb90b214551399f703372675b59
https://doi.org/10.13052/jmm1550-4646.17412
https://doi.org/10.13052/jmm1550-4646.17412
Publikováno v:
Journal of Mobile Multimedia.
The CPUs of smartphones are becoming multicore with huge RAM and storage to support a variety of multimedia applications in the near future. A MultiStack Parallel (MSP) sorting algorithm is proposed and named MSPSort to support manycore systems. It c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ad13f5665fd1d08f4c0b6c722f3a8148
https://doi.org/10.13052/jmm1550-4646.1632
https://doi.org/10.13052/jmm1550-4646.1632
Publikováno v:
2020 17th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON).
Parallel or multithreaded sorting algorithms can be useful for data science/analytics and other applications for manycore CPU systems. A Parallel Triple Pivot Sort (PTPSort) is devised based on the Hoare’s partition algorithm. The input array is in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aafb3807fec11df3a77939f3989b8d21
https://doi.org/10.1109/ecti-con49241.2020.9158215
https://doi.org/10.1109/ecti-con49241.2020.9158215
Publikováno v:
2019 16th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON).
Parallel sorting algorithms for manycore CPU systems are needed in data science and big data era. The PDPSort (Parallel Dual Pivot STLSort) can be revised and extended to achieve higher and more stable Speedups. This paper experiments four scheduling
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b584f4afb955edcb4e5b353d1913c9be
https://doi.org/10.1109/ecti-con47248.2019.8955254
https://doi.org/10.1109/ecti-con47248.2019.8955254
Publikováno v:
Modelling, Identification and Control / 801: Advances in Computer Science.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fa44f9de7595c749461810e9ea80298f
https://doi.org/10.2316/p.2013.801-061
https://doi.org/10.2316/p.2013.801-061
Publikováno v:
2012 Ninth International Conference on Computer Science and Software Engineering (JCSSE).
In this paper, we have optimized and multithreaded SNPHAP, a bioinformatics program, with OpenCL to reduce the computation time and thus accelerate the execution. Our method is called Radix Comparison algorithm running in sequential and parallel (mul
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::669a3f2e865218c8a0333674d38be0f2
https://doi.org/10.1109/jcsse.2012.6261947
https://doi.org/10.1109/jcsse.2012.6261947