Parallel Hill Climbing for Lockbox Distribution in Banking Applications Using PThreads
This paper presents a parallel implementation of the hill climbing algorithm for distributing lockboxes among multiple locations to minimize floating-point value calculations. Given the inefficiency of sequential approaches with large inputs, we leverage PThreads to develop a more efficient solution. Each thread explores a different starting point to optimize the siting pattern, while mutex locks manage shared data access. The results showcase improved performance and scalability compared to other parallel frameworks such as MPI and PVM, highlighting the effectiveness of PThreads in this context.
Download Presentation 
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.During download, if you can't get a presentation, the file might be deleted by the publisher.
E N D
