| D. Vengroff. TPIE user manual and reference, 1995 with subsequent revisions. Available via WWW at http://www.cs.duke.edu/TPIE/. |
....storage, which strives to integrate computation with storage access in a way that allows the system to predict the effects of offloading computation to ASUs so that it may configure the application to match hardware capabilities and load conditions. Our approach extends a well established model [33] for external memory programming.Intheex tended model, programs specify computations in a dataflow style by composing streaming primitives functors that operate on streams or sets of fixed size records flowing through them. One premise of our work is that the techniques for formulating ....
....the parallelism inherent in active storage. Data driven programming models are a good match for implementing many I O algorithms, in part because they have predominantly sequential access patterns, in which each data record is consumed and processed once in each phase of the computation. The TPIE [33] library the starting point for our prototype reflects this principle by exporting a dataflow like interface. TPIE is an external memory programming toolkit that processes data in streams of fixed size records. It provides basic I O efficient data structures and primitives including sorting, ....
D. Vengroff. TPIE user manual and reference, 1995 with subsequent revisions. Available via WWW at http://www.cs.duke.edu/TPIE/.
....5: Partitioning with partitions and tiles using the round robin scheme. The rectangle drawn with a solid line will appear in all three partitions. 7. 2 Implementation Details We implemented the three algorithms using the Transparent Parallel I O Programming Environment (TPIE) system [Ven94, Ven95, VV96] see also http: www.cs.duke.edu TPIE ) TPIE is a collection of templated functions and classes to support high level yet efficient implementations of external memory algorithms. The basic data structure in TPIE is a stream, representing a list of objects of an arbitrary type. The system ....
D. E. Vengroff. TPIE User Manual and Reference. Duke University, 1995 with subsequent revisions. Available via WWW at http://www.cs.duke.edu/TPIE.
....5: Partitioning with 3 partitions and 12 tiles using the round robin scheme. The rectangle drawn with a solid line will appear in all three partitions. 7. 2 Implementation Details We implemented the three algorithms using the Transparent Parallel I O Programming Environment (TPIE) system [Ven94, Ven95, VV96] see also http: www.cs.duke.edu TPIE ) TPIE is a collection of templated functions and classes to support high level yet efficient implementations of external memory algorithms. The basic data structure in TPIE is a stream, representing a list of objects of an arbitrary type. The system ....
D. E. Vengroff. TPIE User Manual and Reference. Duke University, 1995 with subsequent revisions. Available via WWW at http://www.cs.duke.edu/TPIE.
....each partition is loaded into memory and intersections between rectangles in the partition reported. This step was described in detail in Section 4.4. 5. 2 Implementation details We implemented the three algorithms using the Transparent Parallel I O Programming Environment (TPIE) system [Ven94, Venns, VV96] TPIE is a collection of templated functions and classes to support highlevel yet efficient implementations of external memory algorithms. The basic data structure in TPIE is a stream, representing a list of objects of an arbitrary type. The system contains I O efficient implementations ....
D. E. Vengroff. TPIE User Manual and Reference. Duke University, 1995 with subsequent revisions. Available via WWW at http://www.cs.duke.edu/TPIE.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC