default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArpan Mukhopadhyay
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Sanidhay Bhambay, Arpan Mukhopadhyay
, Thirupathaiah Vasantam:
The impact of load comparison errors on the power-of-d load balancing. Perform. Evaluation 164: 102408 (2024)- [c14]Samira Ghanbarian, Arpan Mukhopadhyay, Ravi R. Mazumdar, Fabrice M. Guillemin:
On Optimal Server Allocation for Moldable Jobs with Concave Speed-Up. MobiHoc 2024: 191-200 - [i16]Samira Ghanbarian, Arpan Mukhopadhyay, Ravi R. Mazumdar, Fabrice M. Guillemin:
On Optimal Server Allocation for Moldable Jobs with Concave Speed-Up. CoRR abs/2406.09427 (2024) - [i15]Zhouzi Li, Benjamin Berg, Arpan Mukhopadhyay, Mor Harchol-Balter:
How to Rent GPUs on a Budget. CoRR abs/2406.15560 (2024) - 2023
- [c13]Sanidhay Bhambay, Arpan Mukhopadhyay, Thirupathaiah Vasantam:
The Power of Two Choices with Load Comparison Errors. MobiHoc 2023: 121-130 - [i14]Oindrila Deb, Arpan Mukhopadhyay:
Biased Consensus Dynamics on Regular Expander Graphs. CoRR abs/2302.08344 (2023) - [i13]Sanidhay Bhambay, Arpan Mukhopadhyay, Thirupathaiah Vasantam:
The Power of Two Choices with Load Comparison Errors. CoRR abs/2303.00869 (2023) - [i12]Samira Ghanbarian, Arpan Mukhopadhyay, Fabrice M. Guillemin, Ravi R. Mazumdar:
On the Performance of Large Loss Systems with Adaptive Multiserver Jobs. CoRR abs/2309.00060 (2023) - [i11]Sanidhay Bhambay, Burak Büke, Arpan Mukhopadhyay:
Diffusion Approximations of Speed-Aware Join-the-Shortest-Queue Scheme: Transient and Stationary Analysis. CoRR abs/2312.10497 (2023) - 2022
- [j12]Sanidhay Bhambay, Arpan Mukhopadhyay:
Asymptotic optimality of speed-aware JSQ for heterogeneous service systems. Perform. Evaluation 157-158: 102320 (2022) - [c12]Sanidhay Bhambay, Arpan Mukhopadhyay:
Optimal Load Balancing in Heterogeneous Server Systems. WiOpt 2022: 113-120 - [i10]Sanidhay Bhambay, Arpan Mukhopadhyay:
Asymptotic Optimality of Speed-Aware JSQ for Heterogeneous Systems. CoRR abs/2203.01721 (2022) - [i9]Ayalvadi Ganesh, Arpan Mukhopadhyay:
A Model of Job Parallelism for Latency Reduction in Large-Scale Systems. CoRR abs/2203.08614 (2022) - 2020
- [j11]Sounak Kar, Robin Rehrmann, Arpan Mukhopadhyay, Bastian Alt, Florin Ciucu, Heinz Koeppl, Carsten Binnig, Amr Rizk:
On the Throughput Optimization in Large-scale Batch-processing Systems. Perform. Evaluation 144: 102142 (2020) - [j10]Sounak Kar, Robin Rehrmann, Arpan Mukhopadhyay, Bastian Alt, Florin Ciucu, Heinz Koeppl, Carsten Binnig, Amr Rizk:
On the Throughput Optimization in Large-Scale Batch-Processing Systems. SIGMETRICS Perform. Evaluation Rev. 48(3): 128-129 (2020) - [j9]Antoine Wehenkel, Arpan Mukhopadhyay, Jean-Yves Le Boudec, Mario Paolone:
Parameter Estimation of Three-Phase Untransposed Short Transmission Lines From Synchrophasor Measurements. IEEE Trans. Instrum. Meas. 69(9): 6143-6154 (2020) - [i8]Md Umar Hashmi, Arpan Mukhopadhyay, Ana Busic, Jocelyne Elias:
Storage Optimal Control under Net Metering Policies. CoRR abs/2002.01524 (2020) - [i7]Arpan Mukhopadhyay, Ravi R. Mazumdar, Rahul Roy:
Opinion Dynamics under Voter and Majority Rule Models with Biased and Stubborn Agents. CoRR abs/2003.02885 (2020) - [i6]Sounak Kar, Robin Rehrmann, Arpan Mukhopadhyay, Bastian Alt, Florin Ciucu, Heinz Koeppl, Carsten Binnig, Amr Rizk:
On the Throughput Optimization in Large-Scale Batch-Processing Systems. CoRR abs/2009.09433 (2020)
2010 – 2019
- 2019
- [j8]Arpan Mukhopadhyay, Nidhi Hegde, Marc Lelarge:
Asymptotics of Replication and Matching in Large Caching Systems. IEEE/ACM Trans. Netw. 27(4): 1657-1668 (2019) - [c11]Md Umar Hashmi, Arpan Mukhopadhyay, Ana Busic, Jocelyne Elias, Diego Kiedanski:
Optimal Storage Arbitrage under Net Metering using Linear Programming. SmartGridComm 2019: 1-7 - [i5]Md Umar Hashmi, Arpan Mukhopadhyay, Ana Busic, Jocelyne Elias:
Optimal Storage Arbitrage under Net Metering using Linear Programming. CoRR abs/1905.00418 (2019) - 2018
- [j7]Thirupathaiah Vasantam, Arpan Mukhopadhyay, Ravi R. Mazumdar:
The mean-field behavior of processor sharing systems with general job lengths under the SQ(d) policy. Perform. Evaluation 127-128: 120-153 (2018) - [j6]Thirupathaiah Vasantam, Arpan Mukhopadhyay, Ravi R. Mazumdar:
The Mean-field Behavior of Processor Sharing Systems with General Job Lengths Under the SQ(d) Policy. SIGMETRICS Perform. Evaluation Rev. 46(3): 54-55 (2018) - [c10]Arpan Mukhopadhyay, Nidhi Hegde, Marc Lelarge:
Optimal Content Replication and Request Matching in Large Caching Systems. INFOCOM 2018: 288-296 - [i4]Arpan Mukhopadhyay, Nidhi Hegde, Marc Lelarge:
Optimal Content Replication and Request Matching in Large Caching Systems. CoRR abs/1801.02889 (2018) - 2017
- [j5]A. Karthik, Arpan Mukhopadhyay, Ravi R. Mazumdar:
Choosing among heterogeneous server clouds. Queueing Syst. Theory Appl. 85(1-2): 1-29 (2017) - [c9]Md Umar Hashmi, Arpan Mukhopadhyay, Ana Busic, Jocelyne Elias:
Optimal control of storage under time varying electricity prices. SmartGridComm 2017: 134-140 - [c8]Thirupathaiah Vasantam, Arpan Mukhopadhyay, Ravi R. Mazumdar:
Mean-Field Analysis of Loss Models with Mixed-Erlang Distributions under Power-of-d Routing. ITC 2017: 250-258 - [i3]Thirupathaiah Vasantam, Arpan Mukhopadhyay, Ravi R. Mazumdar:
Insensitivity of the mean-field Limit of Loss Systems Under Power-of-d Routing. CoRR abs/1708.09328 (2017) - 2016
- [j4]Arpan Mukhopadhyay, Ravi R. Mazumdar:
Analysis of Randomized Join-the-Shortest-Queue (JSQ) Schemes in Large Heterogeneous Processor-Sharing Systems. IEEE Trans. Control. Netw. Syst. 3(2): 116-126 (2016) - [c7]Arpan Mukhopadhyay, Ravi R. Mazumdar, Rahul Roy:
Majority Rule Based Opinion Dynamics with Biased and Stubborn Agents. SIGMETRICS 2016: 385-386 - [c6]Arpan Mukhopadhyay, Ravi R. Mazumdar, Rahul Roy:
Binary Opinion Dynamics with Biased Agents and Agents with Different Degrees of Stubbornness. ITC 2016: 261-269 - 2015
- [j3]Arpan Mukhopadhyay, A. Karthik, Ravi R. Mazumdar, Fabrice Guillemin:
Mean field and propagation of chaos in multi-class heterogeneous loss models. Perform. Evaluation 91: 117-131 (2015) - [c5]Arpan Mukhopadhyay, Ravi R. Mazumdar, Fabrice Guillemin:
The Power of Randomized Routing in Heterogeneous Loss Systems. ITC 2015: 125-133 - [i2]Arpan Mukhopadhyay, A. Karthik, Ravi R. Mazumdar:
Randomized Assignment of Jobs to Servers in Heterogeneous Clusters of Shared Servers for Low Delay. CoRR abs/1502.05786 (2015) - 2014
- [c4]Arpan Mukhopadhyay, Ravi R. Mazumdar:
Randomized routing schemes for large processor sharing systems with multiple service rates. SIGMETRICS 2014: 555-556 - [c3]Arpan Mukhopadhyay, Ravi R. Mazumdar:
Rate-based randomized routing in large heterogeneous processor sharing systems. ITC 2014: 1-9 - 2013
- [j2]Arpan Mukhopadhyay, Neelesh B. Mehta, Vikram Srinivasan:
Design and Analysis of an Acknowledgment-Aware Asynchronous MPR MAC Protocol for Distributed WLANs. IEEE Trans. Wirel. Commun. 12(5): 2068-2079 (2013) - [i1]Arpan Mukhopadhyay, Ravi R. Mazumdar:
Analysis of Load Balancing in Large Heterogeneous Processor Sharing Systems. CoRR abs/1311.5806 (2013) - 2012
- [c2]Arpan Mukhopadhyay, Neelesh B. Mehta, Vikram Srinivasan:
Acknowledgement-aware MPR MAC protocol for distributed WLANs: Design and analysis. GLOBECOM 2012: 5087-5092 - 2011
- [j1]Swagatam Das, Arpan Mukhopadhyay, Anwit Roy, Ajith Abraham, Bijaya K. Panigrahi:
Exploratory Power of the Harmony Search Algorithm: Analysis and Improvements for Global Numerical Optimization. IEEE Trans. Syst. Man Cybern. Part B 41(1): 89-106 (2011)
2000 – 2009
- 2008
- [c1]Arpan Mukhopadhyay, Anwit Roy, Sourav Das, Swagatam Das, Ajith Abraham:
Population-variance and explorative power of Harmony Search: An analysis. ICDIM 2008: 775-781
Coauthor Index
aka: Ravi R. Mazumdar
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-10-23 20:35 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:
