English
Related papers

Related papers: Online Rack Placement in Large-Scale Data Centers:…

200 papers

With the growing demand for latency-critical and computation-intensive Internet of Things (IoT) services, the IoT-oriented network architecture, mobile edge computing (MEC), has emerged as a promising technique to reinforce the computation…

Information Theory · Computer Science 2022-08-09 Jiechen Chen , Hong Xing , Xiaohui Lin , Arumugam Nallanathan , Suzhi Bi

Contemporary industrial parks are challenged by the growing concerns about high cost and low efficiency of energy supply. Moreover, in the case of uncertain supply/demand, how to mobilize delay-tolerant elastic loads and compensate…

Systems and Control · Electrical Eng. & Systems 2022-04-11 Dafeng Zhu , Bo Yang , Chengbin Ma , Zhaojian Wang , Shanying Zhu , Kai Ma , Xinping Guan

Resource allocation problems in many computer systems can be formulated as mathematical optimization problems. However, finding exact solutions to these problems using off-the-shelf solvers is often intractable for large problem sizes with…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-10-25 Deepak Narayanan , Fiodar Kazhamiaka , Firas Abuzaid , Peter Kraft , Akshay Agrawal , Srikanth Kandula , Stephen Boyd , Matei Zaharia

We initiate the study of a natural and practically relevant new variant of online caching where the to-be-cached items can have dependencies. We assume that the universe is a tree T and items are tree nodes; we require that if a node v is…

Data Structures and Algorithms · Computer Science 2017-05-16 Marcin Bienkowski , Jan Marcinkowski , Maciej Pacut , Stefan Schmid , Aleksandra Spyra

In this paper, we consider the service caching and the computing resource allocation in edge computing (EC) enabled networks. We introduce a random service caching design considering multiple types of latency sensitive services and the base…

Networking and Internet Architecture · Computer Science 2023-01-20 Mingun Kim , Hewon Cho , Ying Cui , Jemin Lee

In this paper, we study a data caching problem in the cloud environment, where multiple frequently co-utilised data items could be packed as a single item being transferred to serve a sequence of data requests dynamically with reduced cost.…

Data Structures and Algorithms · Computer Science 2022-08-08 Jiashu Wu , Hao Dai , Yang Wang , Yong Zhang , Dong Huang , Chengzhong Xu

A key strategy to build disaster-resilient clouds is to employ backups of virtual machines in a geo-distributed infrastructure. Today, the continuous and acknowledged replication of virtual machines in different servers is a service…

Networking and Internet Architecture · Computer Science 2015-10-21 Rodrigo de Souza Couto , Stefano Secci , Miguel Elias Mitre Campista , Luís Henrique Maciel Kosmalski Costa

With the rapid development of connecting massive devices to the Internet, especially for remote areas without cellular network infrastructures, space-air-ground integrated networks (SAGINs) emerge and offload computation-intensive tasks. In…

Information Theory · Computer Science 2022-06-07 Yali Chen , Bo Ai , Yong Niu , Hongliang Zhang , Zhu Han

Cloud computing is emerging as an important platform for business, personal and mobile computing applications. In this paper, we study a stochastic model of cloud computing, where jobs arrive according to a stochastic process and request…

Performance · Computer Science 2012-06-07 Siva Theja Maguluri , R Srikant , Lei Ying

We propose a disruptive paradigm to actively place and schedule TWhrs of parallel AI jobs strategically on the grid, at distributed, grid-aware high performance compute data centers (HPC) capable of using their massive power and energy load…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-04-08 Scott C Evans , Nathan Dahlin , Ibrahima Ndiaye , Sachini Piyoni Ekanayake , Alexander Duncan , Blake Rose , Hao Huang

In the online balanced graph repartitioning problem, one has to maintain a clustering of $n$ nodes into $\ell$ clusters, each having $k = n / \ell$ nodes. During runtime, an online algorithm is given a stream of communication requests…

Data Structures and Algorithms · Computer Science 2021-08-26 Marcin Bienkowski , Martin Böhm , Martin Koutecký , Thomas Rothvoß , Jiří Sgall , Pavel Veselý

In the online sorting problem, $n$ items are revealed one by one and have to be placed (immediately and irrevocably) into empty cells of a size-$n$ array. The goal is to minimize the sum of absolute differences between items in consecutive…

Data Structures and Algorithms · Computer Science 2024-06-28 Mikkel Abrahamsen , Ioana O. Bercea , Lorenzo Beretta , Jonas Klausen , László Kozma

Existing approaches to resource allocation for nowadays stochastic networks are challenged to meet fast convergence and tolerable delay requirements. The present paper leverages online learning advances to facilitate stochastic resource…

Optimization and Control · Mathematics 2017-05-24 Tianyi Chen , Aryan Mokhtari , Xin Wang , Alejandro Ribeiro , Georgios B. Giannakis

Imagine yourself moving to another place, and therefore, you need to pack all of your belongings into moving boxes with some capacity. In the classical bin packing model, you would try to minimize the number of boxes, knowing the exact size…

Data Structures and Algorithms · Computer Science 2025-05-15 Matthias Gehnen , Andreas Usdenski

Motivated by the application of energy storage management in electricity markets, this paper considers the problem of online linear programming with inventory management constraints. Specifically, a decision maker should satisfy some units…

Data Structures and Algorithms · Computer Science 2019-01-15 Lin Yang , Mohammad H. Hajiesmaili , Ramesh Sitaraman , Enrique Mallada , Wing S. Wong , Adam Wierman

While test-time scaling has enabled large language models to solve highly difficult tasks, state-of-the-art results come at exorbitant compute costs. These inefficiencies can be attributed to the miscalibration of post-trained language…

Machine Learning · Computer Science 2026-04-02 Cai Zhou , Zekai Wang , Menghua Wu , Qianyu Julie Zhu , Flora C. Shi , Chenyu Wang , Ashia Wilson , Tommi Jaakkola , Stephen Bates

We consider the online vector packing problem in which we have a $d$ dimensional knapsack and items $u$ with weight vectors $\mathbf{w}_u \in \mathbb{R}_+^d$ arrive online in an arbitrary order. Upon the arrival of an item, the algorithm…

Discrete Mathematics · Computer Science 2017-06-22 T-H. Hubert Chan , Shaofeng H. -C. Jiang , Zhihao Gavin Tang , Xiaowei Wu

Decarbonizing long-haul freight requires large-scale deployment of high-power charging infrastructure. This paper studies a multi-period charging station location problem that determines where and when to deploy charging capacity for…

Resource allocation for cloud services is a complex task due to the diversity of the services and the dynamic workloads. One way to address this is by overprovisioning which results in high cost due to the unutilized resources. A much more…

Data Structures and Algorithms · Computer Science 2015-03-10 Galia Shabtai , Danny Raz , Yuval Shavitt

Given the rapid rise in energy demand by data centers and computing systems in general, it is fundamental to incorporate energy considerations when designing (scheduling) algorithms. Machine learning can be a useful approach in practice by…

Data Structures and Algorithms · Computer Science 2021-12-07 Antonios Antoniadis , Peyman Jabbarzade Ganje , Golnoosh Shahkarami
‹ Prev 1 4 5 6 7 8 10 Next ›