Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,291 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
FIFO (computing and electronics)
Fair queuing
Fairness measure
Max-min fairness
Expand
Broader (1)
Radio resource management
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Experiment of 28 GHz Band 5G super wideband transmission using beamforming and beam tracking in high mobility environment
Tatsunori Obara
,
Y. Inoue
,
Y. Aoki
,
S. Suyama
,
Jaekon Lee
,
Y. Okumura
IEEE International Symposium on Personal, Indoor…
2016
Corpus ID: 25929938
This paper presents some results of experimental trial in high mobility environment for the 5th generation (5G) mobile…
Expand
Highly Cited
2013
Highly Cited
2013
Supporting swift reaction: Automatically uncovering performance problems by systematic experiments
Alexander Wert
,
J. Happe
,
Lucia Happe
International Conference on Software Engineering
2013
Corpus ID: 9379359
Performance problems pose a significant risk to software vendors. If left undetected, they can lead to lost customers, increased…
Expand
Highly Cited
2011
Highly Cited
2011
Throughput and delay limits of IEEE 802.15.6
S. Ullah
,
K. Kwak
IEEE Wireless Communications and Networking…
2011
Corpus ID: 15676223
Wireless Body Area Network (WBAN) is becoming increasingly important for ubiquitous healthcare, consumer electronics, and…
Expand
Highly Cited
2008
Highly Cited
2008
A Reconfigurable ASIP for Convolutional and Turbo Decoding in an SDR Environment
Timo Vogt
,
N. Wehn
IEEE Transactions on Very Large Scale Integration…
2008
Corpus ID: 26434988
Future mobile and wireless communication networks require flexible modem architectures to support seamless services between…
Expand
Highly Cited
2004
Highly Cited
2004
Energy-efficient control of rate and power in DS-CDMA systems
F. Berggren
,
Seong-Lyun Kim
IEEE Transactions on Wireless Communications
2004
Corpus ID: 23335901
The quality of service in direct-sequence code-division multiple access (DS-CDMA) can be controlled by a suitable selection of…
Expand
Highly Cited
2003
Highly Cited
2003
Microarchitecture evaluation with physical planning
J. Cong
,
Ashok Jagannathan
,
G. Reinman
,
Michail Romesis
Proceedings - Design Automation Conference
2003
Corpus ID: 759994
Conventionally, microarchitecture designs are mainly guided by the maximum throughput (measured as IPC) and fail to evaluate the…
Expand
Highly Cited
1989
Highly Cited
1989
A neural net arbitrator for large crossbar packet-switches
A. Marrakchi
,
T. Troudet
1989
Corpus ID: 60885185
A Hopfield neural net architecture is proposed to control a crossbar switch in real time in order to effect the switching of…
Expand
Highly Cited
1984
Highly Cited
1984
Throughput analysis for code division multiple accessing of the spread spectrum channel
J. Hui
IEEE Transactions on Vehicular Technology
1984
Corpus ID: 5505124
We consider the use of error correction codes of rate r on top of pseudonoise (PN) sequence coding for code division multiple…
Expand
Highly Cited
1980
Highly Cited
1980
Balanced HDLC Procedures: A Performance Analysis
W. Bux
,
K. Kümmerle
,
Hong Linh Truong
IEEE Transactions on Communications
1980
Corpus ID: 61323914
The prime objective of the present paper is to analyze the performance of HDLC Balanced Class of Procedures, i.e., to…
Expand
Highly Cited
1975
Highly Cited
1975
On the Capacity of Slotted ALOHA Networks and Some Design Problems
I. Gitman
IEEE Transactions on Communications
1975
Corpus ID: 62234429
Packet switching over broadcast channels with random access schemes is of current interest for local distribution system and for…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE