PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Thottethodi, Mithuna"

Author of the publication

copydeleteadd this publication to your clipboard
Dart: Divide and Specialize for Fast Response to Congestion in RDMA-based Datacenter Networks.

, , , , and . CoRR, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Thottethodi, Mithuna
add a person with the name Thottethodi, Mithuna
 

Other publications of authors with the same name

Exploiting Global Knowledge to Achieve Self-Tuned Congestion Control for k-Ary n-Cube Networks., , and . IEEE Trans. Parallel Distrib. Syst., 15 (3): 257-272 (2004)Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks., , , , and . ISCA, page 432-443. IEEE Computer Society, (2005)Table-lookup based Crossbar Arbitration for Minimal-Routed, 2D Mesh and Torus Networks., and . IPDPS, page 1-10. IEEE, (2007)Millipede: Die-Stacked Memory Optimizations for Big Data Machine Learning Analytics., , and . IPDPS, page 160-171. IEEE Computer Society, (2018)Automatic volume management for programmable microfluidics., , , , and . PLDI, page 56-67. ACM, (2008)Annotated Memory References: A Mechanism for Informed Cache Management., , , and . Euro-Par, volume 1685 of Lecture Notes in Computer Science, page 1251-1254. Springer, (1999)SieveStore: a highly-selective, ensemble-level disk cache for cost-performance., and . ISCA, page 163-174. ACM, (2010)Dart: Divide and Specialize for Fast Response to Congestion in RDMA-based Datacenter Networks., , , , and . CoRR, (2018)BLAM : A High-Performance Routing Algorithm for Virtual Cut-Through Networks., , and . IPDPS, page 45. IEEE Computer Society, (2003)MorphStore: A local file system for Big Data with utility-driven replication and load-adaptive access scheduling., , , , and . MSST, page 1-10. IEEE Computer Society, (2014)