AF:Small:Scheduling and Routing: Algorithms with novel cost measures

AF:Small:调度和路由:具有新颖成本度量的算法

基本信息

  • 批准号:
    1421161
  • 负责人:
  • 金额:
    $ 41.73万
  • 依托单位:
  • 依托单位国家:
    美国
  • 项目类别:
    Standard Grant
  • 财政年份:
    2014
  • 资助国家:
    美国
  • 起止时间:
    2014-09-01 至 2018-08-31
  • 项目状态:
    已结题

项目摘要

Computers, computer systems and the computational infrastructure provided by the internet are now essential for many aspects of modern life.  It is well-known and well-documented that, even as computing power and network bandwidth increase at a rapid rate, users and applications increase their demand for computation and their use of networks at roughly the same pace.  Thus, no matter how much progress is made on the hardware and network ends, efficient algorithms to manage these resources are essential. These efficient algorithms will lead to tremendous savings in both time and money and will have a positive environmental impact. They will also contribute to the decisions that are being made presently about the next generation of the internet, in particular in the design of routing protocols and the management of data centers.It is now well-understood that time and space are not the only resources that need to be carefully managed.  For the past few decades, there has been a growing emphasis on other concerns such as accuracy of solution, availability of information, use of cache, management of disk, etc.  More recently, there has been a growing understanding that energy and power management are also resources that should be carefully managed.  In this project, the PI will study several algorithmic problems that arise in applications such as computer systems and networks.  For each of these, the PI will focus on algorithms for better managing the technologies, and that have objectives that go beyond time or solution quality.  In particular, the project will study energy consumption in both computers and networks, and we will also consider environments in which other resources must be managed, such as minimizing the number of changes to a solution over time. The problem areas studied include power management in routing, power management in scheduling, extending speed scaling to other domains, and online problems with a reassignment cost. The PI will design efficient solutions to important practical problems, and the research will have broader impact.
计算机、计算机系统和互联网提供的计算基础设施现在对于现代生活的许多方面都至关重要,众所周知且有据可查的是,即使计算能力和网络带宽快速增加,用户和应用程序也在增加。他们对计算的需求和对网络的使用大致相同,因此,无论硬件和网络端取得多大进步,管理这些资源的高效算法都是必不可少的,这些高效的算法将带来巨大的节省。时间和金钱,并将产生积极的环境影响。还将有助于目前关于下一代互联网的决策,特别是在路由协议的设计和数据中心的管理方面。现在众所周知,时间和空间并不是唯一的资源在过去的几十年里,人们越来越重视其他问题,例如解决方案的准确性、信息的可用性、缓存的使用、磁盘的管理等。最近,人们的理解也越来越深入。能源和电力管理也是应该谨慎对待的资源在这个项目中,PI 将研究计算机系统和网络等应用中出现的几个算法问题,对于每个问题,PI 将重点关注更好地管理技术的算法,并且这些问题的目标是超越时间或范围的。特别是,该项目将研究计算机和网络的能源消耗,我们还将考虑必须管理其他资源的环境,例如尽量减少解决方案随时间的变化数量。研究的问题领域包括。路由中的电源管理、调度中的电源管理、扩展速度扩展到其他领域,以及具有重新分配成本的在线问题,PI将为重要的实际问题设计有效的解决方案,并且该研究将产生更广泛的影响。

项目成果

期刊论文数量(1)
专著数量(0)
科研奖励数量(0)
会议论文数量(0)
专利数量(0)
Scheduling When You Don't Know the Number of Machines
当您不知道机器数量时进行调度
{{ 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其他文献

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
带预测的节能调度
Internal Closedness and von Neumann-Morgenstern Stability in Matching Theory: Structures and Complexity
匹配理论中的内部封闭性和冯·诺依曼-摩根斯坦稳定性:结构和复杂性
  • DOI:
    10.48550/arxiv.2211.17050
  • 发表时间:
    2022-11-30
  • 期刊:
  • 影响因子:
    0
  • 作者:
    Yuri Faenza;Clifford Stein;Jia Wan
  • 通讯作者:
    Jia Wan
A competitive algorithm for throughput maximization on identical machines
在相同机器上实现吞吐量最大化的竞争算法
  • DOI:
    10.1007/s10107-023-02045-0
  • 发表时间:
    2024-01-10
  • 期刊:
  • 影响因子:
    2.7
  • 作者:
    Benjamin Moseley;K. Pruhs;Clifford Stein;Rudy Zhou
  • 通讯作者:
    Rudy Zhou
Job scheduling in rings
环中的作业调度
  • DOI:
    10.1145/181014.181333
  • 发表时间:
    1994-08-01
  • 期刊:
  • 影响因子:
    0
  • 作者:
    P. Fizzano;D. R. Karger;Clifford Stein;J. Wein
  • 通讯作者:
    J. Wein

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
  • 资助金额:
    $ 41.73万
  • 项目类别:
    Standard Grant
Symposium on Discrete Algorithms Science (SODA) 2019 Travel Grant
离散算法科学研讨会(SODA)2019年旅费资助
  • 批准号:
    1906903
  • 财政年份:
    2019
  • 资助金额:
    $ 41.73万
  • 项目类别:
    Standard Grant
SPX: Collaborative Research: Moving Towards Secure and Massive Parallel Computing
SPX:协作研究:迈向安全和大规模并行计算
  • 批准号:
    1822809
  • 财政年份:
    2018
  • 资助金额:
    $ 41.73万
  • 项目类别:
    Standard Grant
Symposium on Discrete Algorithms Science (SODA) 2018 Travel Grant
离散算法科学研讨会 (SODA) 2018 年旅费资助
  • 批准号:
    1807311
  • 财政年份:
    2018
  • 资助金额:
    $ 41.73万
  • 项目类别:
    Standard Grant
AF:Small:Beyond Worst Case Running time: Algorithms for Routing, Scheduling and Matching
AF:小:超越最坏情况运行时间:路由、调度和匹配算法
  • 批准号:
    1714818
  • 财政年份:
    2017
  • 资助金额:
    $ 41.73万
  • 项目类别:
    Standard Grant
SODA 2017 Travel Grant
SODA 2017 旅行补助金
  • 批准号:
    1701346
  • 财政年份:
    2016
  • 资助金额:
    $ 41.73万
  • 项目类别:
    Standard Grant
SODA 2016 Travel Grant
SODA 2016 旅行补助金
  • 批准号:
    1564184
  • 财政年份:
    2016
  • 资助金额:
    $ 41.73万
  • 项目类别:
    Standard Grant
SODA 2015 Travel Grant
SODA 2015 旅行补助金
  • 批准号:
    1455620
  • 财政年份:
    2014
  • 资助金额:
    $ 41.73万
  • 项目类别:
    Standard Grant
AF: EAGER: Scheduling with Resource Contraints
AF:EAGER:具有资源约束的调度
  • 批准号:
    1349602
  • 财政年份:
    2013
  • 资助金额:
    $ 41.73万
  • 项目类别:
    Standard Grant
SODA 2014 Travel Grant
SODA 2014 旅行补助金
  • 批准号:
    1348439
  • 财政年份:
    2013
  • 资助金额:
    $ 41.73万
  • 项目类别:
    Standard Grant

相似国自然基金

小分子代谢物Catechin与TRPV1相互作用激活外周感觉神经元介导尿毒症瘙痒的机制研究
  • 批准号:
    82371229
  • 批准年份:
    2023
  • 资助金额:
    49 万元
  • 项目类别:
    面上项目
DHEA抑制小胶质细胞Fis1乳酸化修饰减轻POCD的机制
  • 批准号:
    82301369
  • 批准年份:
    2023
  • 资助金额:
    30 万元
  • 项目类别:
    青年科学基金项目
SETDB1调控小胶质细胞功能及参与阿尔茨海默病发病机制的研究
  • 批准号:
    82371419
  • 批准年份:
    2023
  • 资助金额:
    49 万元
  • 项目类别:
    面上项目
PTBP1驱动H4K12la/BRD4/HIF1α复合物-PKM2正反馈环路促进非小细胞肺癌糖代谢重编程的机制研究及治疗方案探索
  • 批准号:
    82303616
  • 批准年份:
    2023
  • 资助金额:
    30 万元
  • 项目类别:
    青年科学基金项目

相似海外基金

AF:Small:Beyond Worst Case Running time: Algorithms for Routing, Scheduling and Matching
AF:小:超越最坏情况运行时间:路由、调度和匹配算法
  • 批准号:
    1714818
  • 财政年份:
    2017
  • 资助金额:
    $ 41.73万
  • 项目类别:
    Standard Grant
AF:Small: Foundations of Transactional Memory Scheduling
AF:Small:事务内存调度的基础
  • 批准号:
    1320835
  • 财政年份:
    2013
  • 资助金额:
    $ 41.73万
  • 项目类别:
    Standard Grant
AF: Small: Algorithms for Matching, Auction, and Scheduling Problems
AF:小:匹配、拍卖和调度问题的算法
  • 批准号:
    1217980
  • 财政年份:
    2012
  • 资助金额:
    $ 41.73万
  • 项目类别:
    Standard Grant
AF: Small: Collaborative Research: Online Scheduling Algorithms for Networked Systems and Applications
AF:小型:协作研究:网络系统和应用程序的在线调度算法
  • 批准号:
    0915681
  • 财政年份:
    2009
  • 资助金额:
    $ 41.73万
  • 项目类别:
    Standard Grant
AF: Small: Collaborative Research: Online Scheduling Algorithms for Networked Systems and Applications
AF:小型:协作研究:网络系统和应用程序的在线调度算法
  • 批准号:
    0915425
  • 财政年份:
    2009
  • 资助金额:
    $ 41.73万
  • 项目类别:
    Standard Grant
{{ showInfoDetail.title }}

作者:{{ showInfoDetail.author }}

知道了