Shih-Chang Chen

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 Tai-Lung Chen

> Home > Persons > Shih-Chang Chen

Publications

2010
[c16]
- view
  authority control:
- export record
  dblp key:
  - conf/gpc/ChenHC10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/gpc/ChenHC10
Tai-Lung Chen, Ching-Hsien Hsu, Shih-Chang Chen:
Scheduling of Job Combination and Dispatching Strategy for Grid and Cloud System. GPC 2010: 612-621
[c15]
- view
  authority control:
- export record
  dblp key:
  - conf/ica3pp/ChenCH10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ica3pp/ChenCH10
Shih-Chang Chen, Tai-Lung Chen, Ching-Hsien Hsu:
Message Clustering Technique towards Efficient Irregular Data Redistribution in Clusters and Grids. ICA3PP (1) 2010: 278-286
[c14]
- view
  authority control:
- export record
  dblp key:
  - conf/mtpp/ChenHCYCC10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mtpp/ChenHCYCC10
Shih-Chang Chen, Ching-Hsien Hsu, Tai-Lung Chen, Kun-Ming Yu, Hsi-Ya Chang, Chih-Hsun Chou:
A Compound Scheduling Strategy for Irregular Array Redistribution in Cluster Based Parallel System. MTPP 2010: 69-77
2009
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/ijcomsys/HsuHCC09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijcomsys/HsuHCC09
Ching-Hsien Hsu, Chi-Guey Hsu, Shih-Chang Chen, Tai-Lung Chen:
Message transmission techniques for low traffic P2P services. Int. J. Commun. Syst. 22(9): 1105-1122 (2009)

a service of

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.