<p> </p><p>Nowadays, as the use of computers is rapidly spreading to our life, software is getting more and more complex and large in computer systems. Therefore, the software configuration management (SCM) is playing an increasingly important role in the software development process. One of its significant activities is change management, which has an outstanding role in dealing with the continued and concurrent change requirements during the system development and use.</p><p>In this report, we describe some basic activities of SCM, overview some representative SCM CASE tools with emphasizing on change management and analyze a possibility of integration of SCM version management tool (e.g., Subversion) and error management tool (e.g., Bugzialla) in order to provide an integrated software configuration management and change management. Moreover, a set of exercises based on RCS are developed, which illustrate some SCM simple activities and their modification to facilitate version management and change management.</p><p> </p>

<p>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.</p><p>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.</p><p>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.</p>

<p>Examensarbetet utfördes åt företaget Medius AB. Arbetet bestod av att designa en ny process för Medius nuvarande och framtida dokumentationsbehov.</p><p>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.</p><p>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.</p>

<p>Researchers have developed framework for diagnosis analysis that are called “Model Based Diagnosis Systems”. These systems are very general in scope, covers a wide range of malfunctions uncovering and identifying repair measures. This thesis is an effort to diagnose complex and lengthy static source code. Without executing source code discrepancies can only be identified by finding procedural dependencies.</p><p>With respect to modern programming languages, many software bugs arise due to logical erroneous calculations or miss handling of data structures. Modern Integrated Development Environments (IDE) like Visual Studio, J-Builder and Eclipse etc are strong enough to analyze and parse static text code to identify syntactical and type conversion errors. Some of IDE’s can automatically fix such kind of errors or provide different possible suggestions to developer.</p><p>In this thesis we have analyzed and extracted functional dependencies of source code. This extracted information can increase programmer’s understanding about code when they are extremely large or complex. By modeling this information into a model system, reduces time to debug the code in case of any failure. This increases productivity in terms of software development and in debugger skills as well. The main contribution of this thesis is the use of model based diagnosis techniques on software functional dependency graphs and charts.</p><p>Keywords: Model Based Diagnosis Systems, Integrated Development Environments, Procedural Dependencies, Erroneous calculations, Call graphs, Directed graph markup language.</p>

No description available.

No description available.

<p>The content of this report describes a bachelor thesis performed on commission by Cybercom Sweden West. The report describes techniques, methods and development tools used during the project. The purpose of this project is to demonstrate the usefulness with a new Bluetooth profile called Medical Device Profile (MDP) on the Medica trade fair 14-11-2007. The MDP profile that will be released in turn of the ear 07/08 is primarily intended to be used in medical devices.The demonstration is to be made by building a demonstrator consisting of an application running on a smartphone with Bluetooth abilities. The application will handle the Bluetooth connection between the smartphone and the oximeter, the data encryption and other functionalities and presenting the figures received form the oximeter in a Graphical User Interface (GUI).The final demonstrator consists of a smartphone application programmed in Symbian C++, which communicates with the oximeter using the Bluetooth Serial Port Profile (SPP). The application runs on UIQ 3.0 based smartphones and displays heart rate and %SpO2 (The percentage of oxygen saturation in blood), which the application receives from the oximeter.The original idea was to use the MDP profile by porting Cybercom's C version of the MDP to Symbian OS for the Bluetooth communication, depending on various factors described more in detail inside the report this was not done. The purpose of the project was still reached, even though another profile then MDP was used. This was done by replacing the considered oximeter for an older version which is using the SPP. By using SPP the same result will be demonstrated but with an older technique, and this will achieve the same result on Medica trade fair. The project was demonstrated on Medica with a successful result.</p>

This thesis makes a comparison between the performance of Go and Java using parallelizedimplementations of the Classic Matrix Multiplication Algorithm (CMMA). The comparisonattempts to only use features for parallelization, goroutines for Go and threads for Java,while keeping other parts of the code as generic and comparable as possible to accuratelymeasure the performance during parallelization.In this report we ask the question of how programming languages compare in terms of multi-threaded performance? In high-performance systems such as those designed for mathemati-cal calculations or servers meant to handle requests from millions of users, multithreadingand by extension performance are vital. We would like to find out if and how much of a dif-ference the choice of programming language could benefit these systems in terms of parallel-ism and multithreading.Another motivation is to analyze techniques and programming languages that have emergedthat hide the complexity of handling multithreading and concurrency from the user, lettingthe user specify keywords or commands from which the language takes over and creates andmanages the thread scheduling on its own. The Go language is one such example. Is this newtechnology an improvement over developers coding threads themselves or is the technologynot quite there yet?To these ends experiments were done with multithreaded matrix multiplication and was im-plemented using goroutines for Go and threads for Java and was performed with sets of4096x4096 matrices. Background programs were limited and each set of calculations wasthen run multiple times to get average values for each calculation which were then finallycompared to one another.Results from the study showed that Go had ~32-35% better performance than Java between 1and 4 threads, with the difference diminishing to ~2-5% at 8 to 16 threads. The differencehowever was believed to be mostly unrelated to parallelization as both languages maintainednear identical performance scaling as the number of threads increased until the scaling flat-lined for both languages at 8 threads and up. Java did continue to gain a slight increase goingfrom 4 to 8 threads, but this was believed to be due to inefficient resource utilization onJava’s part or due to Java having better utilization of hyper-threading than Go.In conclusion, Go was found to be considerably faster than Java when going from the mainthread and up to 4 threads. At 8 threads and onward Java and Go performed roughly equal.For performance difference between the number of threads in the languages themselves nonoticeable performance increase or decrease was found when creating 1 thread versus run-ning the matrix multiplication directly on the main thread for either of the two languages.Coding multithreading in Go was found to be easier than in Java while providing greater toequal performance. Go just requires the ‘go’ keyword while Java requires thread creation andmanagement. This would put Go in favor for those trying to avoid the complexity of multi-threading while also seeking its benefits.

Inom en snar framtid kommer allt fler villaägare välja att skaffa elbil. Därigenom kommer det lokala elnätet att utsättas för stora utmaningar i form av oregelbunden belastning och potentiell överlast. Studien undersöker om man med mjukvara kan underlätta och få till stånd en effektstyrning av energi i lokalnätet, såväl som i den egna villan. Med hjälp av befintliga rapporter,webbfrågor och intervjuer kartläggs olika berörda aktörers inställning till, och beredskap för, attfördela last. En testbädd för att ta fram förslag till styrning på olika nivåer med fokus på villor, lokalnät och elbilar med laddplats har tagits fram. Testappar med olika grad av information och olika möjlighet till påverkan har knutits därtill.  En slutsats av arbetet är att effektstyrning måste ske och i ökande omfattning. I steg 1 kan det räcka att flytta användningen några timmar från eftermiddag till natt. Framöver när en stor andel fordon blir eldrivna behöver elnätsbolagen mer aktivt få styra sina elnätskunders effektuttag i tiden.

With a software industry that is moving at a fast pace, continuous integration and delivery is something important for many products today. Moreover, with containers being on the rise since 2013, more companies are moving their CI/CD environment into containers not only for development but also for testing. This thesis begins with giving the reader an introduction to containers, container orchestration, and Jenkins, which is a continuous integration and delivery tool. The experiment was then set up with one container based cluster and one single node machine. Two kinds of experiments were run on them, one big job and one small job. The system scalability is assessed, and with smaller clusters the memory overhead could be an issue. Performance wise, the container cluster is performing better than a single node machine, as long as it is utilizing all its nodes. Security with containers is still an issue and it could be fatal for a cluster if it is compromised.