Task Schedule Modeling using a Timed Marked Graph

  • Ro, Cheul-Woo (Dep. of Computer & Info. Eng. Silla University) ;
  • Cao, Yang (Dep. of Computer & Info. Eng. Silla University) ;
  • Ye, Yun Xiang (Dep. of Computer & Info. Eng. Silla University) ;
  • Xu, Wei (Dep. of Computer & Info. Eng. Silla University)
  • 노철우 (신라대학교 컴퓨터정보공학부) ;
  • ;
  • ;
  • Published : 2010.05.27

Abstract

Task scheduling is an integral part of parallel and distributed computing. Extensive research has been conducted in this area leading to significant theoretical and practical results. Stochastic reward nets (SRN) is an extension of stochastic Petri nets and provides compact modeling facilities for system analysis. In this paper, we address task scheduling model using extended timed marked graph, which is a special case of SRNs. And we analyze this model by giving reward measures in SRN.

Keywords