FG: A Framework Generator for Hiding Latency in Parallel Programs Running on Clusters

FG is a programming environment for asynchronous programs that run on clusters and fit into a pipeline framework. It enables the programmer to write a series of synchronous functions and represents them as stages of an asynchronous pipeline. FG mitigates the high latency inherent in interprocessor communication and accessing the outer levels of the memory hierarchy. It overlaps separate pipeline stages that perform communication, computation, and I/O by running the stages asynchronously. Each stage maps to a thread. Buffers, whose sizes correspond to block sizes in the memory hierarchy, traverse the pipeline. FG makes such pipeline-structured parallel programs easier to write, smaller, and faster. FG offers several advantages over statically scheduled overlapping and dynamically scheduled overlapping via explicit calls to thread functions. First, it reduces coding and debugging time. Second, we find that it reduces code size by approximately 15

• Type: Conference
• Year: 2004
• Where: ISCAPDCS
• Authors: Thomas H. Cormen, Elena Riccio Davidson
• Keywords: Explicit Calls, ISCAPDCS 2004, ISCAPDCS 2007, Memory Hierarchy, Separate Pipeline Stages