Related InterviewSolutions

• How Long Does The Parallel Version Of Prim’s Minimum Spanning Tree Finding Algorithm Require For A Graph With N Nodes Using P Processors?
• How Can One Ensure Mutual Exclusion Without Locks?
• When Stealing Load From A Random Loaded Processor, What Type Of Synchronization Is Needed?
• How Fast Can A List Be Sorted Using N Processors Using Local Sorting Of N/p Elements Each Followed By Optimal Multi-way Merge?
• How Fast Can Two Sorted Lists Of Size N Each Be Merged Into One Using P Processors?
• In Order To Balance Load For Parallel Bucket Sort Of N Elements, Uniformly Spaced Splitters Need To Be Selected. This Can Be Done By First Dividing The List Into B Lists And Choosing B Equi-spaced Samples From Each. The Final B Splitters Are Chosen Uniformly Spaced From These Samples. How Balanced Are The Buckets If These Splitters Are Used?
• How Long Does Batcher’s Odd-even Merge Require?
• How Long Does Bitonic Sorting Require On Pram?
• How Can Prefix Minima Be Found In O(1) Time?
• How Can Two Gpu Threads Communicate Through Shared Memory?