1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://doi.org/10.1109/PRDC.2005.14
DC FieldValue
dc.titleA virtual modeling and a fast algorithm for grid service reliability
dc.contributor.authorDai, Y.-S.
dc.contributor.authorWang, X.-L.
dc.contributor.authorXie, M.
dc.date.accessioned2014-06-19T04:53:04Z
dc.date.available2014-06-19T04:53:04Z
dc.date.issued2005
dc.identifier.citationDai, Y.-S.,Wang, X.-L.,Xie, M. (2005). A virtual modeling and a fast algorithm for grid service reliability. Proceedings - 11th Pacific Rim International Symposium on Dependable Computing, PRDC 2005 2005 : 219-226. ScholarBank@NUS Repository. <a href="https://doi.org/10.1109/PRDC.2005.14" target="_blank">https://doi.org/10.1109/PRDC.2005.14</a>
dc.identifier.isbn0769524923
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/72273
dc.description.abstractGrid is a type of large-scale distributed system. This paper develops a fast algorithm to efficiently evaluate the grid program/service reliability. It is shown to have a linearly increasing complexity. Compared to the previous exponential algorithms, it broadens the applicability of the generic model into large/complex grid service problems. Moreover, the running time of the fast algorithm is controllable. A regression method is proposed to predict and manage running time.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/PRDC.2005.14
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentINDUSTRIAL & SYSTEMS ENGINEERING
dc.description.doi10.1109/PRDC.2005.14
dc.description.sourcetitleProceedings - 11th Pacific Rim International Symposium on Dependable Computing, PRDC 2005
dc.description.volume2005
dc.description.page219-226
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.