東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

System family engineering for leader...

Shi, Wei.

Linked to FindBook

Google Book

Amazon

博客來

System family engineering for leader election in ring.

Record Type:	Electronic resources : Monograph/item
Title/Author:	System family engineering for leader election in ring./
Author:	Shi, Wei.
Description:	101 p.
Notes:	Source: Masters Abstracts International, Volume: 42-06, page: 2245.
Contained By:	Masters Abstracts International42-06.
Subject:	Computer Science. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MQ89864
ISBN:	0612898644

System family engineering for leader election in ring.
Shi, Wei.

System family engineering for leader election in ring. - 101 p.

Source: Masters Abstracts International, Volume: 42-06, page: 2245.

Thesis (M.C.S.)--Carleton University (Canada), 2004.

In this thesis we present an executable and testable model for a family of algorithms dealing with Leader Election in a Ring topology. We first follow the traditional approach of System Family Engineering. That is, we develop a Feature Model that captures variability across these algorithms. Beyond the Feature Model, we then proceed to produce a test-ready executable State Machine model. This state machine model receives specific values for each of the variation points (i.e., features) we identify as inputs. And it produces the behavior corresponding to the specific configuration of features at hand. Contrary to existing generative programming literature, we do not resort to advanced C++ programming, but instead develop an executable model using Rational Rose RT. More precisely, we have designed an integrated State Chart that can execute all the algorithms of the family we studied. We do believe that our approach can be reused to provide a semantically unified, test-ready and executable modeling approach for other families of algorithms.

ISBN: 0612898644Subjects--Topical Terms:

626642
Computer Science.

System family engineering for leader election in ring.
LDR:01973nmm 2200289 4500 001 1846973
005 20051103093607.5
008 130614s2004 eng d
020 $a 0612898644
035 $a (UnM)AAIMQ89864
035 $a AAIMQ89864
040 $a UnM $c UnM
100 1 $a Shi, Wei. $3 907873
245 1 0 $a System family engineering for leader election in ring.
300 $a 101 p.
500 $a Source: Masters Abstracts International, Volume: 42-06, page: 2245.
500 $a Advisers: Jean-Pierre Corriveau; Nicola Santoro.
502 $a Thesis (M.C.S.)--Carleton University (Canada), 2004.
520 $a In this thesis we present an executable and testable model for a family of algorithms dealing with Leader Election in a Ring topology. We first follow the traditional approach of System Family Engineering. That is, we develop a Feature Model that captures variability across these algorithms. Beyond the Feature Model, we then proceed to produce a test-ready executable State Machine model. This state machine model receives specific values for each of the variation points (i.e., features) we identify as inputs. And it produces the behavior corresponding to the specific configuration of features at hand. Contrary to existing generative programming literature, we do not resort to advanced C++ programming, but instead develop an executable model using Rational Rose RT. More precisely, we have designed an integrated State Chart that can execute all the algorithms of the family we studied. We do believe that our approach can be reused to provide a semantically unified, test-ready and executable modeling approach for other families of algorithms.
590 $a School code: 0040.
650 4 $a Computer Science. $3 626642
650 4 $a Engineering, System Science. $3 1018128
690 $a 0984
690 $a 0790
710 2 0 $a Carleton University (Canada). $3 1018407
773 0 $t Masters Abstracts International $g 42-06.
790 1 0 $a Corriveau, Jean-Pierre, $e advisor
790 1 0 $a Santoro, Nicola, $e advisor
790 $a 0040
791 $a M.C.S.
792 $a 2004
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MQ89864