NEWS
Find a Professional: Explore Experts Across 197 Disciplines in 221 Countries!
Just Updated: Compare Your Institution (Live Data)
Print Your Certificate
New! Young University / Institution Rankings 2025
New! Art & Humanities Rankings 2025
New! Social Sciences and Humanities Rankings 2025
Highly Cited Researchers 2025 (Updated Today)
AD
Scientific Index 2025
Scientist Rankings
University Rankings
Subject Rankings
Country Rankings
Login
Register & Pricing
insights
H-Index Rankings
insights
i10 Productivity Rankings
format_list_numbered
Citation Rankings
subject
University Subject Rankings
school
Young Universities
format_list_numbered
Top 100 Scientists
format_quote
Top 100 Institutions
format_quote
For Students
local_fire_department
Country Reports
person
Find a Professional
Myong Hyon Brandon Cho
Massachusetts Institute of Technology - Cambridge / United States
Others
AD Scientific Index ID: 1418030
Registration, Add Profile,
Premium Membership
Get Your Global Impact Certificate
Ranking &
Analysis
Job
Experiences
Education
Information
Published Books
Book Chapters
Articles
Presentations
Lessons
Projects
Co-Authors
Subject Leaders
Editorship, Referee &
Scientific Board
Patents /
Designs
Academic Grants
& Awards
Artistic
Activities
Certificate / Course
/ Trainings
Association &
Society Memberships
Contact, Office
& Social Media
person_outline
Myong Hyon Brandon Cho's MOST POPULAR ARTICLES
1-)
Application-aware deadlock-free oblivious routing Proceedings of the 36th annual international symposium on Computer …, 2009
2-)
Scalable, accurate multicore simulation in the 1000-core era (IEEE ISPASS) IEEE International Symposium on Performance Analysis of …, 2011
3-)
DARSIM: a parallel cycle-level NoC simulator
4-)
Hornet: A cycle-level multicore simulator IEEE Transactions on Computer-Aided Design of Integrated Circuits and …, 2012
5-)
Static virtual channel allocation in oblivious routing 2009 3rd ACM/IEEE International Symposium on Networks-on-Chip, 38-43, 2009
ARTICLES
Add your articles
We use cookies to personalize our website and offer you a better experience. If you accept cookies, we can offer you special services.
Cookie Policy
Accept