A combining window is an interval of time in a combining node during which incoming requests are gathered in the node in order to combine them into a single outgoing request. Our thesis is that a combining window is necessary in order to realize the dual forms of concurrency -- execution and storage concurrency -- that a combining tree is designed to achieve. Execution concurrency among the nodes at each level of a combining tree is necessary for the tree to achieve the speed up that it is designed to give. Without sufficient execution concurrency, the tree will not achieve the desired speed up. Storage concurrency among the nodes at each level of a combining tree is necessary for the tree to achieve the buffer storage that is required in order to implement the combining of requests. Without sufficient storage concurrency, node buffers will overflow. More specifically, the combining window shows how to bound node buffer size.
Title
Combining Windows: A Performance Evaluation of Design Options
Published
1993-02-01
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
CSD-93-727
Type
Text
Extent
63 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
