Heonshik Shin

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Taewoong Kim

> Home > Persons > Heonshik Shin

Publications

2003
[j15]
- view
  authority control:
- export record
  dblp key:
  - journals/rts/KimKSC03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rts/KimKSC03
Taewoong Kim, Namyun Kim, Heonshik Shin, Naehyuck Chang:
Burst Mode Bandwidth Allocation for Real-Time Messages in IEEE 802.12 Networks. Real Time Syst. 25(2-3): 207-229 (2003)
2000
[c22]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/icdcsw/KimLSC00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icdcsw/KimLSC00
Taewoong Kim, Junghoon Lee, Heonshik Shin, Naehyuck Chang:
Best Case Response Time Analysis for Improved Schedulability Analysis of Distributed Real-Time Tasks. ICDCS Workshop on Distributed Real-Time Systems 2000: B14-B20
1998
[c16]
- view
  authority control:
- export record
  dblp key:
  - conf/ecrts/KimSC98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ecrts/KimSC98
Taewoong Kim, Heonshik Shin, Naehyuck Chang:
Scheduling algorithm for hard real-time communication in demand priority network. ECRTS 1998: 45-52
[c14]
- view
  authority control:
- export record
  dblp key:
  - conf/rtcsa/KimKCS98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/rtcsa/KimKCS98
Namyun Kim, Taewoong Kim, Naehyuck Chang, Heonshik Shin:
Enhancing Response Times of End-to-End Tasks Using Slack of Local Tasks. RTCSA 1998: 21-

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.