Requirements validation is a critical phase of requirements engineering processes, which makes sure that requirements are correct, consistent, complete and accurate. Requirements validation is used in determining the right requirements, while verification determines that implementation is correct with respect to its requirements. The main objective of validation is to certify that requirement specification document is the acceptable description of the system, which is going to be implemented. Requirements validation techniques (RVTs) play pivotal role to detect possible defects in the requirements. RVTs can help in the completion of projects, within given schedule, budget and according to the desired functionality. The studies of six companies regarding requirements validation, is presented in this thesis. This study explores the requirements validation techniques that are presented in academia and practiced in industry as well. Interview studies are conducted in two countries, which is an attempt to find the usage of requirements validation techniques in both of the countries. The pros and cons of identified RVTs are discussed, along with it; the comparison of different RVTs with respect to the satisfaction level of specific RVT in terms of catching defects, time/schedule and cost is presented as well.

En grafisk ritare i flygande system måste under dess utveckling verifieras för att bekräfta att den fungerar. Då bilderna som ritas inte behöver vara identiska mot referensbilder genererade av en fungerande ritare så ställer det krav på verifieringsprocessen att kunna acceptera en viss grad av "fel". Att automatisera den processen är i högsta grad intressant för att minska kostnaden. Uppsatsen presenterar en samling lösningar på delproblem som kan uppstå, däribland ett sätt att utvinna eventuell transformation mellan två bilder. / Tel: 070-6844137

Speed is a very important factor in websites and other types of applications and almost all applications stores some type of data, normally in a database. For an example a blog typically saves users, posts and comments. There’s a high risk that as the amount of data in the database grows, the time for inserting and requesting specific data increases. If it takes more than some seconds to view a specific page, a user will normally leave the site. However, it’s a fact that the database will grow while the application will become more popular but it’s possible to save a lot of time if using right database, and structure. In this thesis MongoDB and MySQL will be compared with focus on time consumption. SQL (Structured Query Language) is the language which most databases use. This kind of database stores data in structured tables and noting can be added to them if the type of data is incorrect. SQL also support relations between tables. MySQL is a very popular relational database management system (RDBMS) which for example websites frequently makes use of. NoSQL is a new type of databases where the data is stored in collections without any kind of structure, unlike the well known SQL databases where the data is stored in structured tables. Because of the non-structure, these types of databases are designed to be fast and scalable over multiple machines. Mongodb is a such kind of NoSql-database. Tests has been done both on inserting and processing when handling up to 4 millions entities, MongoDB performs better in almost every test. Results shows that the processing time is shorter using MongoDb in the cases that this thesis is covering, and that it’s possible to implement a much fast application when using MongoDb instead of Mysql as database.

No description available.

No description available.

In recent years multiprocessor architectures have become mainstream, and multi-core processors are found in products ranging from small portable cell phones to large computer servers. In parallel, research on real-time systems has mainly focused on traditional single-core processors. Hence, in order for real-time systems to fully leverage on the extra capacity offered by new multi-core processors, new design techniques, scheduling approaches, and real-time analysis methods have to be developed. In the multi-core and multiprocessor domain there are mainly two scheduling approaches, global and partitioned scheduling. Under global scheduling each task can execute on any processor at any time while under partitioned scheduling tasks are statically allocated to processors and migration of tasks among processors is not allowed. Besides simplicity and efficiency of partitioned scheduling protocols, existing scheduling and synchronization methods developed for single-core processor platforms can more easily be extended to partitioned scheduling. This also simplifies migration of existing systems to multi-cores. An important issue related to partitioned scheduling is distribution of tasks among processors which is a bin-packing problem. In this thesis we propose a partitioning framework for distributing tasks on the processors of multi-core platforms. Depending on the type of performance we desire to achieve, the framework may distribute a task set differently, e.g., in an application in which tasks process huge amounts of data the goal of the framework may be to decrease cache misses.Furthermore, we propose a blocking-aware partitioning heuristic algorithm to distribute tasks onto the processors of a multi-core architecture. The objective of the proposed algorithm is to decrease blocking overhead of tasks which reduces the total utilization and has the potential to reduce the number of required processors.Finally, we have implemented a tool to facilitate evaluation and comparison of different multiprocessor scheduling and synchronization approaches, as well as different partitioning heuristics. We have applied the tool in the evaluation of several partitioning heuristic algorithms, and the tool is flexible to which any new scheduling or synchronization protocol as well as any new partitioning heuristic can easily be added.

This thesis deals with how to develop scientific computing software that runs efficiently on multicore processors. The goal is to find building blocks and programming models that increase the productivity and reduce the probability of programming errors when developing parallel software. In our search for new building blocks, we evaluate the use of hardware transactional memory for constructing atomic floating point operations. Using benchmark applications from scientific computing, we show in which situations this achieves better performance than other approaches. Driven by the needs of scientific computing applications, we develop a programming model and implement it as a reusable library. The library provides a run-time system for executing tasks on multicore architectures, with efficient and user-friendly management of dependencies. Our results from scientific computing benchmarks show excellent scaling up to at least 64 cores. We also investigate how the execution time depend on the task granularity, and build a model for the performance of the task library. / UPMARC / eSSENCE

The smartphone market has grown to a significant size these recent years. Currently several platforms are competing against one another - each holding a noticeable market share. It is therefore beneficial to release a product on several platforms to reach more customers. Two of the most popular platforms for smartphones are the iOS and Android operating systems. The aim of the thesis is to create a full portation of an iPhone application to the Android platform, based upon the requirement specification and source code for the iPhone application. Making changes to better suit the Android platform where needed. The application being ported fetches truck travel data from a web service and visualizes the data for the user. The results show that the portation was successful even though some components did not have exact equivalents. This was solved by creating something from Slight changes was performed to accommodate the differences between the two platforms e.g. incorporating the back button.

Memory profiling is an important technique which aids program optimization and can even help tracking down bugs. The main problem with the current memory profiling techniques and tools is that they slow down the target software considerably therefore making them inadequate for mainline integration. Ideally, the user would be able to monitor memory consumption without having to worry about the rest of the software being affected in any way. This thesis provides a comparison of existing techniques and tools along with the description of a memory profiler implementation which tries to provide a balance between the information it is able to retrieve and the influence it has on the target software.

Examensarbetet utfördes åt företaget Medius AB. Arbetet bestod av att designa en ny process för Medius nuvarande och framtida dokumentationsbehov. För att göra detta behövde tre steg slutföras. Först skulle information om dagens dokumenthantering inhämtas, vilka dokument skrivs av vem och för vem skrivs de och vilka behov finns det som idag kanske inte fylls. En grov lista över önskad funktionalitet togs också fram och därefter designades en process som klarar av att fylla alla dessa krav och behov. Sist skulle en lista över verktyg som behövs för den nya processen tas fram och en undersökning om vad som finns och vad som behöver byggas från grunden skulle genomföras. Alla dessa steg har genomförts och den nya processen har utvärderats genom enkäter till medlemmar ur ett antal olika fokusgrupper. Resultatet av utvärderingen tyder på att det är lite arbete kvar att genomföra innan processen är redo att börja implementeras hos Medius, och dessutom behöver alla verktyg implementeras. När detta väl är klart kan den nya processen dock hjälpa Medius AB att lösa flera av de nuvarande problemen eller bristerna.