default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMd Atiqul Mollah
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Md Nahid Newaz, Sayan Ghosh, Joshua Suetterlein, Nathan R. Tallent, Md Atiqul Mollah, Ming Hua:
Graph Analytics on Jellyfish topology. IPDPS 2024: 839-851- 2023
- [c11]Md Nahid Newaz
, Md Atiqul Mollah:
Memory Usage Prediction of HPC Workloads Using Feature Engineering and Machine Learning. HPC Asia 2023: 64-74 - 2021
- [c10]Md Nahid Newaz, Md Atiqul Mollah, Peyman Faizian, Zhou Tong:
Improving adaptive routing performance on large scale Megafly topology. CCGRID 2021: 406-416 - [c9]Md Nahid Newaz, Md Atiqul Mollah:
Optimizing k-path selection for randomized interconnection networks. HiPC 2021: 222-231
2010 – 2019
- 2019
- [j4]Md Atiqul Mollah, Wenqi Wang, Peyman Faizian, Md. Shafayat Rahman, Xin Yuan, Scott Pakin, Michael Lang:
Modeling Universal Globally Adaptive Load-Balanced Routing. ACM Trans. Parallel Comput. 6(2): 9:1-9:23 (2019) - 2018
- [j3]Peyman Faizian, Juan Francisco Alfaro, Md. Shafayat Rahman, Md Atiqul Mollah, Xin Yuan, Scott Pakin, Michael Lang:
TPR: Traffic Pattern-Based Adaptive Routing for Dragonfly Networks. IEEE Trans. Multi Scale Comput. Syst. 4(4): 931-943 (2018) - [j2]Peyman Faizian, Md Atiqul Mollah, Xin Yuan, Zaid Alzaid, Scott Pakin, Michael Lang:
Random Regular Graph and Generalized De Bruijn Graph with k-Shortest Path Routing. IEEE Trans. Parallel Distributed Syst. 29(1): 144-155 (2018) - [j1]Md Atiqul Mollah, Xin Yuan, Scott Pakin, Michael Lang:
Rapid Calculation of Max-Min Fair Rates for Multi-Commodity Flows in Fat-Tree Networks. IEEE Trans. Parallel Distributed Syst. 29(1): 156-168 (2018) - [c8]Md Atiqul Mollah, Peyman Faizian, Md. Shafayat Rahman, Xin Yuan, Scott Pakin, Mike Lang:
A Comparative Study of Topology Design Approaches for HPC Interconnects. CCGrid 2018: 392-401 - [c7]Md. Shafayat Rahman, Md Atiqul Mollah, Peyman Faizian, Xin Yuan:
Load-Balanced Slim Fly Networks. ICPP 2018: 41:1-41:10 - 2017
- [c6]Peyman Faizian, Md Atiqul Mollah, Md. Shafayat Rahman, Xin Yuan, Scott Pakin, Mike Lang:
Throughput Models of Interconnection Networks: The Good, the Bad, and the Ugly. Hot Interconnects 2017: 33-40 - [c5]Peyman Faizian, Md Atiqul Mollah, Zhou Tong, Xin Yuan, Michael Lang:
A comparative study of SDN and adaptive routing on dragonfly networks. SC 2017: 51 - [c4]Md Atiqul Mollah, Peyman Faizian, Md. Shafayat Rahman, Xin Yuan, Scott Pakin, Michael Lang:
Modeling UGAL on the Dragonfly Topology. PMBS@SC 2017: 136-157 - 2016
- [c3]Peyman Faizian, Md. Shafayat Rahman, Md Atiqul Mollah, Xin Yuan, Scott Pakin, Mike Lang:
Traffic Pattern-Based Adaptive Routing for Intra-Group Communication in Dragonfly Networks. Hot Interconnects 2016: 19-26 - [c2]Peyman Faizian, Md Atiqul Mollah, Xin Yuan, Scott Pakin, Michael Lang:
Random Regular Graph and Generalized De Bruijn Graph with k-Shortest Path Routing. IPDPS 2016: 103-112 - 2015
- [c1]Md Atiqul Mollah, Xin Yuan, Scott Pakin, Michael Lang:
Fast Calculation of Max-Min Fair Rates for Multi-commodity Flows in Fat-Tree Networks. CLUSTER 2015: 351-360
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-06 00:37 CEST 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:
