• DocumentCode
    3241208
  • Title

    An Algorithm for Priority Ranking of Individualized Functional Requirements in Networked Software

  • Author

    Yu, Dunhui ; He, Keqing ; Wang, Jian ; Mao, Haiyan

  • Author_Institution
    State Key Lab. of Software Eng., Wuhan Univ., Wuhan
  • fYear
    2008
  • fDate
    24-26 Oct. 2008
  • Firstpage
    701
  • Lastpage
    706
  • Abstract
    Priority ranking of software requirements is recognized as an important but difficult activity during software development, especially for development of networked software, a kind of complex systems. Traditional methods for priority ranking which only calculates static priorities of requirements can not meet the need of networked software due to the individualized requirements characteristics of networked software. According to the features of networked software, four factors need to be considered in ranking requirements priority, that is, the type of requirements, the role who proposes requirements , the frequency of requirements proposed and the time of requirements proposed; and then an algorithm for ranking priority of individualized functional requirements is proposed, which can calculate priorities of all requirements dynamically when every new requirement is proposed. In addition, an example is given to verify the feasibility and rationality of this algorithm.
  • Keywords
    formal verification; software engineering; complex systems; individualized functional requirements; networked software; priority ranking; software development; software requirements; Computer networks; Computer science; Frequency; Grid computing; Laboratories; Mathematics; Programming; Software algorithms; Software engineering; Software quality; Individualized Functional Requirements; Initial priority; Networked Software; Priority Ranking;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Grid and Cooperative Computing, 2008. GCC '08. Seventh International Conference on
  • Conference_Location
    Shenzhen
  • Print_ISBN
    978-0-7695-3449-7
  • Type

    conf

  • DOI
    10.1109/GCC.2008.118
  • Filename
    4662939