Skip to search formSkip to main contentSkip to account menu

Maximum throughput scheduling

Known as: Maximum throughput resource management 
Maximum throughput scheduling is a procedure for scheduling data packets in a packet-switched best-effort communications network, typically a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
This paper presents some results of experimental trial in high mobility environment for the 5th generation (5G) mobile… 
Highly Cited
2013
Highly Cited
2013
Performance problems pose a significant risk to software vendors. If left undetected, they can lead to lost customers, increased… 
Highly Cited
2011
Highly Cited
2011
Wireless Body Area Network (WBAN) is becoming increasingly important for ubiquitous healthcare, consumer electronics, and… 
Highly Cited
2008
Highly Cited
2008
  • Timo VogtN. Wehn
  • 2008
  • Corpus ID: 26434988
Future mobile and wireless communication networks require flexible modem architectures to support seamless services between… 
Highly Cited
2004
Highly Cited
2004
The quality of service in direct-sequence code-division multiple access (DS-CDMA) can be controlled by a suitable selection of… 
Highly Cited
2003
Highly Cited
2003
Conventionally, microarchitecture designs are mainly guided by the maximum throughput (measured as IPC) and fail to evaluate the… 
Highly Cited
1989
Highly Cited
1989
A Hopfield neural net architecture is proposed to control a crossbar switch in real time in order to effect the switching of… 
Highly Cited
1984
Highly Cited
1984
We consider the use of error correction codes of rate r on top of pseudonoise (PN) sequence coding for code division multiple… 
Highly Cited
1980
Highly Cited
1980
The prime objective of the present paper is to analyze the performance of HDLC Balanced Class of Procedures, i.e., to… 
Highly Cited
1975
Highly Cited
1975
Packet switching over broadcast channels with random access schemes is of current interest for local distribution system and for…