default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID49th ICPP Workshops 2020: Edmonton, AB, Canada
- Federico Silla, Tarek S. Abdelrahman:
ICPP Workshops '20: Workshops, Edmonton, AB, Canada, August 17-20, 2020. ACM 2020, ISBN 978-1-4503-8868-9 - Md. Solaiman Chowdhury, Jenifar Rahman, Md. Mahfuzur Rahman
:
Preference Aware Smart Hospital Selection System for Patients. 1:1-1:6 - Kai Wang, Kazuya Sakai:
Randomized Authentication using IBE for Opportunistic Networks. 2:1-2:7 - Ming-Yi Lai, Chia-Yu Sung, Jenq-Kuen Lee, Ming-Yu Hung:
Enabling Android NNAPI Flow for TVM Runtime. 3:1-3:8 - Chen-Ting Chao, Wei-Hsu Chu, Chao-Lin Lee, Jenq-Kuen Lee, Ming-Yu Hung, Hsiang-Wei Sung:
Devise Sparse Compression Schedulers to Enhance FastText Methods. 4:1-4:8 - Alex Aravind:
Symmetric Tokens based Group Mutual Exclusion. 5:1-5:10 - Guan-Ren Wang, Peng-Sheng Chen:
A GCC-based Compliance Checker for Single-translation-unit, Identifier-related MISRA-C Rules. 6:1-6:4 - Saumya Shah, Mahyar Zarghami, Pinar Muyan-Özçelik:
Accelerating Forward-Backward Sweep Power Flow Computation on the GPU. 7:1-7:9 - Zhang Yang, Jintao Peng, Qingkai Liu:
Fast Modeling of Network Contention in Batch Point-to-point Communications by Packet-level Simulation with Dynamic Time-stepping. 8:1-8:10 - Madhura Kumaraswamy, Michael Gerndt:
Exploiting Dynamism in HPC Applications to Optimize Energy-Efficiency. 9:1-9:10 - Igor Yakushin, Kshitij Mehta, Jieyang Chen, Matthew Wolf, Ian T. Foster, Scott Klasky, Todd S. Munson:
Feature-preserving Lossy Compression for In Situ Data Analysis. 10:1-10:9 - Michael Trotter, Timothy Wood, H. Howie Huang:
Rumor Has It: Optimizing the Belief Propagation Algorithm for Parallel Processing. 11:1-11:10 - Saleh Khalaj Monfared, Omid Hajihassani, Mohammad Sina Kiarostami, Soroush Meghdadi Zanjani, Dara Rahmati, Saeid Gorgin:
BSRNG: A High Throughput Parallel BitSliced Approach for Random Number Generators. 12:1-12:10 - Alexander Matz, Johannes Doerfert, Holger Fröning:
Automated Partitioning of Data-Parallel Kernels using Polyhedral Compilation. 13:1-13:10 - Yuan Tang:
Improving the Space-Time Efficiency of Matrix Multiplication Algorithms. 14:1-14:10 - Laura Promberger, Rainer Schwemmer, Holger Fröning:
Assessing the Overhead of Offloading Compression Tasks. 15:1-15:10 - Ashish Kumar Kumar, Naman Jain, Preeti Malakar:
Network and Load-Aware Resource Manager for MPI Programs. 16:1-16:10 - Luan Teylo, Rafaela C. Brum, Luciana Arantes, Pierre Sens, Lúcia Maria de A. Drummond:
Developing Checkpointing and Recovery Procedures with the Storage Services of Amazon Web Services. 17:1-17:8 - Jing Chen, Pirah Noor Soomro, Mustafa Abduljabbar, Madhavan Manivannan, Miquel Pericàs:
Scheduling Task-parallel Applications in Dynamically Asymmetric Environments. 18:1-18:10 - Sunimal Rathnayake, Lavanya Ramapantulu, Yong Meng Teo:
Characterizing the Cost-Accuracy Performance of Cloud Applications. 19:1-19:10 - Priya Mishra, Tushar Agrawal, Preeti Malakar:
Communication-aware Job Scheduling using SLURM. 20:1-20:10 - Amir Hossein Sayyad Abdi, Mohsen Sharifi:
Avoiding Register Overflow in the Bakery Algorithm. 21:1-21:7
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-05 21:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
