Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,528,241 papers from all fields of science
Search
Sign In
Create Free Account
High-throughput computing
Known as:
Throughput computing
, High Throughput Computing
, HTC (disambiguation)
Expand
High-throughput computing (HTC) is a computer science term to describe the use of many computing resources over long periods of time to accomplish a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
18 relations
BareMetal
Batch processing
BisQue
Computational physics
Expand
Broader (1)
Parallel computing
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Scalable Spray Deposition Process for High-Performance Carbon Nanotube Gas Sensors
A. Abdellah
,
Ahmed Abdelhalim
,
M. Horn
,
G. Scarpa
,
Paolo Lugli
IEEE transactions on nanotechnology
2013
Corpus ID: 19316115
A significant step toward commercialization of novel carbon nanotube (CNT) electronics involves the development of large area and…
Expand
Review
2011
Review
2011
Overview of femtocell support in advanced WiMAX systems
Ying Li
,
Andreas Mäder
,
L. Fan
,
Anshuman Nigam
,
Joey Chou
IEEE Communications Magazine
2011
Corpus ID: 7365813
The femtocell concept is an integral part of the telecommunication industry's efforts to provide high-throughput, high quality…
Expand
2009
2009
Stochastic Decoding of LDPC Codes over GF(q)
Gabi Sarkis
,
Shie Mannor
,
W. Gross
IEEE International Conference on Communications
2009
Corpus ID: 47482301
Nonbinary LDPC codes have been shown to outperform currently used codes for magnetic recording and several other channels…
Expand
Highly Cited
2006
Highly Cited
2006
Combinatorial and High-Throughput Discovery and Optimization of Catalysts and Materials
R. Potyrailo
,
W. Maier
2006
Corpus ID: 93018148
GENERAL ASPECTS OF COMBINATORIAL MATERIALS SCIENCE Combinatorial Materials and Catalysts Development: Where Are We and How Far…
Expand
Highly Cited
2003
Highly Cited
2003
Direct Back EMF Detection Method for Sensorless Brushless DC (BLDC) Motor Drives
J. Shao
2003
Corpus ID: 61791010
Brushlesss dc (BLDC) motors and their drives are penetrating the market of home appliances, HVAC industry, and automotive…
Expand
2003
2003
Architecture-aware low-density parity-check codes
Mohammad M. Mansour
,
Naresh R Shanbhag
Proceedings of the International Symposium on…
2003
Corpus ID: 15834623
A high-throughput memory-efficient decoder architecture for architecture-aware low-density parity-check (LDPC) codes is proposed…
Expand
Review
1998
Review
1998
Investigation of a New Family of Chiral Ligands for Enantioselective Catalysis via Parallel Synthesis and High‐Throughput Screening.
C. Gennari
,
S. Ceccarelli
,
U. Piarulli
,
Christian A. G. N. Montalbetti
,
Richard F. W. Jackson
1998
Corpus ID: 264209955
Applications of combinatorial chemistry are widespread and cover fields as diverse as drug discovery and optimization,1 material…
Expand
1992
1992
Designing a high-throughput VLC decoder. I. Parallel decoding methods
Horng-Dar Lin
,
D. Messerschmitt
IEEE Trans. Circuits Syst. Video Technol.
1992
Corpus ID: 46537955
For pt.I see ibid, vol.2, no.2, p.187, 1992, For applications in graphic computers, image and video composition, high-definition…
Expand
1990
1990
Application-specific architectural methodologies for high-throughput digital signal and image processing
F. Catthoor
,
H. Man
IEEE Transactions on Acoustics Speech and Signal…
1990
Corpus ID: 36753254
An attempt has been made to classify the architectural styles suited for application-specific high-throughput DSP (digital signal…
Expand
Highly Cited
1985
Highly Cited
1985
A 4-Kbit associative memory LSI
T. Ogura
,
S. Yamada
,
T. Nikaido
IEEE Journal of Solid-State Circuits
1985
Corpus ID: 33160057
A 4-Kb (128 words/spl times/32 bits) CMOS associative-memory large-scale integration (LSI) is described. This LSI has all the…
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