NDLI: Efficient task placement and routing of nearest neighbor exchanges in dragonfly networks

Please wait, while we are loading the content...

Snapify: capturing snapshots of offload applications on xeon phi manycore processors

Fault tolerance for remote memory access programming models

CMCP: a novel page replacement policy for system level hierarchical memory management on many-cores

Next generation job management systems for extreme-scale ensemble computing

Efficient task placement and routing of nearest neighbor exchanges in dragonfly networks

MRONLINE: MapReduce online performance tuning

Computation and communication efficient graph processing with distributed immutable view

Improving parallel I/O autotuning with performance modeling

Squirrel: scatter hoarding VM image contents on IaaS compute nodes

Domino: an incremental computing framework in cloud with eventual synchronization

Transparent checkpoint-restart over infiniband

FT-ScaLAPACK: correcting soft errors on-line for ScaLAPACK cholesky, QR, and LU factorization routines

TOP-PIM: throughput-oriented programmable processing in memory

OpenARC: open accelerator research compiler for directive-based, efficient heterogeneous computing

Analysis of dynamic scheduling strategies for matrix multiplication on heterogeneous platforms

Scalable matrix inversion using MapReduce

Seraph: an efficient, low-cost system for concurrent graph processing

SLAM: scalable locality-aware middleware for I/O in scientific analysis and visualization

Exploiting redundancy for cost-effective, time-constrained execution of HPC applications on amazon EC2

Glasswing: accelerating mapreduce on multi-core and many-core clusters

ConCORD: easily exploiting memory content redundancy through the content-aware service command

When paxos meets erasure code: reduce network and storage cost in state machine replication

Improving energy efficiency of embedded DRAM caches for high-end computing systems

MIC-Check: a distributed check pointing framework for the intel many integrated cores architecture

Design and evaluation of the gemtc framework for GPU-enabled many-task computing

Supporting correlation analysis on scientific datasets in parallel and distributed settings

CuSha: vertex-centric graph processing on GPUs

SOR-HDFS: a SEDA-based approach to maximize overlapping in RDMA-enhanced HDFS

CBL: exploiting community based locality for efficient content search in online social networks

Communication-driven scheduling for virtual clusters in cloud

A methodology for evaluating the impact of data compression on climate simulation data

Data filtering for scalable high-dimensional k-NN search on multicore systems

Bobolang: a language for parallel streaming applications

A scalable distributed skip list for range queries

Efficient task placement and routing of nearest neighbor exchanges in dragonfly networks

Content Provider	ACM Digital Library
Author	Rodriguez, German Prisacari, Bogdan Minkenberg, Cyriel Heidelberger, Philip Chen, Dong Hoefler, Torsten
Abstract	Dragonflies are recent network designs that are one of the most promising topologies for the Exascale effort due to their scalability and cost. While being able to achieve very high throughput under random uniform all-to-all traffic, this type of network can experience significant performance degradation for other common high performance computing workloads such as stencil (multi-dimensional nearest neighbor) patterns. Often, the lack of peak performance is caused by an insufficient understanding of the interaction between the workload and the network, and an insufficient understanding of how application specific task-to-node mapping strategies can serve as optimization vehicles. To address these issues, we propose a theoretical performance analysis framework that takes as inputs a network specification and a traffic demand matrix characterizing an arbitrary workload and is able to predict where bottlenecks will occur in the network and what their impact will be on the effective sustainable injection bandwidth. We then focus our analysis on a specific high-interest communication pattern, the multi-dimensional Cartesian nearest neighbor exchange, and provide analytic bounds (owing to bottlenecks in the remote links of the Dragonfly) on its expected performance across a multitude of possible mapping strategies. Finally, using a comprehensive set of simulations results, we validate the correctness of the theoretical approach and in the process address some misconceptions regarding Dragonfly network behavior and evaluation, (such as the choice of throughput maximization over workload completion time minimization as optimization objective) and the question of whether the standard notion of Dragonfly balance can be extended to workloads other than uniform random traffic.
Starting Page	129
Ending Page	140
Page Count	12
File Format	PDF
ISBN	9781450327497
DOI	10.1145/2600212.2600225
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2014-06-23
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Nearest neighbor exchanges Stencil computation Direct and indirect routing Cartesian and random task placement Dragonfly networks
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Efficient Task Placement and Routing of Nearest Neighbor Exchanges in Dragonfly Networks

Efficient routing in wireless networks with random node distribution

Randomizing task placement does not randomize traffic (enough)

Indirect adaptive routing on large scale interconnection networks

Maximizing throughput on a dragonfly network

Energy efficient processing of K nearest neighbor queries in location-aware sensor networks

A Route-Nearest Neighbor Algorithm for Large-Scale Vehicle Routing Problem

A Simple Routing Method for Reverse k-Nearest Neighbor Queries in Spatial Networks

Cartesian K-Means

Efficient task placement and routing of nearest neighbor exchanges in dragonfly networks

Similar Documents

Efficient Task Placement and Routing of Nearest Neighbor Exchanges in Dragonfly Networks

Efficient routing in wireless networks with random node distribution

Randomizing task placement does not randomize traffic (enough)

Indirect adaptive routing on large scale interconnection networks

Maximizing throughput on a dragonfly network

Energy efficient processing of K nearest neighbor queries in location-aware sensor networks

A Route-Nearest Neighbor Algorithm for Large-Scale Vehicle Routing Problem

A Simple Routing Method for Reverse k-Nearest Neighbor Queries in Spatial Networks

Cartesian K-Means

Efficient task placement and routing of nearest neighbor exchanges in dragonfly networks