Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenjamin Moseley
Person information
- affiliation: Carnegie Mellon University, Pittsburgh, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c94]Anupam Gupta, Benjamin Moseley, Rudy Zhou:
Minimizing Completion Times for Stochastic Jobs via Batched Free Times. SODA 2023: 1905-1930- [i47]Sami Davies, Benjamin Moseley, Heather Newman:
Fast Combinatorial Algorithms for Min Max Correlation Clustering. CoRR abs/2301.13079 (2023) - [i46]Sami Davies, Benjamin Moseley, Sergei Vassilvitskii, Yuyan Wang:
Predictive Flows for Faster Ford-Fulkerson. CoRR abs/2303.00837 (2023) - 2022
- [b1]Benjamin Moseley:
Physics-informed machine learning: from concepts to real-world applications. University of Oxford, UK, 2022 - [j32]Benjamin Moseley
, Shai Vardi:
The efficiency-fairness balance of Round Robin scheduling. Oper. Res. Lett. 50(1): 20-27 (2022) - [j31]Marilena Leichter, Benjamin Moseley, Kirk Pruhs:
On the impossibility of decomposing binary matroids. Oper. Res. Lett. 50(5): 623-625 (2022) - [j30]Benjamin Berg, Justin Whitehouse, Benjamin Moseley, Weina Wang, Mor Harchol-Balter:
The case for phase-aware scheduling of parallelizable jobs. Perform. Evaluation 153: 102246 (2022) - [j29]Benjamin Berg, Justin Whitehouse, Benjamin Moseley, Weina Wang, Mor Harchol-Balter:
The Case for Phase-Aware Scheduling of Parallelizable Jobs. SIGMETRICS Perform. Evaluation Rev. 49(3): 65-66 (2022) - [j28]Benjamin Moseley, Ruilong Zhang, Shanjiawen Zhao:
Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models. Theor. Comput. Sci. 938: 24-38 (2022) - [c93]Chenyang Xu, Benjamin Moseley:
Learning-Augmented Algorithms for Online Steiner Tree. AAAI 2022: 8744-8752 - [c92]Benjamin Moseley, Kirk Pruhs, Clifford Stein, Rudy Zhou:
A Competitive Algorithm for Throughput Maximization on Identical Machines. IPCO 2022: 402-414 - [c91]Daniel DeLayo, Kenny Zhang, Kunal Agrawal, Michael A. Bender, Jonathan W. Berry, Rathish Das, Benjamin Moseley, Cynthia A. Phillips:
Automatic HBM Management: Models and Algorithms. SPAA 2022: 147-159 - [i45]Marilena Leichter, Benjamin Moseley, Kirk Pruhs:
On the Impossibility of Decomposing Binary Matroids. CoRR abs/2206.12896 (2022) - [i44]Anupam Gupta, Benjamin Moseley, Rudy Zhou:
Minimizing Completion Times for Stochastic Jobs via Batched Free Times. CoRR abs/2208.13696 (2022) - [i43]Franziska Eberle, Anupam Gupta, Nicole Megow, Benjamin Moseley, Rudy Zhou:
Configuration Balancing for Stochastic Requests. CoRR abs/2208.13702 (2022) - [i42]Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii:
Algorithms with Prediction Portfolios. CoRR abs/2210.12438 (2022) - [i41]Sungjin Im, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs, Alireza Samadian:
Optimizing Polymatroid Functions. CoRR abs/2211.08381 (2022) - [i40]Qingyun Chen, Sungjin Im, Benjamin Moseley, Chenyang Xu, Ruilong Zhang:
Min-max Submodular Ranking for Multiple Agents. CoRR abs/2212.07682 (2022) - 2021
- [j27]Varun Gupta, Benjamin Moseley, Marc Uetz, Qiaomin Xie:
Corrigendum: Greed Works - Online Algorithms for Unrelated Machine Stochastic Scheduling. Math. Oper. Res. 46(3): 1230-1234 (2021) - [j26]Sungjin Im, Benjamin Moseley, Kirk Pruhs:
The matroid intersection cover problem. Oper. Res. Lett. 49(1): 17-22 (2021) - [j25]Sungjin Im, Benjamin Moseley, Rudy Zhou:
The Matroid Cup Game. Oper. Res. Lett. 49(3): 405-411 (2021) - [j24]Jacek Blazewicz, Benjamin Moseley, Erwin Pesch, Denis Trystram, Guochuan Zhang:
New Perspectives in Scheduling Theory. J. Sched. 24(5): 455-457 (2021) - [j23]Giorgio Lucarelli, Benjamin Moseley, Kim Thang Nguyen, Abhinav Srivastav, Denis Trystram:
Online Non-preemptive Scheduling on Unrelated Machines with Rejections. ACM Trans. Parallel Comput. 8(2): 9:1-9:22 (2021) - [c90]Thomas Lavastida, Benjamin Moseley, R. Ravi, Chenyang Xu:
Using Predicted Weights for Ad Delivery. ACDA 2021: 21-31 - [c89]Thomas Lavastida, Kefu Lu, Benjamin Moseley, Yuyan Wang:
Scaling Average-Linkage via Sparse Cluster Embeddings. ACML 2021: 1429-1444 - [c88]Benjamin Moseley, Sergei Vassilvitskii, Yuyan Wang:
Hierarchical Clustering in General Metric Spaces using Approximate Nearest Neighbors. AISTATS 2021: 2440-2448 - [c87]Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian:
Approximate Aggregate Queries Under Additive Inequalities. APOCS 2021: 85-99 - [c86]Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian:
A Relational Gradient Descent Algorithm For Support Vector Machine Training. APOCS 2021: 100-113 - [c85]Thomas Lavastida, Benjamin Moseley, R. Ravi, Chenyang Xu:
Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing. ESA 2021: 59:1-59:17 - [c84]Marilena Leichter, Benjamin Moseley, Kirk Pruhs:
An Efficient Reduction of a Gammoid to a Partition Matroid. ESA 2021: 62:1-62:13 - [c83]Jeremy Buhler, Thomas Lavastida, Kefu Lu, Benjamin Moseley:
A Scalable Approximation Algorithm for Weighted Longest Common Subsequence. Euro-Par 2021: 368-384 - [c82]Anupam Gupta, Benjamin Moseley, Rudy Zhou:
Structural Iterative Rounding for Generalized k-Median Problems. ICALP 2021: 77:1-77:18 - [c81]Benjamin Moseley, Kirk Pruhs, Alireza Samadian, Yuyan Wang:
Relational Algorithms for k-Means Clustering. ICALP 2021: 97:1-97:21 - [c80]Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian:
Instance Optimal Join Size Estimation. LAGOS 2021: 135-144 - [c79]Mahmoud Abo Khamis, Ryan R. Curtin, Sungjin Im, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs, Alireza Samadian:
An Approximation Algorithm for the Matrix Tree Multiplication Problem. MFCS 2021: 6:1-6:14 - [c78]Silvio Lattanzi, Benjamin Moseley, Sergei Vassilvitskii, Yuyan Wang, Rudy Zhou:
Robust Online Correlation Clustering. NeurIPS 2021: 4688-4698 - [c77]Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii:
Faster Matchings via Learned Duals. NeurIPS 2021: 10393-10406 - [i39]Thomas Lavastida, Benjamin Moseley, R. Ravi, Chenyang Xu:
Using Predicted Weights for Ad Delivery. CoRR abs/2106.01079 (2021) - [i38]Marilena Leichter, Benjamin Moseley, Kirk Pruhs:
An Efficient Reduction of a Gammoid to a Partition Matroid. CoRR abs/2107.03795 (2021) - [i37]Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii:
Faster Matchings via Learned Duals. CoRR abs/2107.09770 (2021) - [i36]Benjamin Moseley, Kirk Pruhs, Clifford Stein, Rudy Zhou:
A Competitive Algorithm for Throughout Maximization on Identical Machines. CoRR abs/2111.06564 (2021) - [i35]Chenyang Xu, Benjamin Moseley:
Learning-Augmented Algorithms for Online Steiner Tree. CoRR abs/2112.05353 (2021) - 2020
- [j22]Varun Gupta, Benjamin Moseley, Marc Uetz, Qiaomin Xie:
Greed Works - Online Algorithms for Unrelated Machine Stochastic Scheduling. Math. Oper. Res. 45(2): 497-516 (2020) - [j21]Sungjin Im, Benjamin Moseley, Kamesh Munagala, Kirk Pruhs:
Dynamic Weighted Fairness with Minimal Disruptions. Proc. ACM Meas. Anal. Comput. Syst. 4(1): 19:1-19:18 (2020) - [j20]Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Clifford Stein:
Hallucination Helps: Energy Efficient Virtual Circuit Routing. SIAM J. Comput. 49(1): 37-66 (2020) - [j19]Sungjin Im, Benjamin Moseley:
Fair Scheduling via Iterative Quasi-Uniform Sampling. SIAM J. Comput. 49(3): 658-680 (2020) - [j18]Sungjin Im, Shi Li, Benjamin Moseley:
Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization. SIAM J. Discret. Math. 34(3): 1649-1669 (2020) - [j17]Mahmoud Abo Khamis, Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
Functional Aggregate Queries with Additive Inequalities. ACM Trans. Database Syst. 45(4): 17:1-17:41 (2020) - [c76]Yuyan Wang, Benjamin Moseley:
An Objective for Hierarchical Clustering in Euclidean Space and Its Connection to Bisecting K-means. AAAI 2020: 6307-6314 - [c75]Sungjin Im, Mahshid Montazer Qaem, Benjamin Moseley, Xiaorui Sun, Rudy Zhou:
Fast Noise Removal for k-Means Clustering. AISTATS 2020: 456-466 - [c74]Alireza Samadian, Kirk Pruhs, Benjamin Moseley, Sungjin Im, Ryan R. Curtin:
Unconditional Coresets for Regularized Loss Minimization. AISTATS 2020: 482-492 - [c73]Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
Rk-means: Fast Clustering for Relational Data. AISTATS 2020: 2742-2752 - [c72]Michael Dinitz, Benjamin Moseley:
Scheduling for Weighted Flow and Completion Times in Reconfigurable Networks. INFOCOM 2020: 1043-1052 - [c71]Shikha Singh, Sergey Madaminov, Michael A. Bender, Michael Ferdman, Ryan Johnson, Benjamin Moseley, Hung Q. Ngo, Dung Nguyen, Soeren Olesen, Kurt Stirewalt, Geoffrey Washburn:
A Scheduling Approach to Incremental Maintenance of Datalog Programs. IPDPS 2020: 864-873 - [c70]Sara Ahmadian, Alessandro Epasto, Marina Knittel, Ravi Kumar, Mohammad Mahdian, Benjamin Moseley, Philip Pham, Sergei Vassilvitskii, Yuyan Wang:
Fair Hierarchical Clustering. NeurIPS 2020 - [c69]Sungjin Im, Benjamin Moseley, Kamesh Munagala, Kirk Pruhs:
Dynamic Weighted Fairness with Minimal Disruptions. SIGMETRICS (Abstracts) 2020: 5-6 - [c68]Silvio Lattanzi, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii:
Online Scheduling via Learned Weights. SODA 2020: 1859-1877 - [c67]Benjamin Berg, Mor Harchol-Balter, Benjamin Moseley, Weina Wang, Justin Whitehouse:
Optimal Resource Allocation for Elastic and Inelastic Jobs. SPAA 2020: 75-87 - [c66]Rathish Das, Kunal Agrawal, Michael A. Bender, Jonathan W. Berry, Benjamin Moseley, Cynthia A. Phillips:
How to Manage High-Bandwidth Memory Automatically. SPAA 2020: 187-199 - [i34]Sungjin Im, Benjamin Moseley, Kamesh Munagala, Kirk Pruhs:
Dynamic Weighted Fairness with Minimal Disruptions. CoRR abs/2001.06841 (2020) - [i33]Michael Dinitz, Benjamin Moseley:
Scheduling for Weighted Flow and Completion Times in Reconfigurable Networks. CoRR abs/2001.07784 (2020) - [i32]Sungjin Im, Mahshid Montazer Qaem, Benjamin Moseley, Xiaorui Sun, Rudy Zhou:
Fast Noise Removal for k-Means Clustering. CoRR abs/2003.02433 (2020) - [i31]Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian:
Approximate Aggregate Queries Under Additive Inequalities. CoRR abs/2003.10588 (2020) - [i30]Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian:
A Relational Gradient Descent Algorithm For Support Vector Machine Training. CoRR abs/2005.05325 (2020) - [i29]Benjamin Berg, Mor Harchol-Balter, Benjamin Moseley, Weina Wang, Justin Whitehouse:
Optimal Resource Allocation for Elastic and Inelastic Jobs. CoRR abs/2005.09745 (2020) - [i28]Robert D. Carr, Jennifer Iglesias, Giuseppe Lancia, Benjamin Moseley:
Symmetric Linear Programming Formulations for Minimum Cut with Applications to TSP. CoRR abs/2005.11912 (2020) - [i27]Sara Ahmadian, Alessandro Epasto, Marina Knittel, Ravi Kumar, Mohammad Mahdian, Benjamin Moseley, Philip Pham, Sergei Vassilvitskii, Yuyan Wang:
Fair Hierarchical Clustering. CoRR abs/2006.10221 (2020) - [i26]Benjamin Moseley, Kirk Pruhs, Alireza Samadian, Yuyan Wang:
Relational Algorithms for k-means Clustering. CoRR abs/2008.00358 (2020) - [i25]Benjamin Moseley, Yuyan Wang:
An Objective for Hierarchical Clustering in Euclidean Space and its Connection to Bisecting K-means. CoRR abs/2008.13235 (2020) - [i24]Anupam Gupta, Benjamin Moseley, Rudy Zhou:
Structural Iterative Rounding for Generalized k-Median Problems. CoRR abs/2009.00808 (2020) - [i23]Thomas Lavastida, Benjamin Moseley, R. Ravi, Chenyang Xu:
Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing. CoRR abs/2011.11743 (2020) - [i22]Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian:
Instance Optimal Join Size Estimation. CoRR abs/2012.08083 (2020)
2010 – 2019
- 2019
- [j16]Kyle Fox, Sungjin Im, Janardhan Kulkarni, Benjamin Moseley:
Non-clairvoyantly Scheduling to Minimize Convex Functions. Algorithmica 81(9): 3746-3764 (2019) - [c65]Benjamin Moseley, Maxim Sviridenko:
Submodular Optimization with Contention Resolution Extensions. APPROX-RANDOM 2019: 3:1-3:17 - [c64]Giorgio Lucarelli, Benjamin Moseley, Kim Thang Nguyen, Abhinav Srivastav, Denis Trystram:
Online Non-Preemptive Scheduling to Minimize Maximum Weighted Flow-Time on Related Machines. FSTTCS 2019: 24:1-24:12 - [c63]Benjamin Moseley:
Scheduling to Approximate Minimization Objectives on Identical Machines. ICALP 2019: 86:1-86:14 - [c62]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Manish Purohit:
Matroid Coflow Scheduling. ICALP 2019: 145:1-145:14 - [c61]Kunal Agrawal, I-Ting Angelina Lee, Jing Li, Kefu Lu, Benjamin Moseley:
Practically Efficient Scheduler for Minimizing Average Flow Time of Parallel Jobs. IPDPS 2019: 134-144 - [c60]Ayan Chakrabarti, Benjamin Moseley:
Backprop with Approximate Activations for Memory-efficient Network Training. NeurIPS 2019: 2426-2435 - [c59]Shali Jiang, Roman Garnett, Benjamin Moseley:
Cost Effective Active Search. NeurIPS 2019: 4881-4890 - [c58]Silvio Lattanzi, Thomas Lavastida, Kefu Lu, Benjamin Moseley:
A Framework for Parallelizing Hierarchical Clustering Methods. ECML/PKDD (1) 2019: 73-89 - [c57]Mahmoud Abo Khamis, Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
On Functional Aggregate Queries with Additive Inequalities. PODS 2019: 414-431 - [i21]Ayan Chakrabarti, Benjamin Moseley:
Backprop with Approximate Activations for Memory-efficient Network Training. CoRR abs/1901.07988 (2019) - [i20]Sungjin Im, Benjamin Moseley:
A Conditional Lower Bound on Graph Connectivity in MapReduce. CoRR abs/1904.08954 (2019) - [i19]Benjamin Moseley:
Scheduling to Approximate Minimization Objectives on Identical Machines. CoRR abs/1904.09667 (2019) - [i18]Ryan R. Curtin, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian:
On Coresets for Regularized Loss Minimization. CoRR abs/1905.10845 (2019) - [i17]Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
Rk-means: Fast Clustering for Relational Data. CoRR abs/1910.04939 (2019) - 2018
- [j15]Roozbeh Ebrahimi, Samuel McCauley, Benjamin Moseley:
Scheduling Parallel Jobs Online with Convex and Concave Parallelizability. Theory Comput. Syst. 62(2): 304-318 (2018) - [j14]Jacek Blazewicz, Benjamin Moseley, Erwin Pesch, Denis Trystram, Guochuan Zhang:
New challenges in scheduling theory. J. Sched. 21(6): 581-582 (2018) - [j13]Kyle Fox, Sungjin Im, Benjamin Moseley:
Energy efficient scheduling of parallelizable jobs. Theor. Comput. Sci. 726: 30-40 (2018) - [c56]Giorgio Lucarelli, Benjamin Moseley, Kim Thang Nguyen, Abhinav Srivastav, Denis Trystram:
Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines. ESA 2018: 59:1-59:12 - [c55]Kunal Agrawal, Jing Li, Kefu Lu, Benjamin Moseley:
Scheduling Parallelizable Jobs Online to Maximize Throughput. LATIN 2018: 755-776 - [c54]Shali Jiang, Gustavo Malkomes, Matthew Abbott, Benjamin Moseley, Roman Garnett:
Efficient nonmyopic batch active search. NeurIPS 2018: 1107-1117 - [c53]Giorgio Lucarelli, Benjamin Moseley, Kim Thang Nguyen, Abhinav Srivastav, Denis Trystram:
Online Non-preemptive Scheduling on Unrelated Machines with Rejections. SPAA 2018: 291-300 - [i16]Giorgio Lucarelli, Benjamin Moseley, Kim Thang Nguyen, Abhinav Srivastav, Denis Trystram:
Online Non-preemptive Scheduling on Unrelated Machines with Rejections. CoRR abs/1802.10309 (2018) - [i15]Giorgio Lucarelli, Benjamin Moseley, Kim Thang Nguyen, Abhinav Srivastav, Denis Trystram:
Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines. CoRR abs/1804.08317 (2018) - [i14]Bryce Bagley, Blake Bordelon, Benjamin Moseley, Ralf Wessel:
Pre-Synaptic Pool Modification (PSPM): A Supervised Learning Procedure for Spiking Neural Networks. CoRR abs/1810.03199 (2018) - [i13]Shali Jiang, Gustavo Malkomes, Benjamin Moseley, Roman Garnett:
Efficient nonmyopic active search with applications in drug and materials discovery. CoRR abs/1811.08871 (2018) - [i12]Mahmoud Abo Khamis, Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
On Functional Aggregate Queries with Additive Inequalities. CoRR abs/1812.09526 (2018) - 2017
- [j12]Michael A. Bender, Jonathan W. Berry, Simon D. Hammond, K. Scott Hemmert, Samuel McCauley, Branden Moore, Benjamin Moseley, Cynthia A. Phillips, David S. Resnick, Arun Rodrigues:
Two-level main memory co-design: Multi-threaded algorithmic primitives, analysis, and simulation. J. Parallel Distributed Comput. 102: 213-228 (2017) - [j11]Shalmoli Gupta, Ravi Kumar, Kefu Lu, Benjamin Moseley, Sergei Vassilvitskii:
Local Search Methods for k-Means with Outliers. Proc. VLDB Endow. 10(7): 757-768 (2017) - [c52]Gustavo Malkomes, Kefu Lu, Blakeley Hoffman, Roman Garnett, Benjamin Moseley, Richard P. Mann:
Cooperative Set Function Optimization Without Communication or Coordination. AAMAS 2017: 1109-1118 - [c51]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein:
Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing. ESA 2017: 51:1-51:10 - [c50]Shali Jiang, Gustavo Malkomes, Geoff Converse, Alyssa Shofner, Benjamin Moseley, Roman Garnett:
Efficient Nonmyopic Active Search. ICML 2017: 1714-1723 - [c49]Varun Gupta, Benjamin Moseley, Marc Uetz, Qiaomin Xie:
Stochastic Online Scheduling on Unrelated Machines. IPCO 2017: 228-240 - [c48]Sungjin Im, Shi Li, Benjamin Moseley:
Breaking 1 - 1/e Barrier for Non-preemptive Throughput Maximization. IPCO 2017: 292-304 - [c47]Benjamin Moseley, Joshua R. Wang:
Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search. NIPS 2017: 3094-3103 - [c46]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein:
An O(Log Log m)-Competitive Algorithm for Online Machine Minimization. RTSS 2017: 343-350 - [c45]Sungjin Im, Benjamin Moseley:
Fair Scheduling via Iterative Quasi-Uniform Sampling. SODA 2017: 2601-2615 - [c44]Kunal Agrawal, Jing Li, Kefu Lu, Benjamin Moseley:
Brief Announcement: Scheduling Parallelizable Jobs Online to Maximize Throughput. SPAA 2017: 87-89 - [c43]Sungjin Im, Benjamin Moseley, Xiaorui Sun:
Efficient massively parallel methods for dynamic programming. STOC 2017: 798-811 - [i11]Varun Gupta, Benjamin Moseley, Marc Uetz, Qiaomin Xie:
Stochastic Online Scheduling on Unrelated Machines. CoRR abs/1703.01634 (2017) - [i10]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein:
An O(log log m)-competitive Algorithm for Online Machine Minimization. CoRR abs/1708.09046 (2017) - 2016
- [j10]Jacek Blazewicz, Benjamin Moseley, Erwin Pesch, Denis Trystram, Guochuan Zhang:
New challenges in scheduling theory. J. Sched. 19(6): 617-618 (2016) - [j9]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Eric Torng:
Competitively Scheduling Tasks with Intermediate Parallelizability. ACM Trans. Parallel Comput. 3(1): 4:1-4:19 (2016) - [c42]Sungjin Im, Janardhan Kulkarni, Benjamin Moseley, Kamesh Munagala:
A Competitive Flow Time Algorithm for Heterogeneous Clusters Under Polytope Constraints. APPROX-RANDOM 2016: 10:1-10:15 - [c41]Shaurya Ahuja, Kefu Lu, Benjamin Moseley:
Partitioned Feasibility Tests for Sporadic Tasks on Heterogeneous Machines. IPDPS 2016: 1013-1020 - [c40]Kunal Agrawal, Jing Li, Kefu Lu, Benjamin Moseley:
Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time. SODA 2016: 176-189 - [c39]Sungjin Im, Benjamin Moseley:
General Profit Scheduling and the Power of Migration on Heterogeneous Machines. SPAA 2016: 165-173 - [c38]Kunal Agrawal, Jing Li, Kefu Lu, Benjamin Moseley:
Scheduling Parallelizable Jobs Online to Minimize the Maximum Flow Time. SPAA 2016: 195-205 - 2015
- [j8]Benjamin Moseley:
Scheduling to minimize energy and flow time in broadcast scheduling. J. Sched. 18(1): 107-118 (2015) - [j7]Ravi Kumar, Benjamin Moseley, Sergei Vassilvitskii, Andrea Vattani:
Fast Greedy Algorithms in MapReduce and Streaming. ACM Trans. Parallel Comput. 2(3): 14:1-14:22 (2015) - [c37]Noa Avigdor-Elgrabli, Sungjin Im, Benjamin Moseley, Yuval Rabani:
On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs. ICALP (1) 2015: 78-90 - [c36]Sungjin Im, Benjamin Moseley:
Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities. ICALP (1) 2015: 737-748 - [c35]Michael A. Bender, Jonathan W. Berry, Simon D. Hammond, K. Scott Hemmert, Samuel McCauley, Branden Moore, Benjamin Moseley, Cynthia A. Phillips, David S. Resnick, Arun Rodrigues:
Two-Level Main Memory Co-Design: Multi-threaded Algorithmic Primitives, Analysis, and Simulation. IPDPS 2015: 835-846 - [c34]