Allocating servers in infostations for bounded simultaneous requests

DOI10.1016/J.JPDC.2004.06.003zbMATH Open1114.68012OpenAlexW2013274147MaRDI QIDQ1886380

Yanyan Li

Publication date: 18 November 2004

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: http://eprints.biblio.unitn.it/279/1/74.pdf

zbMATH Keywords

Approximation algorithmsOn-line algorithmsInterval coloringBin-packingGreedy algorithmsInfostationsServer allocation

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Approximation algorithms (68W25)

Recommendations

• Title not available (Why is that?) 👍 👎
• Optimal resource allocation for multiqueue systems with a shared server pool 👍 👎
• Static and dynamic server allocation in systems with on/off sources 👍 👎
• Optimal allocation of servers and processing time in a load balancing system 👍 👎
• Optimal server allocation in general, finite, multi-server queueing networks 👍 👎
• Optimal Dynamic Server Allocation in Systems with On/Off Sources 👍 👎
• Dynamic Server Allocation for Queueing Networks with Flexible Servers 👍 👎
• Optimal Server Allocation in a System of Multi-Server Stations 👍 👎
• On the Optimal Allocation of Servers and Workloads in Closed Queueing Networks 👍 👎

This page was built for publication: Allocating servers in infostations for bounded simultaneous requests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1886380)