Show simple item record

dc.contributor.advisorTemkin, Anatoly
dc.contributor.authorShaffer, Ryan
dc.date.accessioned2011-07-21T16:17:40Z
dc.date.available2011-07-21T16:17:40Z
dc.date.issued2011-07-21
dc.identifier.urihttp://hdl.handle.net/2144/1433
dc.description.abstractImplementations are presented of two common algorithms for integer factorization, Pollard’s “p – 1” method and the SQUFOF method. The algorithms are implemented in the F# language, a functional programming language developed by Microsoft and officially released for the first time in 2010. The algorithms are thoroughly tested on a set of large integers (up to 64 bits in size), running both on a physical machine and a Windows Azure machine instance. Analysis of the relative performance between the two environments indicates comparable performance when taking into account the difference in computing power. Further analysis reveals that the relative performance of the Azure implementation tends to improve as the magnitudes of the integers increase, indicating that such an approach may be suitable for larger, more complex factorization tasks. Finally, several questions are presented for future research, including the performance of F# and related languages for more efficient, parallelizable algorithms, and the relative cost and performance of factorization algorithms in various environments, including physical hardware and commercial cloud computing offerings from the various vendors in the industry.en_US
dc.language.isoen_USen_US
dc.titleFactorization in the Cloud: Integer Factorization Using F# and Windows Azureen_US
dc.typePresentationen_US


Files in this item

This item appears in the following Collection(s)

Show simple item record