Claim Missing Document
Check
Articles

Found 3 Documents
Search
Journal : TELKOMNIKA (Telecommunication Computing Electronics and Control)

High Performance Computing on Cluster and Multicore Architecture Ahmad Ashari; Mardhani Riasetiawan
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 13, No 4: December 2015
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v13i4.2156

Abstract

High Performance Computing have several issues on architecture, resources, computational model and data. The challenge is establishing the mature architecture with scalable resources. The cluster architecture and multicore architecture implement to produce high performance on computation and process. This research works on architecture development and performance analysis. The cluster architecture build on Raspberry Pi, a single board computer, implement MPICH2. Raspberry Pi cluster build on Raspbian Wheezy operating system and test by metrics computation applications. The multicore architecture build on single computer with Core i5 and Core i7 architecture. The research use himeno98 and himeno16Large tools to analysis the processor and memory allocation. The test run on 1000x1000 matrices and benchmarked with OpenMP. The analysis focuses on CPU Time, FLOPS, and score. The result show on cluster architecture have 2576,07 sec in CPU Time, 86,96 MLPOS, and 2,69 score. The result on Core i5 architecture have 55,57 sec in CPU time, 76,30 MLOPS, and 0,92 score. The result in Core i7 architecture have 59,56 sec CPU Time, 1427,61 MLOPS, and 17,23 score. The cluster and multicore architecture results show that computing process are effected by architecture models. High performance computing architecture that has been built on this result can give learn on the development of HPC architecture models, and baseline performance. In the future it will use for determine the delivery architecture model on HPC and can be test by more variation of load.
The Analyses on Dynamic and Dedicated Resource Allocation on Xen Server Mardhani Riasetiawan; Ahmad Ashari; Irwan Endrayanto
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 14, No 1: March 2016
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v14i1.2321

Abstract

Data center today challenges is not only serve the users, in same time need to establish scalable resources. Data Center manage the resources such as processor, storage, network, and memory in appropriate way to handle to load. In the big data era, load will increase and come in rapid way with large volume data, many type of data, can be stream and batch data, and unknown sources. Resources need to manage with comprehensive strategies to face the characteristic of big data load. Data Center have capabilties on allocate the reosource in dynamic and dedicated ways. The research investigate in the performance of dedycated and dynamic resource allocation to define the reliable strategies on Data Center. The research work on XenServer platform as Data Center. The research define 18 Virtual Machiens both on dedicated and dynamic strategies, use the shared storage mechanism, and resource pools. The research analyze on CPU performances on XenServer1 and XenServer2 that design as cluster Data Center.The test has run on XenServer and resulting the 2 phase of process when Data Center allocate the resources, there are intiation phase and process phase. The research shown that in the intiation phase both dynamic and dedicated strategies still not running, and use the initial resources to establish Data Center. The process phase shown that dynamic and dedicated strategies run and generating the load process. In the process phase it shown the use of memory and CPU Performance stream line into the balance positions. The research result can use for allocating resources is need to define different strategies in initition and process phase.
Increasing the Detail and Realism in Web3D Distributed World Mursid Wahyu Hananto; Ahmad Ashari; Khabib Mustofa; Agus Harjoko
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 16, No 5: October 2018
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v16i5.10113

Abstract

A complex and detailed Web3D world which represented the physical form of an institution is very difficult to be built. To simplify the work, raster images taken from the real structure were heavily utilized. However, this method has resulted in Web3D sites which were low on detail and having minimum level of realism. To overcome this deficiency, it is proposed to maximize the use of polygons. Experiment was done by re-developing the sample world with minimum use of raster images and applying polygons to 92% parts of the site. Site elements were also distributed to three servers to cope with bottleneck problem often occured when using only one server. The result was evaluated in a series of tests to see its viewing capabilities when displayed inside the web browser against various conditions, and it also evaluated in an acceptance test carried out by site users. The majority of testers felt immensely familiar with the details shown by the model as they were able to grab a more close-to-realistic experience like a real-world walk around inside the actual building complex. Problems that often occur whe using only one server ca also be reduced by using distributed world method.