Search results for "non-clairvoyant"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
120	Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting, Isaac Kar-Keung To, Prudence W. H. Wong	Sleep with Guilt and Work Faster to Minimize Flow Plus Energy.	ICALP (1)	2009	DBLP DOI BibTeX RDF
78	Keqin Li 0001	Average-Case Performance Analysis of Online Non-clairvoyant Scheduling of Parallel Tasks with Precedence Constraints.	IPDPS	2007	DBLP DOI BibTeX RDF
78	Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir	Transactional contention management as a non-clairvoyant scheduling problem.	PODC	2006	DBLP DOI BibTeX RDF	scheduling, concurrency control, transactions, contention management, software transactional memory
78	Hongyang Sun 0001, Yangjie Cao, Wen-Jing Hsu	Non-clairvoyant speed scaling for batched parallel jobs on multiprocessors.	Conf. Computing Frontiers	2009	DBLP DOI BibTeX RDF	batched parallel jobs, non-clairvoyant, power budget, simulations, scheduling, multiprocessors, energy consumption, flow time, speed scaling
78	Nikhil Bansal 0001, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha	Non-Clairvoyant Scheduling for Minimizing Mean Slowdown.	Algorithmica	2004	DBLP DOI BibTeX RDF	Non-clairvoyant algorithms, Resourcelinebreak[4] augmentation, Scheduling, Online algorithms, Slowdown
69	Hongyang Sun 0001, Yangjie Cao, Wen-Jing Hsu	Competitive Two-Level Adaptive Scheduling Using Resource Augmentation.	JSSPP	2009	DBLP DOI BibTeX RDF	Malleable jobs, Non-clairvoyant algorithm, Resource augmentation analysis, Two-level adaptive scheduling, Simulations, Online scheduling, Mean response time
69	Julien Robert, Nicolas Schabanel	Pull-based data broadcast with dependencies: be fair to users, not to items.	SODA	2007	DBLP BibTeX RDF	correlation-based, multicast scheduling, non-clairvoyant scheduling, pull-based broadcast, resource augmentation
59	Julien Robert, Nicolas Schabanel	Non-clairvoyant scheduling with precedence constraints.	SODA	2008	DBLP BibTeX RDF	equi-partition, non-clairvoyant algorithm, fairness, online scheduling, precedences
59	Julien Robert, Nicolas Schabanel	Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough.	ESA	2007	DBLP DOI BibTeX RDF	Non-clairvoyant algorithm, Equi-partition, Makespan and Overall Set Completion Time minimization, Fairness, Online scheduling, Batch scheduling
53	Nikhil Bansal 0001, Kedar Dhamdhere	Minimizing weighted flow time.	SODA	2003	DBLP BibTeX RDF
52	Yuxiong He, Wen-Jing Hsu, Charles E. Leiserson	Provably Efficient Online Nonclairvoyant Adaptive Scheduling.	IEEE Trans. Parallel Distributed Syst.	2008	DBLP DOI BibTeX RDF
46	Yuxiong He, Wen-Jing Hsu, Charles E. Leiserson	Provably Efficient Online Non-clairvoyant Adaptive Scheduling.	IPDPS	2007	DBLP DOI BibTeX RDF
43	Christoph Dürr, Kim Thang Nguyen	Non-clairvoyant Scheduling Games.	SAGT	2009	DBLP DOI BibTeX RDF
37	Chandra Chekuri, Ashish Goel, Sanjeev Khanna, Amit Kumar 0001	Multi-processor scheduling to minimize flow time with epsilon resource augmentation.	STOC	2004	DBLP DOI BibTeX RDF	multi-processor scheduling, load balancing, online algorithms, stretch, resource augmentation, flow time
35	Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prudence W. H. Wong	Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count.	ESA	2008	DBLP DOI BibTeX RDF
35	Yuxiong He, Hongyang Sun 0001, Wen-Jing Hsu	Adaptive Scheduling of Parallel Jobs on Functionally Heterogeneous Resources.	ICPP	2007	DBLP DOI BibTeX RDF
35	Jeff Edmonds, Suprakash Datta, Patrick W. Dymond	TCP is competitive against a limited adversary.	SPAA	2003	DBLP DOI BibTeX RDF	scheduling, performance evaluation, congestion control, TCP/IP, competitive analysis
35	Fabrício Alves Barbosa da Silva, Luís Miguel Campos, Isaac D. Scherson	A Lower Bound for Dynamic Scheduling of Data Parallel Programs.	Euro-Par	1998	DBLP DOI BibTeX RDF
29	Rafael Ferreira da Silva	A science-gateway for workflow executions : Online and non-clairvoyant self-healing of workflow executions on grids. (Auto-guérison en ligne et non clairvoyante des exécutions de chaînes de traitement sur grilles de calcul : Méthodes et évaluation dans une science-gateway pour l'imagerie médicale).		2013	RDF
25	Libin Liu 0001, Chengxi Gao, Peng Wang 0037, Hongming Huang, Jiamin Li, Hong Xu 0001, Wei Zhang 0049	Bottleneck-Aware Non-Clairvoyant Coflow Scheduling With Fai.	IEEE Trans. Cloud Comput.	2023	DBLP DOI BibTeX RDF
25	Sungjin Im, Ravi Kumar 0001, Mahshid Montazer Qaem, Manish Purohit	Non-clairvoyant Scheduling with Predictions.	ACM Trans. Parallel Comput.	2023	DBLP DOI BibTeX RDF
25	Evripidis Bampis, Alexander V. Kononov, Giorgio Lucarelli, Fanny Pascual	Non-Clairvoyant Makespan Minimization Scheduling with Predictions.	ISAAC	2023	DBLP DOI BibTeX RDF
25	Sven Jäger 0001, Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt, Philipp Warode	Competitive Kill-and-Restart and Preemptive Strategies for Non-clairvoyant Scheduling.	IPCO	2023	DBLP DOI BibTeX RDF
25	Keqin Li 0001	Non-clairvoyant and randomised online task offloading in mobile edge computing.	Int. J. Parallel Emergent Distributed Syst.	2022	DBLP DOI BibTeX RDF
25	Sven Jäger 0001, Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt, Philipp Warode	Competitive Kill-and-Restart and Preemptive Strategies for Non-Clairvoyant Scheduling.	CoRR	2022	DBLP DOI BibTeX RDF
25	Alexander Lindermayr, Nicole Megow	Non-Clairvoyant Scheduling with Predictions Revisited.	CoRR	2022	DBLP BibTeX RDF
25	Sungjin Im	Non-clairvoyant Scheduling with Predictions.	ISAIM	2022	DBLP BibTeX RDF
25	Alexander Lindermayr, Nicole Megow	Permutation Predictions for Non-Clairvoyant Scheduling.	SPAA	2022	DBLP DOI BibTeX RDF
25	Yuan Deng, Vahab S. Mirrokni, Song Zuo	Non-Clairvoyant Dynamic Mechanism Design with Budget Constraints and Beyond.	EC	2021	DBLP DOI BibTeX RDF
25	Sungjin Im, Ravi Kumar 0001, Mahshid Montazer Qaem, Manish Purohit	Non-Clairvoyant Scheduling with Predictions.	SPAA	2021	DBLP DOI BibTeX RDF
25	Akhil Bhimaraju, Debanuj Nayak, Rahul Vaze	Non-clairvoyant Scheduling of Coflows.	CoRR	2020	DBLP BibTeX RDF
25	Akhil Bhimaraju, Debanuj Nayak, Rahul Vaze	Non-clairvoyant Scheduling of Coflows. (PDF / PS)	WiOpt	2020	DBLP BibTeX RDF
25	Hongyang Sun 0001	Non-clairvoyant scheduling with conflicts for unit-size jobs.	Inf. Process. Lett.	2019	DBLP DOI BibTeX RDF
25	Keqin Li 0001	Non-clairvoyant scheduling of independent parallel tasks on single and multiple multicore processors.	J. Parallel Distributed Comput.	2019	DBLP DOI BibTeX RDF
25	Naveen Garg 0001, Anupam Gupta 0001, Amit Kumar 0001, Sahil Singla 0001	Non-clairvoyant Precedence Constrained Scheduling.	CoRR	2019	DBLP BibTeX RDF
25	Naveen Garg 0001, Anupam Gupta 0001, Amit Kumar 0001, Sahil Singla 0001	Non-Clairvoyant Precedence Constrained Scheduling.	ICALP	2019	DBLP DOI BibTeX RDF
25	Yuan Deng, Sébastien Lahaie, Vahab S. Mirrokni	A Robust Non-Clairvoyant Dynamic Mechanism for Contextual Auctions.	NeurIPS	2019	DBLP BibTeX RDF
25	Sina Mahmoodi Khorandi, Mohsen Sharifi	Non-clairvoyant online scheduling of synchronized jobs on virtual clusters.	J. Supercomput.	2018	DBLP DOI BibTeX RDF
25	Pawan Singh	Energy efficient non-clairvoyant scheduling for unbounded-speed multi-core machines.	Comput. Electr. Eng.	2018	DBLP DOI BibTeX RDF
25	Sungjin Im, Janardhan Kulkarni, Kamesh Munagala	Competitive Algorithms from Competitive Equilibria: Non-Clairvoyant Scheduling under Polyhedral Constraints.	J. ACM	2018	DBLP DOI BibTeX RDF
25	Vahab S. Mirrokni, Renato Paes Leme, Pingzhong Tang, Song Zuo	Non-clairvoyant Dynamic Mechanism Design.	EC	2018	DBLP DOI BibTeX RDF
25	Pawan Singh, Nirayo Hailu Gebreegziabher	Energy-aware online non-clairvoyant multiprocessor scheduling: multiprocessor priority round robin.	IET Comput. Digit. Tech.	2017	DBLP DOI BibTeX RDF
25	Pawan Singh, Berhane Wolde-Gabriel	Executed-time Round Robin: EtRR an online non-clairvoyant scheduling on speed bounded processor with energy management.	J. King Saud Univ. Comput. Inf. Sci.	2017	DBLP DOI BibTeX RDF
25	Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers	Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times.	CoRR	2017	DBLP BibTeX RDF
25	Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers	Non-clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times.	WAOA	2017	DBLP DOI BibTeX RDF
25	Anne Benoit, Louis-Claude Canon, Loris Marchal	Non-clairvoyant reduction algorithms for heterogeneous platforms.	Concurr. Comput. Pract. Exp.	2015	DBLP DOI BibTeX RDF
25	Jianqiao Zhu, Ho-Leung Chan, Tak Wah Lam	Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models.	Theory Comput. Syst.	2015	DBLP DOI BibTeX RDF
25	Yossi Azar, Nikhil R. Devanur, Zhiyi Huang 0002, Debmalya Panigrahi	Speed Scaling in the Non-clairvoyant Model.	SPAA	2015	DBLP DOI BibTeX RDF
25	Rafael Ferreira da Silva, Tristan Glatard, Frédéric Desprez	Controlling fairness and task granularity in distributed, online, non-clairvoyant workflow executions.	Concurr. Comput. Pract. Exp.	2014	DBLP DOI BibTeX RDF
25	Sungjin Im, Janardhan Kulkarni, Kamesh Munagala	Competitive Algorithms from Competitive Equilibria: Non-Clairvoyant Scheduling under Polyhedral Constraints.	CoRR	2014	DBLP BibTeX RDF
25	Sungjin Im, Janardhan Kulkarni, Kamesh Munagala	Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints.	STOC	2014	DBLP DOI BibTeX RDF
25	Rafael Ferreira da Silva, Tristan Glatard, Frédéric Desprez	On-Line, Non-clairvoyant Optimization of Workflow Activity Granularity on Grids.	Euro-Par	2013	DBLP DOI BibTeX RDF
25	Anne Benoit, Louis-Claude Canon, Loris Marchal	Non-clairvoyant Reduction Algorithms for Heterogeneous Platforms.	Euro-Par Workshops	2013	DBLP DOI BibTeX RDF
25	Rafael Ferreira da Silva, Tristan Glatard, Frédéric Desprez	Workflow Fairness Control on Online and Non-clairvoyant Distributed Computing Platforms.	Euro-Par	2013	DBLP DOI BibTeX RDF
25	Kyle Fox, Sungjin Im, Janardhan Kulkarni, Benjamin Moseley	Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions.	APPROX-RANDOM	2013	DBLP DOI BibTeX RDF
25	Ho-Leung Chan, Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee, Jianqiao Zhu	Non-clairvoyant weighted flow time scheduling with rejection penalty.	SPAA	2012	DBLP DOI BibTeX RDF
25	Mohammad Reza Hoseiny Farahabady, Young Choon Lee, Albert Y. Zomaya	Non-clairvoyant Assignment of Bag-of-Tasks Applications Across Multiple Clouds.	PDCAT	2012	DBLP DOI BibTeX RDF
25	Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting, Pan Zhang	Non-clairvoyant Scheduling for Weighted Flow Time and Energy on Speed Bounded Processors.	Chic. J. Theor. Comput. Sci.	2011	DBLP BibTeX RDF
25	Johanne Cohen, Christoph Dürr, Kim Thang Nguyen	Non-clairvoyant Scheduling Games.	Theory Comput. Syst.	2011	DBLP DOI BibTeX RDF
25	Johanne Cohen, Christoph Dürr, Kim Thang Nguyen	Non-clairvoyant Scheduling Games	CoRR	2011	DBLP BibTeX RDF
25	Jianqiao Zhu, Ho-Leung Chan, Tak Wah Lam	Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models.	WAOA	2011	DBLP DOI BibTeX RDF
25	Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir	Transactional Contention Management as a Non-Clairvoyant Scheduling Problem.	Algorithmica	2010	DBLP DOI BibTeX RDF
25	Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee	Non-clairvoyant Speed Scaling for Weighted Flow Time.	ESA (1)	2010	DBLP DOI BibTeX RDF
25	Henri Casanova, Matthieu Gallet, Frédéric Vivien	Non-clairvoyant Scheduling of Multiple Bag-of-Tasks Applications.	Euro-Par (1)	2010	DBLP DOI BibTeX RDF
25	Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting, Peng Zhang 0008	Non-clairvoyant Scheduling for Weighted Flow Time and Energy on Speed Bounded Processors.	CATS	2010	DBLP BibTeX RDF
25	Andrei Tchernykh, Denis Trystram, Carlos A. Brizuela, Isaac D. Scherson	Idle regulation in non-clairvoyant scheduling of parallel jobs.	Discret. Appl. Math.	2009	DBLP DOI BibTeX RDF
25	Keqin Li	Average-Case Performance Analysis Of Online Non-Clairvoyant Scheduling Of Parallel Tasks With Precedence Constraints.	Comput. J.	2008	DBLP DOI BibTeX RDF
25	Keqin Li 0001	An average-case analysis of online non-clairvoyant scheduling of independent parallel tasks.	J. Parallel Distributed Comput.	2006	DBLP DOI BibTeX RDF
25	Julien Robert, Nicolas Schabanel	Non-Clairvoyant Batch Sets Scheduling: Fairness is Fair enough	CoRR	2006	DBLP BibTeX RDF
25	Jae-Hoon Kim 0001, Kyung-Yong Chwa	Non-clairvoyant scheduling for weighted flow time.	Inf. Process. Lett.	2003	DBLP DOI BibTeX RDF
25	Jeff Edmonds, Donald D. Chinn, Tim Brecht, Xiaotie Deng	Non-Clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics.	J. Sched.	2003	DBLP DOI BibTeX RDF
25	Nikhil Bansal 0001, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha	Non-clairvoyant Scheduling for Minimizing Mean Slowdown.	STACS	2003	DBLP DOI BibTeX RDF
25	Luca Becchetti, Stefano Leonardi 0001	Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines.	STOC	2001	DBLP DOI BibTeX RDF
25	Jeff Edmonds, Donald D. Chinn, Tim Brecht, Xiaotie Deng	Non-clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics (Extended Abstract).	STOC	1997	DBLP DOI BibTeX RDF
25	Rajeev Motwani 0001, Steven J. Phillips, Eric Torng	Non-Clairvoyant Scheduling.	Theor. Comput. Sci.	1994	DBLP DOI BibTeX RDF
25	Rajeev Motwani 0001, Steven J. Phillips, Eric Torng	Non-Clairvoyant Scheduling.	SODA	1993	DBLP DOI BibTeX RDF
18	Jeff Edmonds, Kirk Pruhs	Scalably scheduling processes with arbitrary speedup curves.	SODA	2009	DBLP DOI BibTeX RDF
18	Piotr Berman, Chris Coulston	Speed is More Powerful than Claivoyance.	SWAT	1998	DBLP DOI BibTeX RDF