180 likes | 361 Views
Modified Accelerated GCD Algorithm Implementation. KHIC 202 April 16 th , 2007 2:00 PM. Team GCD. DJ Selgo Team Leader Lead Tester Jason Prodonovich Architect Configuration Management Specialist Professor Ken Weber Faculty Advisor. Project. Implementation of the
E N D
Modified Accelerated GCD Algorithm Implementation KHIC 202 April 16th, 2007 2:00 PM
Team GCD • DJ Selgo • Team Leader • Lead Tester • Jason Prodonovich • Architect • Configuration Management Specialist • Professor Ken Weber • Faculty Advisor
Project Implementation of the Modified Accelerated GCD Algorithm http://raider.muc.edu/~prodonjs/sceblog/
Presentation Outline • Definitions / Overview • Initial Goals • Development Environment / Tools • Results • Issues Encountered • Demonstration • Q&A
Definitions • GNU • GMP • Multiple Precision Integers • Team GCD • GCD • Euclidean, Binary, K-ary, B-mod, Extended
Project Overview • Sidi Mohammed Sedjelmaci and the Modified Jebelean-Weber Algorithm • What does it do? • How does it work? • Why should we care?
Initial Goals • Modify existing mpn/gcd.c to implement M-JWA algorithm • Develop and execute thorough testing suite to show correctness • Time the new module against the original across multiple architectures
Development Environment / Tools • GNU Linux (Kubuntu distribution) • C (gcc) • Bash shell • Make • Libtool • GNU Debugger (gdb) • Electric Fence (lefence) • GNU Profiler (gprof) • OpenSSH
What Gives? • Profiling (gprof) data taken from runs of 200,000 1024-bit integers
What Gives? • Profiling (gprof) data taken from runs of 200,000 1024-bit integers
Issues Encountered • Initial learning curve • Memory overflow issues (segmentation faults) • Inexperience with development tools
Wrapping Up • Produced a successful, bugfree* implementation of Sedjelmaci’s algorithm • Gained tremendous experience in an unfamiliar environment with unfamiliar tools • Laid foundation for future work into a more efficient Extended GCD algorithm based on an Accelerated algorithm