Hasil Pencarian  ::  Simpan CSV :: Kembali

"Scientific computing has often been called the third approach to scientific discovery, emerging as a peer to experimentation and theory. Historically, the synergy between experimentation and theory has been well understood: experiments give insight into possible theories, theories inspire experiments, experiments reinforce or invalidate theories, and so on. As scientific computing has evolved to produce results that meet or exceed the quality of experimental and theoretical results, it has become indispensable.Parallel processing has been an enabling technology in scientific computing for more than 20 years. This book is the first in-depth discussion of parallel computing in 10 years; it reflects the mix of topics that mathematicians, computer scientists, and computational scientists focus on to make parallel processing effective for scientific problems. Presently, the impact of parallel processing on scientific computing varies greatly across disciplines, but it plays a vital role in most problem domains and is absolutely essential in many of them. Parallel Processing for Scientific Computing is divided into four parts: The first concerns performance modeling, analysis, and optimization; the second focuses on parallel algorithms and software for an array of problems common to many modeling and simulation applications; the third emphasizes tools and environments that can ease and enhance the process of application development; and the fourth provides a sampling of applications that require parallel computing for scaling to solve larger and realistic models that can advance science and engineering."

"The two volume set LNCS 7133 and LNCS 7134 constitutes the thoroughly refereed post-conference proceedings of the 10th International Conference on Applied Parallel and Scientific Computing, PARA 2010, held in Reykjavík, Iceland, in June 2010. These volumes contain three keynote lectures, 29 revised papers and 45 minisymposia presentations arranged on the following topics: cloud computing, HPC algorithms, HPC programming tools, HPC in meteorology, parallel numerical algorithms, parallel computing in physics, scientific computing tools, HPC software engineering, simulations of atomic scale systems, tools and environments for accelerator based computational biomedicine, GPU computing, high performance computing interval methods, real-time access and processing of large data sets, linear algebra algorithms and software for multicore and hybrid architectures in honor of Fred Gustavson on his 75th birthday, memory and multicore issues in scientific computing, theory and praxis, multicore algorithms and implementations for application problems, fast PDE solvers and a posteriori error estimates, and scalable tools for high performance computing."

"The two volume set LNCS 7133 and LNCS 7134 constitutes the thoroughly refereed post-conference proceedings of the 10th International Conference on Applied Parallel and Scientific Computing, PARA 2010, held in Reykjavík, Iceland, in June 2010. These volumes contain three keynote lectures, 29 revised papers and 45 minisymposia presentations arranged on the following topics: cloud computing, HPC algorithms, HPC programming tools, HPC in meteorology, parallel numerical algorithms, parallel computing in physics, scientific computing tools, HPC software engineering, simulations of atomic scale systems, tools and environments for accelerator based computational biomedicine, GPU computing, high performance computing interval methods, real-time access and processing of large data sets, linear algebra algorithms and software for multicore and hybrid architectures in honor of Fred Gustavson on his 75th birthday, memory and multicore issues in scientific computing, theory and praxis, multicore algorithms and implementations for application problems, fast PDE solvers and a posteriori error estimates, and scalable tools for high performance computing."

"Tingginya tingkat kompleksitas program menyebabkan program memiliki waktu eksekusi yang lama jikalau tidak dijalankan pada mesin berkomputasi tinggi. Masalah ini dapat diatasi salah satunya dengan cara menjalankan berbagai proses pada program tersebut secara simultan sehingga program dapat semakin cepat tereksekusi. Metode ini dikenal dengan istilah parallel computing. Untuk lebih mempercepat waktu eksekusi program, parallel computing tersebut dapat diimplementasikan pada arsitektur High Performance Computing HPC. Metode parallel computing dalam HPC tersebut diimplementasikan ke dalam program Sistem Penilaian Esai Otomatis Simple-O. Simple-O merupakan program penilai esai otomatis yang merupakan pengembangan dari Departemen Teknik Elektro. Dengan menerapkan parallel computing dan menjalankan program pada HPC, eksekusi yang dibutuhkan untuk memeriksa jawaban esai dapat semakin cepat. Parallel computing atau parallelism akan diterapkan pada salah satu bagian dari Simple-O yaitu pada algoritma pembelajaran dalam Simple-O, lebih tepatnya pada Self Organizing Map SOM atau Learning Vector Quantization LVQ. Parallelism dalam SOM dan LVQ diterapkan dengan metode network partition dimana node komputasi Euclidean distance dilakukan secara parallel. Pada penelitian ini didapatkan bahwa kecepatan program serial 1,28 kali lebih cepat dibandingkan program parallel.

---

The escalation of program complexity nowadays means slower run time when it is not executed in high performance machine. One way to address this issue is to execute the processes in the program simultaneously so the program may be executed quicker, known as parallel computing. To further accelerate the program parallel computing can be implemented in High Performance Computing HPC architecture. This method of applicating parallel computing with HPC is implemented in Automatic Essay Grading System, known as Simple O. Simple O is an automatic essay grading system developed by Department of Electrical Engineering Universitas Indonesia. The purpose of applicating the aforementioned method to Simple O is to accelerate the speed of essay grading execution. Parallel computing will be implemented to one of Simple O rsquo s part of program, which is in the learning algorithm. The learning algorithm applied in Simple O is Self Organizing Map SOM and Learning Vector Quantization LVQ. The implementation of parallelism in the learning algorithm uses network partition method, where the calculation of Euclidean distance is done in parallel. Through this research, it can be concluded that the the speed of serial program is 1.28 times quicker than the parallelized program."