Change search
ReferencesLink to record
Permanent link

Direct link
An experimental comparison of five prioritization methods: Investigating ease of use, accuracy and scalability
Blekinge Institute of Technology, School of Engineering, Department of Systems and Software Engineering.
2005 (English)Independent thesis Advanced level (degree of Master (One Year))Student thesis
Abstract [en]

Requirements prioritization is an important part of developing the right product in the right time. There are different ideas about which method is the best to use when prioritizing requirements. This thesis takes a closer look at five different methods and then put them into an controlled experiment, in order to find out which of the methods that would be the best method to use. The experiment was designed to find out which method yields the most accurate result, the method’s ability to scale up to many more requirements, what time it took to prioritize with the method, and finally how easy the method was to use. These four criteria combined will indicate which method is more suitable, i.e. be the best method, to use in prioritizing of requirements. The chosen methods are the well-known analytic hierarchy process, the computer algorithm binary search tree, and from the ideas of extreme programming come planning game. The fourth method is an old but well used method, the 100 points method. The last method is a new method, which combines planning game with the analytic hierarchy process. Analysis of the data from the experiment indicates that the planning game combined with analytic hierarchy process could be a good candidate. However, the result from the experiment clearly indicates that the binary search tree yields accurate result, is able to scale up and was the easiest method to use. For these three reasons the binary search tree clearly is the better method to use for prioritizing requirements

Place, publisher, year, edition, pages
2005. , 101 p.
Keyword [en]
Prioritization methods, scalability, accuracy, time per comparison.
National Category
Computer Science Software Engineering
URN: urn:nbn:se:bth-6182Local ID: diva2:833611
Available from: 2015-04-22 Created: 2005-09-26 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

fulltext(2710 kB)154 downloads
File information
File name FULLTEXT01.pdfFile size 2710 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
Department of Systems and Software Engineering
Computer ScienceSoftware Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 154 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 366 hits
ReferencesLink to record
Permanent link

Direct link