Implementation of the finite-difference time domain method in volunteer computing

Date of Publication

2008

Document Type

Bachelor's Thesis

Degree Name

Bachelor of Science in Computer Science

Subject Categories

Computer Sciences

College

College of Computer Studies

Department/Unit

Computer Science

Thesis Adviser

Romeric F. Pobre
Nelson Marcos

Defense Panel Member

Caslon Chua

Abstract/Summary

Parallel computing implementations for the Finite-Difference Time Domain (FDTD) method have become widespread due to the increased performance it yields compared to single computing. The thesis makes use of a form of parallel computing that provides the increased performance and also flexibility known as volunteer computing. Volunteer computing provides flexibility due to its ability to allow clients to participate or leave in the middle of a computation at any time. The system consists of two applicants: the main (server) and the client. The main application provides a basic interference for creating a simulation containing a Gaussian wave while the client application provides the interface for connecting to the main application. It is developed using Java to allow of portability.

Abstract Format

html

Language

English

Format

Print

Accession Number

TU14556

Shelf Location

Archives, The Learning Commons, 12F, Henry Sy Sr. Hall

Keywords

Parallel programs (Computer programs); Electronic data processing—Distributed processing

Embargo Period

4-21-2021

This document is currently not available here.

Share

COinS