PENYELESAIAN MASALAH N-BENDA MENGGUNAKAN PENGHITUNGAN PARALEL

The computers with multicore pocessor is widely available at present, however many software isn�t adapting that hardware advantage yet. Study has been carried out on n-body and its paralelization posibility. Parallel algorithm for n-body problem has been developed. The algorithm applied to PP, Ope...

Full description

Bibliographic Details
Main Authors: , Nugroho Adi Pramono, , Dr.rer.nat. Muhammad Farchani Rosyid
Format: Thesis
Published: [Yogyakarta] : Universitas Gadjah Mada 2013
Subjects:
ETD
_version_ 1797033931368824832
author , Nugroho Adi Pramono
, Dr.rer.nat. Muhammad Farchani Rosyid
author_facet , Nugroho Adi Pramono
, Dr.rer.nat. Muhammad Farchani Rosyid
author_sort , Nugroho Adi Pramono
collection UGM
description The computers with multicore pocessor is widely available at present, however many software isn�t adapting that hardware advantage yet. Study has been carried out on n-body and its paralelization posibility. Parallel algorithm for n-body problem has been developed. The algorithm applied to PP, OpenMP and MPI. Developed algorithm can be applied into a multicore computer with commodity specification. This study uses a theoretic-computational approach. The result shows that paralel program is executed faster than serial program.
first_indexed 2024-03-13T23:02:42Z
format Thesis
id oai:generic.eprints.org:123247
institution Universiti Gadjah Mada
last_indexed 2024-03-13T23:02:42Z
publishDate 2013
publisher [Yogyakarta] : Universitas Gadjah Mada
record_format dspace
spelling oai:generic.eprints.org:1232472016-03-04T08:41:31Z https://repository.ugm.ac.id/123247/ PENYELESAIAN MASALAH N-BENDA MENGGUNAKAN PENGHITUNGAN PARALEL , Nugroho Adi Pramono , Dr.rer.nat. Muhammad Farchani Rosyid ETD The computers with multicore pocessor is widely available at present, however many software isn�t adapting that hardware advantage yet. Study has been carried out on n-body and its paralelization posibility. Parallel algorithm for n-body problem has been developed. The algorithm applied to PP, OpenMP and MPI. Developed algorithm can be applied into a multicore computer with commodity specification. This study uses a theoretic-computational approach. The result shows that paralel program is executed faster than serial program. [Yogyakarta] : Universitas Gadjah Mada 2013 Thesis NonPeerReviewed , Nugroho Adi Pramono and , Dr.rer.nat. Muhammad Farchani Rosyid (2013) PENYELESAIAN MASALAH N-BENDA MENGGUNAKAN PENGHITUNGAN PARALEL. UNSPECIFIED thesis, UNSPECIFIED. http://etd.ugm.ac.id/index.php?mod=penelitian_detail&sub=PenelitianDetail&act=view&typ=html&buku_id=63358
spellingShingle ETD
, Nugroho Adi Pramono
, Dr.rer.nat. Muhammad Farchani Rosyid
PENYELESAIAN MASALAH N-BENDA MENGGUNAKAN PENGHITUNGAN PARALEL
title PENYELESAIAN MASALAH N-BENDA MENGGUNAKAN PENGHITUNGAN PARALEL
title_full PENYELESAIAN MASALAH N-BENDA MENGGUNAKAN PENGHITUNGAN PARALEL
title_fullStr PENYELESAIAN MASALAH N-BENDA MENGGUNAKAN PENGHITUNGAN PARALEL
title_full_unstemmed PENYELESAIAN MASALAH N-BENDA MENGGUNAKAN PENGHITUNGAN PARALEL
title_short PENYELESAIAN MASALAH N-BENDA MENGGUNAKAN PENGHITUNGAN PARALEL
title_sort penyelesaian masalah n benda menggunakan penghitungan paralel
topic ETD
work_keys_str_mv AT nugrohoadipramono penyelesaianmasalahnbendamenggunakanpenghitunganparalel
AT drrernatmuhammadfarchanirosyid penyelesaianmasalahnbendamenggunakanpenghitunganparalel