Enter your name and a bid for each paper. A bid is a score between 0-10 with 0 indicating lowest interest.

Name:

P1: OpenMP parallelization and optimization of graph-based machine learning algorithms:
P2: Chapel:
P3: LLVM: A compilation framework for lifelong program analysis & transformation:
P4: Optimizing for parallelism and data locality:
P5: Effective padding of multidimensional arrays to avoid cache conflict misses:
P6: Compiler assisted hybrid implicit and explicit gpu memory management under unified address space:
P7: tak: a polymorphic cache hierarchy for general-purpose optimization of data movement:
P8: Mapreduce: Simplified data processing on large clusters:
P9: Taming unbalanced training workloads in deep learning with partial collective operations: