Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 5 of 5
Full-Text Articles in Engineering
Multipath And Rate Stability, Junjie Liu, Roch A. Guérin
Multipath And Rate Stability, Junjie Liu, Roch A. Guérin
All Computer Science and Engineering Research
Originally Published In Proc. IEEE Globecom Conference - CQRM: Communication QoS, Reliability & Modeling Symposium
In-Network Retransmissions In Named Data Networking, Hila Ben Abraham, Patrick Crowley
In-Network Retransmissions In Named Data Networking, Hila Ben Abraham, Patrick Crowley
All Computer Science and Engineering Research
The strategy layer is an important architectural component in both Content-Centric Networking (CCN) and Named Data Networking (NDN). This component introduces a new forwarding model that allows an application to configure its namespace with a forwarding strategy. A core mechanism in every forwarding strategy is the decision of whether to retransmit an unsatisfied Interest or to wait for an application retransmission. While some applications request control of all retransmissions, others rely on the assumption that the strategy will retransmit an Interest when it is not satisfied. Although an application can select the forwarding strategy used in the local host, it …
Mercator (Mapping Enumerator For Cuda) User's Manual, Stephen V. Cole, Jeremy Buhler
Mercator (Mapping Enumerator For Cuda) User's Manual, Stephen V. Cole, Jeremy Buhler
All Computer Science and Engineering Research
Welcome to the MERCATOR user's manual! MERCATOR is a CUDA/C++ system designed to assist you in writing efficient CUDA applications by automatically generating significant portions of the GPU-side application code. We hope you find it helpful; please feel free to contact the authors with any questions or feedback.
Grafalgo - A Library Of Graph Algorithms And Supporting Data Structures (Revised), Jonathan Turner
Grafalgo - A Library Of Graph Algorithms And Supporting Data Structures (Revised), Jonathan Turner
All Computer Science and Engineering Research
This report provides an (updated) overview of Grafalgo, an open-source library of graph algorithms and the data structures used to implement them. The programs in this library were originally written to support a graduate class in advanced data structures and algorithms at Washington University. Because the code's primary purpose was pedagogical, it was written to be as straightforward as possible, while still being highly efficient. Grafalgo is implemented in C++ and incorporates some features of C++11. The library is available on an open-source basis and may be downloaded from https://code.google.com/p/grafalgo/. Source code documentation is at www.arl.wustl.edu/~jst/doc/grafalgo.
Locality-Aware Dynamic Task Graph Scheduling, Jordyn Maglalang, Sriram Krishnamoorthy, Kunal Agrawal
Locality-Aware Dynamic Task Graph Scheduling, Jordyn Maglalang, Sriram Krishnamoorthy, Kunal Agrawal
All Computer Science and Engineering Research
Dynamic task graph schedulers automatically balance work across processor cores by scheduling tasks among available threads while preserving dependences. In this paper, we design NabbitC, a provably efficient dynamic task graph scheduler that accounts for data locality on NUMA systems. NabbitC allows users to assign a color to each task representing the location (e.g., a processor core) that has the most efficient access to data needed during that node’s execution. NabbitC then automatically adjusts the scheduling so as to preferentially execute each node at the location that matches its color—leading to better locality because the node is likely to make …