AF: EAGER: Scheduling with Resource Contraints
AF:EAGER:具有资源约束的调度
基本信息
- 批准号:1349602
- 负责人:
- 金额:$ 10万
- 依托单位:
- 依托单位国家:美国
- 项目类别:Standard Grant
- 财政年份:2013
- 资助国家:美国
- 起止时间:2013-09-01 至 2015-08-31
- 项目状态:已结题
- 来源:
- 关键词:
项目摘要
Even as the availability of computing power, network bandwidth and other resources increases at a rapid rate, users and applications increase their demand for computation and their use of resources at roughly the same pace. Thus, no matter how much progress is made on hardware efficiency, we will always need efficient algorithms to manage these resources. The philosophy of managing additional resources in an intelligent manner goes beyond computer systems, and is relevant to many other scientific and industrial areas. In various real-life systems, processing times may be controllable by allocating resources, such as additional money, overtime, energy, fuel, catalysts, subcontracting, or additional manpower, to the job operations. In such systems, job scheduling and resource allocation decisions should be coordinated carefully to achieve the most efficient system performance. Applications arise in many industrial areas.The PI plans to study several algorithmic problems that arise in scheduling with additional resource constraints. While this field has received much attention over the past ten years and beyond, the PI will focus on two areas that have received very little attention in the computer science community -- scheduling when the benefit of the schedule and the cost of energy or other resources are monetized, and scheduling in models that go beyond the typically studied computer systems setting. Because these have received very little attention, this work is somewhat speculative. If successful, this work could have a high impact, with applications into many new areas. The PI will design simple, low overhead algorithms.
即使计算能力的可用性,网络带宽和其他资源以快速速度增加,用户和应用程序也会增加其对计算的需求以及在大致相同的空间上使用资源的需求。这是,无论硬件效率取得了多少进展,我们将始终需要有效的算法来管理这些资源。以智能方式管理其他资源的理念超出了计算机系统,并且与许多其他科学和工业领域有关。在各种现实生活中,可以通过分配资源来控制处理时间,例如额外的钱,加班,能量,燃料,燃料,催化剂,分包或额外的人力。在这样的系统中,应仔细协调工作计划和资源分配决策,以实现最有效的系统性能。 PI计划在许多工业领域都有应用。尽管该领域在过去十年及以后都受到了很多关注,但PI将重点关注两个领域,这些领域在计算机科学界很少关注的领域 - 安排时间表的收益以及能源或其他资源的收益或其他资源的货币化,并在典型研究的计算机系统设置的模型中进行安排。因为这些受到很少的关注,所以这项工作有些投机。如果成功的话,这项工作可能会产生很大的影响,并将其应用于许多新领域。 PI将设计简单的低顶算法。
项目成果
期刊论文数量(0)
专著数量(0)
科研奖励数量(0)
会议论文数量(0)
专利数量(0)
数据更新时间:{{ journalArticles.updateTime }}
{{
item.title }}
{{ item.translation_title }}
- DOI:
{{ item.doi }} - 发表时间:
{{ item.publish_year }} - 期刊:
- 影响因子:{{ item.factor }}
- 作者:
{{ item.authors }} - 通讯作者:
{{ item.author }}
数据更新时间:{{ journalArticles.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ monograph.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ sciAawards.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ conferencePapers.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ patent.updateTime }}
Clifford Stein其他文献
An <math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll" class="math"><mi>O</mi><mo stretchy="false">(</mo><msup><mi>n</mi><mrow><mn>5</mn><mo stretchy="false">/</mo><mn>2</mn></mrow></msup><mi mathvariant="normal">log</mi><mi>n</mi><mo stretchy="false">)</mo></math> algorithm for the Rectilinear Minimum Link-Distance Problem in three dimensions
- DOI:
10.1016/j.comgeo.2008.04.006 - 发表时间:
2009-07-01 - 期刊:
- 影响因子:
- 作者:
David P. Wagner;Robert Scot Drysdale;Clifford Stein - 通讯作者:
Clifford Stein
Internal Closedness and von Neumann-Morgenstern Stability in Matching Theory: Structures and Complexity
匹配理论中的内部封闭性和冯·诺依曼-摩根斯坦稳定性:结构和复杂性
- DOI:
10.48550/arxiv.2211.17050 - 发表时间:
2022 - 期刊:
- 影响因子:0
- 作者:
Yuri Faenza;Clifford Stein;Jia Wan - 通讯作者:
Jia Wan
Theory of Computing
计算理论
- DOI:
10.4086/toc - 发表时间:
2013 - 期刊:
- 影响因子:0
- 作者:
Alexandr Andoni;Nikhil Bansal;P. Beame;Giuseppe Italiano;Sanjeev Khanna;Ryan O’Donnell;T. Pitassi;T. Rabin;Tim Roughgarden;Clifford Stein;Rocco Servedio;Amir Abboud;Nima Anari;Ibm Srinivasan Arunachalam;T. J. Watson;Research Center;Petra Berenbrink;Aaron Bernstein;Aditya Bhaskara;Sayan Bhattacharya;Eric Blais;H. Bodlaender;Adam Bouland;Anne Broadbent;Mark Bun;Timothy Chan;Arkadev Chattopadhyay;Xue Chen;Gil Cohen;Dana Dachman;Anindya De;Shahar Dobzhinski;Zhiyi Huang;Ken;Robin Kothari;Marvin Künnemann;Tu Kaiserslautern;Rasmus Kyng;E. Zurich;Sophie Laplante;D. Lokshtanov;S. Mahabadi;Nicole Megow;Ankur Moitra;Technion Shay Moran;Google Research;Christopher Musco;Prasad Raghavendra;Alex Russell;Laura Sanità;Alex Slivkins;David Steurer;Epfl Ola Svensson;Chaitanya Swamy;Madhur Tulsiani;Christos Tzamos;Andreas Wiese;Mary Wootters;Huacheng Yu;Aaron Potechin;Aaron Sidford;Aarushi Goel;Aayush Jain;Abhiram Natarajan;Abhishek Shetty;Adam Karczmarz;Adam O’Neill;Aditi Dudeja;Aditi Laddha;Aditya Krishnan;Adrian Vladu Afrouz;J. Ameli;Ainesh Bakshi;Akihito Soeda;Akshay Krishnamurthy;Albert Cheu;A. Grilo;Alex Wein;Alexander Belov;Alexander Block;Alexander Golovnev;Alexander Poremba;Alexander Shen;Alexander Skopalik;Alexandra Henzinger;Alexandros Hollender;Ali Parviz;Alkis Kalavasis;Allen Liu;Aloni Cohen;Amartya Shankha;Biswas Amey;Bhangale Amin;Coja;Yehudayoff Amir;Zandieh Amit;Daniely Amit;Kumar Amnon;Ta;Beimel Anand;Louis Anand Natarajan;Anders Claesson;André Chailloux;André Nusser;Andrea Coladangelo;Andrea Lincoln;Andreas Björklund;Andreas Maggiori;A. Krokhin;A. Romashchenko;Andrej Risteski;Anirban Chowdhury;Anirudh Krishna;A. Mukherjee;Ankit Garg;Anna Karlin;Anthony Leverrier;Antonio Blanca;A. Antoniadis;Anupam Gupta;Anupam Prakash;A. Singh;Aravindan Vijayaraghavan;Argyrios Deligkas;Ariel Kulik;Ariel Schvartzman;Ariel Shaulker;A. Cornelissen;Arka Rai;Choudhuri Arkady;Yerukhimovich Arnab;Bhattacharyya Arthur Mehta;Artur Czumaj;A. Backurs;A. Jambulapati;Ashley Montanaro;A. Sah;A. Mantri;Aviad Rubinstein;Avishay Tal;Badih Ghazi;Bartek Blaszczyszyn;Benjamin Moseley;Benny Pinkas;Bento Natura;Bernhard Haeupler;Bill Fefferman;B. Mance;Binghui Peng;Bingkai Lin;B. Sinaimeri;Bo Waggoner;Bodo Manthey;Bohdan Kivva;Brendan Lucier Bundit;Laekhanukit Burak;Sahinoglu Cameron;Seth Chaodong Zheng;Charles Carlson;Chen;Chenghao Guo;Chenglin Fan;Chenwei Wu;Chethan Kamath;Chi Jin;J. Thaler;Jyun;Kaave Hosseini;Kaito Fujii;Kamesh Munagala;Kangning Wang;Kanstantsin Pashkovich;Karl Bringmann Karol;Wegrzycki Karteek;Sreenivasaiah Karthik;Chandrasekaran Karthik;Sankararaman Karthik;C. S. K. Green;Larsen Kasturi;Varadarajan Keita;Xagawa Kent Quanrud;Kevin Schewior;Kevin Tian;Kilian Risse;Kirankumar Shiragur;K. Pruhs;K. Efremenko;Konstantin Makarychev;Konstantin Zabarnyi;Krišj¯anis Pr¯usis;Kuan Cheng;Kuikui Liu;Kunal Marwaha;Lars Rohwedder László;Kozma László;A. Végh;L'eo Colisson;Leo de Castro;Leonid Barenboim Letong;Li;Li;L. Roditty;Lieven De;Lathauwer Lijie;Chen Lior;Eldar Lior;Rotem Luca Zanetti;Luisa Sinisclachi;Luke Postle;Luowen Qian;Lydia Zakynthinou;Mahbod Majid;Makrand Sinha;Malin Rau Manas;Jyoti Kashyop;Manolis Zampetakis;Maoyuan Song;Marc Roth;Marc Vinyals;Marcin Bieńkowski;Marcin Pilipczuk;Marco Molinaro;Marcus Michelen;Mark de Berg;M. Jerrum;Mark Sellke;Mark Zhandry;Markus Bläser;Markus Lohrey;Marshall Ball;Marthe Bonamy;Martin Fürer;Martin Hoefer;M. Kokainis;Masahiro Hachimori;Matteo Castiglioni;Matthias Englert;Matti Karppa;Max Hahn;Max Hopkins;Maximilian Probst;Gutenberg Mayank Goswami;Mehtaab Sawhney;Meike Hatzel;Meng He;Mengxiao Zhang;Meni Sadigurski;M. Parter;M. Dinitz;Michael Elkin;Michael Kapralov;Michael Kearns;James R. Lee;Sudatta Bhattacharya;Michal Koucký;Hadley Black;Deeparnab Chakrabarty;C. Seshadhri;Mahsa Derakhshan;Naveen Durvasula;Nika Haghtalab;Peter Kiss;Thatchaphol Saranurak;Soheil Behnezhad;M. Roghani;Hung Le;Shay Solomon;Václav Rozhon;Anders Martinsson;Christoph Grunau;G. Z. —. Eth;Zurich;Switzerland;Morris Yau — Massachusetts;Noah Golowich;Dhruv Rohatgi — Massachusetts;Qinghua Liu;Praneeth Netrapalli;Csaba Szepesvári;Debarati Das;Jacob Gilbert;Mohammadtaghi Hajiaghayi;Tomasz Kociumaka;B. Saha;K. Bringmann;Nick Fischer — Weizmann;Ce Jin;Yinzhan Xu — Massachusetts;Virginia Vassilevska Williams;Yinzhan Xu;Josh Alman;Kevin Rao;Hamed Hatami;—. XiangMeng;McGill University;Edith Cohen;Xin Lyu;Tamás Jelani Nelson;Uri Stemmer — Google;Research;Daniel Alabi;Pravesh K. Kothari;Pranay Tankala;Prayaag Venkat;Fred Zhang;Samuel B. Hopkins;Gautam Kamath;Shyam Narayanan — Massachusetts;Marco Gaboardi;R. Impagliazzo;Rex Lei;Satchit Sivakumar;Jessica Sorrell;T. Korhonen;Marco Bressan;Matthias Lanzinger;Huck Bennett;Mahdi Cheraghchi;V. Guruswami;João Ribeiro;Jan Dreier;Nikolas Mählmann;Sebastian Siebertz — TU Wien;The Randomized k ;Conjecture Is;False;Sébastien Bubeck;Christian Coester;Yuval Rabani — Microsoft;Wei;Ethan Mook;Daniel Wichs;Joshua Brakensiek;Sai Sandeep — Stanford;University;Lorenzo Ciardo;Stanislav Živný;Amey Bhangale;Subhash Khot;Dor Minzer;David Ellis;Guy Kindler;Noam Lifshitz;Ronen Eldan;Dan Mikulincer;George Christodoulou;E. Koutsoupias;Annamária Kovács;José Correa;Andrés Cristi;Xi Chen;Matheus Venturyne;Xavier Ferreira;David C. Parkes;Yang Cai;Jinzhao Wu;Zhengyang Liu;Zeyu Ren;Zihe Wang;Ravishankar Krishnaswamy;Shi Li;Varun Suriyanarayana - 通讯作者:
Varun Suriyanarayana
Energy-Efficient Scheduling with Predictions
带预测的节能调度
- DOI:
- 发表时间:
2024 - 期刊:
- 影响因子:0
- 作者:
Eric Balkanski;Noémie Périvier;Clifford Stein;Hao - 通讯作者:
Hao
Cluster Before You Hallucinate: Node-Capacitated Network Design and Energy Efficient Routing
在你产生幻觉之前集群:节点容量网络设计和节能路由
- DOI:
10.1137/20m1360645 - 发表时间:
2024 - 期刊:
- 影响因子:0
- 作者:
Ravishankar Krishnaswamy;Viswanath Nagarajan;K. Pruhs;Clifford Stein - 通讯作者:
Clifford Stein
Clifford Stein的其他文献
{{
item.title }}
{{ item.translation_title }}
- DOI:
{{ item.doi }} - 发表时间:
{{ item.publish_year }} - 期刊:
- 影响因子:{{ item.factor }}
- 作者:
{{ item.authors }} - 通讯作者:
{{ item.author }}
{{ truncateString('Clifford Stein', 18)}}的其他基金
Collaborative Research: AF: Small: Efficient Massively Parallel Algorithms
合作研究:AF:小型:高效大规模并行算法
- 批准号:
2218677 - 财政年份:2022
- 资助金额:
$ 10万 - 项目类别:
Standard Grant
Symposium on Discrete Algorithms Science (SODA) 2019 Travel Grant
离散算法科学研讨会(SODA)2019年旅费资助
- 批准号:
1906903 - 财政年份:2019
- 资助金额:
$ 10万 - 项目类别:
Standard Grant
Symposium on Discrete Algorithms Science (SODA) 2018 Travel Grant
离散算法科学研讨会 (SODA) 2018 年旅费资助
- 批准号:
1807311 - 财政年份:2018
- 资助金额:
$ 10万 - 项目类别:
Standard Grant
SPX: Collaborative Research: Moving Towards Secure and Massive Parallel Computing
SPX:协作研究:迈向安全和大规模并行计算
- 批准号:
1822809 - 财政年份:2018
- 资助金额:
$ 10万 - 项目类别:
Standard Grant
AF:Small:Beyond Worst Case Running time: Algorithms for Routing, Scheduling and Matching
AF:小:超越最坏情况运行时间:路由、调度和匹配算法
- 批准号:
1714818 - 财政年份:2017
- 资助金额:
$ 10万 - 项目类别:
Standard Grant
AF:Small:Scheduling and Routing: Algorithms with novel cost measures
AF:Small:调度和路由:具有新颖成本度量的算法
- 批准号:
1421161 - 财政年份:2014
- 资助金额:
$ 10万 - 项目类别:
Standard Grant
相似国自然基金
渴望及其对农村居民收入差距的影响研究
- 批准号:71903117
- 批准年份:2019
- 资助金额:19.0 万元
- 项目类别:青年科学基金项目
威胁应对视角下的消费者触摸渴望及其补偿机制研究
- 批准号:71502075
- 批准年份:2015
- 资助金额:17.5 万元
- 项目类别:青年科学基金项目
相似海外基金
FoMR: Collaborative Research: Dependent ILP: Dynamic Hoisting and Eager Scheduling of Dependent Instructions
FoMR:协作研究:相关 ILP:相关指令的动态提升和紧急调度
- 批准号:
1823417 - 财政年份:2018
- 资助金额:
$ 10万 - 项目类别:
Standard Grant
FoMR: Collaborative Research: Dependent ILP: Dynamic Hoisting and Eager Scheduling of Dependent Instructions
FoMR:协作研究:相关 ILP:相关指令的动态提升和紧急调度
- 批准号:
1823398 - 财政年份:2018
- 资助金额:
$ 10万 - 项目类别:
Standard Grant
EAGER: Cyber-Manufacturing with Multi-echelon Control and Scheduling
EAGER:多级控制和调度的网络制造
- 批准号:
1547110 - 财政年份:2016
- 资助金额:
$ 10万 - 项目类别:
Standard Grant
EAGER: Cybermanufacturing: Real-Time Scheduling in Networked 3D Printers
EAGER:网络制造:网络 3D 打印机中的实时调度
- 批准号:
1547127 - 财政年份:2015
- 资助金额:
$ 10万 - 项目类别:
Standard Grant
Collaborative Research: EAGER: Renewables: A function space theory for continuous-time flexibility scheduling in electricity markets
合作研究:EAGER:可再生能源:电力市场连续时间灵活性调度的函数空间理论
- 批准号:
1549923 - 财政年份:2015
- 资助金额:
$ 10万 - 项目类别:
Standard Grant