Change search
Refine search result
1234 101 - 150 of 152
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 101. Lundberg, Lars
    et al.
    Roos, Marco
    Predicting and speedup of multithreaded Solaris programs1997Conference paper (Refereed)
  • 102.
    Lundberg, Lars
    et al.
    Blekinge Institute of Technology, School of Computing.
    Sogand, Shirinbab
    Blekinge Institute of Technology, School of Computing.
    Real-time scheduling in cloud-based virtualized software systems2013Conference paper (Refereed)
    Abstract [en]

    The number of applications that use virtualized cloud-based systems is growing, and one would like to use this kind of systems also for real-time applications with hard deadlines. There is scheduling on two levels in real-time applications executing in a virtualized environment: traditional real-time scheduling of the tasks in the real-time application, and scheduling of different Virtual Machines (VMs) on the hypervisor level. Traditional real-time scheduling is well understood, and most of the existing results calculate schedules based on periods, deadlines and worst-case execution times of the real-time tasks. In order to apply the existing theory also to cloud-based virtualized environments we must obtain periods and worst-case execution times for the VMs containing real-time applications. In this paper, we describe a technique for calculating a period and a worst-case execution time for a VM containing a real-time application with hard deadlines. This new result makes it possible to apply existing real-time scheduling theory when scheduling VMs on the hypervisor level, thus making it possible to guarantee that the real-time tasks in a VM meet their deadlines

  • 103. Lundberg, Lars
    et al.
    Svahnberg, Charlie
    Normal Versus Worst-case Performance in High Availability Cluster and Distributed Computing2003Conference paper (Refereed)
    Abstract [en]

    Clusters and distributed systems offer fault tolerance and high performance, When all computers are up and running, we would like the load to be evenly distributed among the computers. When a computer breaks down the load on this computer must be redistributed to the other computers in the cluster. Most cluster systems are designed to tolerate one single fault, and one can thus distinguish between two modes of operation: normal operation when all computers are up and running and worst-case operation when one computer is down. The performance during these two modes of operation is determined by the way work is allocated to the computers in the cluster or distributed system. It turns out that the same allocation can in general not achieve optimal normal and worst-case performance, i.e. there is a trade-off. In this paper we put an optimal upper bound on the loss of normal case performance when optimizing for worst-case performance, and an optimal upper bound on the loss of worst-case case performance when optimizing for normal case performance. We also provide a heuristic algorithm for doing engineering trade-offs between worst-case and normal case performance.

  • 104. Mejstad, Valdemar
    et al.
    Tångby, Karl-Johan
    Lundberg, Lars
    Improving Multiprocessor Performance of a Large Telecommunication System by Replacing Interpretation with Compilation.2002Conference paper (Refereed)
    Abstract [en]

    We consider different techniques for increasing the multiprocessor performance of an interpreted processing language in a large real-time telecommunication system, called Billing Gateway. We have implemented a prototype in which we first translate the language into C++ code, and then compile it using a C++ compiler. In our prototype we achieved a more than fourfold increase in throughput, compared to the original system, when running on an SMP with eight CPUs. The prototype also shows better scalability than the original system, due to less use of dynamic memory.

  • 105.
    Mendes, Emilia
    et al.
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering. Blekinge Institute of Technology, Faculty of Computing, Department of Software Engineering.
    Viana, Davi
    Univ Fed Maranhao, BRA.
    Vishnubhotla, Sai Datta
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Lundberg, Lars
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Realising Individual and Team Capability in Agile Software Development: A Qualitative Investigation2018In: Proceedings - 44th Euromicro Conference on Software Engineering and Advanced Applications, SEAA 2018 / [ed] Bures, T Angelis, L, IEEE , 2018, p. 183-190Conference paper (Refereed)
    Abstract [en]

    Several studies have shown that both individual and team capability can affect software development performance and project success; a deeper understating of such phenomena is crucial within the context of Agile Software Development (ASD), given that its workforce is a key source of agility. This paper contributes towards such understanding by means of a case study that uses data from 14 interviews carried out at a large telecommunications company, within the context of a mobile money transfer system developed in Sweden and India, to identify individual and team capability measures used to form productive teams. Our results identified 10 individual and five team capability measures, of which, respectively, five and four have not been previously characterised by a systematic literature review (SLR) on this same topic. Such review aggregated evidence for a total of 133 individual and 28 team capability measures. Further work entails extending our findings via interviewing other software/software-intensive industries practicing ASD.

  • 106. Mengistu, Dawit
    et al.
    Davidsson, Paul
    Lundberg, Lars
    A Grid Based Simulation Environment for Mobile Distributed Applications2007Conference paper (Refereed)
  • 107. Mengistu, Dawit
    et al.
    Davidsson, Paul
    Lundberg, Lars
    Middleware Support for Performance Improvement of MABS Applications in the Grid Environment2007Conference paper (Refereed)
  • 108. Mengistu, Dawit
    et al.
    Lundberg, Lars
    Davidsson, Paul
    Performance Prediction of MABS Applications on the Grid2007Conference paper (Refereed)
  • 109. Mengistu, Dawit
    et al.
    Lundberg, Lars
    Davidsson, Paul
    Performance Prediction of Multi-Agent Based Simulation Applications on the Grid2007Conference paper (Refereed)
    Abstract [en]

    A major requirement for Grid application developers is ensuring performance and scalability of their applications. Predicting the performance of an application demands understanding its specific features. This paper discusses performance modeling and prediction of multi-agent based simulation (MABS) applications on the Grid. An experiment conducted using a synthetic MABS workload explains the key features to be included in the performance model. The results obtained from the experiment show that the prediction model developed for the synthetic workload can be used as a guideline to understand to estimate the performance characteristics of real world simulation applications.

  • 110. Mengistu, Dawit
    et al.
    Tröger, Peter
    Lundberg, Lars
    Davidsson, Paul
    Scalability in Distributed Multi-Agent Based Simulations: The JADE Case2008Conference paper (Refereed)
    Abstract [en]

    Agent platforms provide a framework for development and execution of parallel applications such as multi-agent based simulation (AMBS). However, these platforms have limitations to support large-scale MABS applications in practice. This paper aims at investigating and improving the performance of an agent platform with a AMBS workload in distributed environments. We carried out an experimental study with the JADE framework as our agent platform. The experiments show the performance characteristics of the workload and that JADE does not scale well due to message transport and agent directory service limitations. We propose solutions to overcome these performance bottlenecks and facilitate the efficient execution of AMBS in a distributed environment. Initial experimental results demonstrate the feasibility of the proposed approaches

  • 111. Mostefaoui, Achour
    et al.
    Polze, Andreas
    Baquero, Carlos
    Ezhilchelvan, Paul Devadoss
    Lundberg, Lars
    Blekinge Institute of Technology, School of Computing.
    Topic 8: Distributed systems and algorithms2013In: Lecture Notes in Computer Science, Aachen: Springer , 2013, Vol. 8097, p. 367-368Conference paper (Refereed)
    Abstract [en]

    Distributed Computing is becoming more and more led by technological and application advances. Many works consider new computing models compared to the classical closed model with a fixed number of participants and strong hypothesis on communication and structuration. Indeed, it is hard to imagine some application or computational activity and process that falls outside Distributed Computing. Internet and the web (e.g. social networks, clouds) are becoming the main application field for distributed computing. In addition to the classical challenges that developers have to face (asynchrony and failures) they have to deal with load balancing, malicious and selfish behaviors, mobility, heterogeneity and the dynamic nature of participating processes.

  • 112.
    Muzahim Aziz, Hussein
    et al.
    Blekinge Institute of Technology, School of Computing.
    Fiedler, Markus
    Blekinge Institute of Technology, School of Computing.
    Grahn, Hakan
    Blekinge Institute of Technology, School of Computing.
    Lundberg, Lars
    Blekinge Institute of Technology, School of Computing.
    Adapting the Streaming Video on the Estimated Motion Position2012In: Advances in Electrical and Electronic Engineering, ISSN 1336-1376, E-ISSN 1804-3119, Vol. 10, no 4Article in journal (Refereed)
    Abstract [en]

    In real time video streaming, the frames must meet their timing constraints, typically specified as their deadlines. Wireless networks may suffer from bandwidth limitations. To reduce the data transmission over the wireless networks, we propose an adaption technique in the server side by extracting a part of the video frames that considered as a Region Of Interest (ROI), and drop the part outside the ROI from the frames that are between reference frames. The estimated position of the selection of the ROI is computed by using the Sum of Squared Differences (SSD) between consecutive frames. The reconstruction mechanism to the region outside the ROI is implemented in the mobile side by using linear interpolation between reference frames. We evaluate the proposed approach by using Mean Opinion Score (MOS) measurements. MOS are used to evaluate two scenarios with equivalent encoding size, where the users observe the first scenario with low bit rate for the original videos, while for the second scenario the users observe our proposed approach with high bit rate. The results show that our technique significantly reduces the amounts of data are streamed over wireless networks, while the reconstruction mechanism will provides acceptable video quality.

  • 113.
    Muzahim Aziz, Hussein
    et al.
    Blekinge Institute of Technology, School of Computing.
    Fiedler, Markus
    Blekinge Institute of Technology, School of Computing.
    Grahn, Håkan
    Blekinge Institute of Technology, School of Computing.
    Lundberg, Lars
    Blekinge Institute of Technology, School of Computing.
    Adapting the Streaming Video Based on the Estimated Position of the Region of Interest2012Conference paper (Refereed)
    Abstract [en]

    Streaming real time video over wireless networks cannot guarantee that all the frames could meet their deadlines. Wireless networks may suffer from bandwidth limitations. To reduce the streaming data over wireless networks, we propose a technique to identify, and extract the Region Of Interest (ROI), and drop the non-ROI from the frames that are between the reference frames. The Sum of Absolute Differences (SAD) will compute the consecutive video frames to identify the ROI as it considered the most motion and important region. The reconstruction mechanism to the non-ROI is performed on the mobile side by applying linear interpolation between the reference frames. We evaluate the proposed approach by using Mean Opinion Score (MOS) measurements. MOS are used to evaluate the two scenarios with equivalent encoding size, where the users observe the first scenario with a low bit rate for the original videos, while for the second scenario the users observe our proposed approach. The results show that our technique significantly reduces the amount of data, while the reconstruction mechanism provides acceptable video quality to the mobile viewers.

  • 114.
    Muzahim Aziz, Hussein
    et al.
    Blekinge Institute of Technology, School of Computing.
    Fiedler, Markus
    Blekinge Institute of Technology, School of Computing.
    Grahn, Håkan
    Blekinge Institute of Technology, School of Computing.
    Lundberg, Lars
    Blekinge Institute of Technology, School of Computing.
    Distribute the Video Frame Pixels over the Streaming Video Sequence as Sub-Frames2012Conference paper (Refereed)
    Abstract [en]

    Real-time video streaming over wireless channel has become an important issue due to the limited bandwidth that is unable to handle the flow of information of the video frames. The characteristics of wireless networks in terms of the available bandwidth, frame delay, and frame losses cannot be known in advance. As the effect of that, the user may notice a frozen picture in the mobile screen. In this work, we propose a technique to prevent freezing frames in the mobile devices based on spatial and temporal locality for the video stream, by splitting the video frame into four sub-frames and combining them with another sub-frames from different sequence positions in the streaming video. In case of frames losses, there is still a possibility that one fourth (one sub-frame) of the frame will be received by the mobile device. The received sub-frames will be reconstructed based on the surrounding pixels. The rate adaptation mechanism will be also highlighted in this work, by skipping sub-frames from the video frames. We show that the server can skip up to 75% of the frame’s pixels and the receiving pixels (sub-frames) can be reconstructed to acceptable quality in the mobile device.

  • 115. Niyizamwiyitira, C.
    et al.
    Lundberg, Lars
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Lennerstad, Håkan
    Blekinge Institute of Technology, Faculty of Engineering, Department of Mathematics and Natural Sciences.
    Utilization-Based Schedulability Test of Real-Time Systems on Virtual Multiprocessors2015In: 2015 44TH INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING WORKSHOPS, IEEE Computer Society, 2015, Vol. 2015-January, p. 267-276Conference paper (Refereed)
    Abstract [en]

    The number of applications that use virtual systems is growing, and one would like to use this kind of systems also for real-time applications with hard deadlines. Virtual machines with many cores are interesting since the underlying physical infrastructure usually contains many cores. We consider hard real-time tasks that execute on a virtual machine with m cores. Tasks are scheduled globally on the cores using fixed-priority preemptive scheduling. This means that a task can execute on different virtual cores at different instances in time. In order to avoid Dhall’s effect, which may cause task sets with even very low utilization to miss deadlines, we classify tasks into two priority classes, namely heavy and light tasks. Heavy tasks have higher priority than light tasks. For light tasks we use rate monotonic priority assignment. In this paper we propose a utilization-based test that shows if a task set is schedulable or not. If the task set is schedulable the test provides the priority for each task. The input to the test is the task set, the number of cores in the virtual machine (m), a period for the virtual machine with m cores, and the blocking time when a virtual machine does not have access to the underlying hardware in each period. © 2015 IEEE.

  • 116.
    Niyizamwiyitira, Christine
    et al.
    Blekinge Institute of Technology, School of Computing.
    Lundberg, Lars
    Blekinge Institute of Technology, School of Computing.
    Performance evaluation and prediction of open source speech engine on multicore processors2013Conference paper (Refereed)
    Abstract [en]

    This paper quantifies the performance of the core part of voice driven web using free and open source speech engine; the speech engine which is very high computation demanding, it consists of Automatic Speech Recognition (ASR) and Text To Speech (TTS). Two open source programs, Sphinx-4 and FreeTTS-1.2.2 are used for ASR and TTS respectively. These two programs are executed on 2 different hardware multicore processors with 4 hyperthreaded cores, and 8 cores respectively. The response time with respect to the load variance and the number of cores is measured and predicted using a linear regression model. The results show that, the response time is linear with respect to the input length, this property can be used to directly predict the response for any input length. Moreover, though the response time and the speed up increases as the number of cores increases, the regression coefficients and number of threads reveal that ASR benefits from multicore. The speedup factor for ASR is 1.56 for 8 cores. However for FreeTTS, though being sequential the speed up from the program itself is insignificant, there is about 1. 43 speedup for 8 cores, that comes from the system's contribution. Our findings show that the generalization of the results for multicore processor does not apply to hyperthreading. This paper presents the investigation that is useful for educators, researchers, and applications' developer in voice based applications 'domain.

  • 117.
    Niyizamwiyitira, Christine
    et al.
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Lundberg, Lars
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Period assignment in real-time scheduling of multiple virtual machines2015In: Proceedings of the 7th International Conference on Management of computational and collective intElligence in Digital EcoSystems, Association for Computing Machinery (ACM), 2015, p. 180-187Conference paper (Refereed)
  • 118.
    Niyizamwiyitira, Christine
    et al.
    Blekinge Institute of Technology, School of Computing.
    Lundberg, Lars
    Blekinge Institute of Technology, School of Computing.
    Svahnberg, Mikael
    Blekinge Institute of Technology, School of Computing.
    Evaluation of Voice-driven Web Application Architecture2012Conference paper (Refereed)
    Abstract [en]

    This paper quantifies the implications and trade-offs of three different architectures for voice driven web application, architectures are implemented as prototypes. The prototypes differ from each other by either using recording, or Text To Speech (TTS) as server based, or TTS as client based to process output speech. A typical application used in this paper, is the most dynamic weather information source which is presented as web feeds or Really Simple Syndication (RSS) feeds. The evaluated quality attributes are performance, maintainability, and development effort. The empirical results show that, each system's architecture has a different quality profile, for instance, one architecture has the lowest development time but the highest maintainability cost, and another has the lowest bandwidth requirements but the highest development cost. Finally, suggestions about optimal choice of system architecture according to the quality requirements of the final system are drawn.

  • 119.
    Novak, Gabriela
    et al.
    Ericsson AB, SWE.
    Lundberg, Lars
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Usability Evaluation of an M-Commerce System Using Proxy Users2015In: HCI INTERNATIONAL 2015 - POSTERS' EXTENDED ABSTRACTS, PT II, SPRINGER-VERLAG BERLIN , 2015, p. 164-169Conference paper (Refereed)
    Abstract [en]

    We have done a usability evaluation of a mobile commerce system developed by Ericsson in Sweden. The main market for the system is in developing countries in Africa. Consequently, there is a geographical distance between the developers and the users, and it is difficult to involve actual users in usability tests. Because of this, a team of solution architects that work with the product was used as proxies for the actual users in the usability test. When the test was completed, a group of actual users came to Sweden to attend a course. In order to get additional input to the usability evaluation, the usability test was repeated with the actual users. The results from the two groups were very similar, and our conclusion is that the proxy user group was a good alternative to actual users.

  • 120.
    Podapati, Sasidahr
    et al.
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Lundberg, Lars
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Sköld, L.
    Telenor, SWE.
    Rosander, Oliver
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Sidorova, Yulia
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Fuzzy recommendations in marketing campaigns2017In: Communications in Computer and Information Science / [ed] Darmont J.,Kirikova M.,Norvag K.,Wrembel R.,Papadopoulos G.A.,Gamper J.,Rizzi S., 2017, Vol. 767, p. 246-256Conference paper (Refereed)
    Abstract [en]

    The population in Sweden is growing rapidly due to immigration. In this light, the issue of infrastructure upgrades to provide telecommunication services is of importance. New antennas can be installed at hot spots of user demand, which will require an investment, and/or the clientele expansion can be carried out in a planned manner to promote the exploitation of the infrastructure in the less loaded geographical zones. In this paper, we explore the second alternative. Informally speaking, the term Infrastructure-Stressing describes a user who stays in the zones of high demand, which are prone to produce service failures, if further loaded. We have studied the Infrastructure-Stressing population in the light of their correlation with geo-demographic segments. This is motivated by the fact that specific geo-demographic segments can be targeted via marketing campaigns. Fuzzy logic is applied to create an interface between big data, numeric methods for its processing, and a manager who wants a comprehensible summary. © 2017, Springer International Publishing AG.

  • 121.
    Sagar, Susheel
    et al.
    Blekinge Inst Technol, Master Programe Comp Sci, Karlskrona, Sweden..
    Skold, Lars
    Telenor, SWE.
    Lundberg, Lars
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Sidorova, Yulia
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Trajectory Segmentation for a Recommendation Module of a Customer Relationship Management System2017In: Proceedings - 2017 IEEE International Conference on Internet of Things, IEEE Green Computing and Communications, IEEE Cyber, Physical and Social Computing, IEEE Smart Data, iThings-GreenCom-CPSCom-SmartData 2017 / [ed] Wu, Y Min, G Georgalas, N AlDubi, A Jin, X Yang, L Ma, J Yang, P, IEEE , 2017, p. 1150-1155Conference paper (Refereed)
    Abstract [en]

    In business analytics some industries rely heavily on commercial geo-demographic segmentation systems (MOSAIC, ACORN, etc.), which are a universally strong predictor of user's behavior: from diabetes propensity and purchasing habits to political preferences. A segment is defined with a postcode of the client's home address. Recent research suggests that a mature competitor to geo-demographic segmentation is about to emerge: segmentation based on user mobility is reported to be a reliable proxy of social well-being of the neighborhood. In this submission, we have completed a user segmentation model based on clustering of user trajectories from the Call Detail Records covering one week of activity of one region in Sweden. The new segmentation has been compared against MOSAIC in the recommendation module of a customer relationship management system and has revealed better business options with regard to network exploitation and potential revenues. The implementation is available from the corresponding author (JS or LL) on request.

  • 122.
    Shirinbab, Sogand
    et al.
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Lundberg, Lars
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Performance Implications of Over-allocation of Virtual CPUs2015In: 2015 International Symposium on Networks, Computers and Communications (ISNCC 2015), IEEE , 2015Conference paper (Refereed)
    Abstract [en]

    A major advantage of cloud environments is that one can balance the load by migrating virtual machines (VMs) from one server to another. High performance and high resource utilization are also important in a cloud. We have observed that over-allocation of virtual CPUs to VMs (i.e. allocating more vCPUs to VMs than there CPU cores on the server) when there are many VMs running on one host can reduce performance. However, if we do not use any over-allocation of virtual CPUs we may suffer from poor resource utilization after VM migration. Thus, it is important to identify and quantify performance bottlenecks when running in virtualized environment. The results of this study will help virtualized environment service providers to decide how many virtual CPUs should be allocated to each VM.

  • 123.
    Shirinbab, Sogand
    et al.
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Lundberg, Lars
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Performance implications of resource over-allocation during the live migration2016In: 8TH IEEE INTERNATIONAL CONFERENCE ON CLOUD COMPUTING TECHNOLOGY AND SCIENCE (CLOUDCOM 2016), IEEE Computer Society, 2016, p. 552-557Conference paper (Refereed)
    Abstract [en]

    As the number of cloud users are increasing, it becomes essential for cloud service providers to allocate the right amount of resources to virtual machines, especially during live migration. In order to increase the resource utilization and reduce waste, the providers have started to think about the role of over-allocating the resources. However, the benefits of over-allocations are not without inherent risks. In this paper, we conducted an experiment using a large telecommunication application that runs inside virtual machines, here we have varied the number of vCPU resources allocated to these virtual machines in order to find the best choice which at the same time reduces the risk of underallocating resources after the migration and increases the performance during the live migration. During our measurements we have used VMware's vMotion to migrate virtual machines while they are running. The results of this study will help virtualized environment service providers to decide how much resources should be allocated for better performance during live migration as well as how much resource would be required for a given load.

  • 124.
    Shirinbab, Sogand
    et al.
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Lundberg, Lars
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Scheduling Tasks with Hard Deadlines in CloudBased Virtualized Software SystemsManuscript (preprint) (Other academic)
    Abstract [en]

    There is scheduling on two levels in real-time applications executing in a virtualized environment: traditional real-time scheduling of the tasks in the realtime application, and scheduling of different Virtual Machines (VMs) on the hypervisor level. In this paper, we describe a technique for calculating a period and an execution time for a VM containing a real-time application with hard deadlines. This result makes it possible to apply existing real-time scheduling theory when scheduling VMs on the hypervisor level, thus making it possible to guarantee that the real-time tasks in a VM meet their deadlines. If overhead for switching from one VM to another is ignored, it turns out that (infinitely) short VM periods minimize the utilization that each VM needs to guarantee that all real-time tasks in that VM will meet their deadlines. Having infinitely short VM periods is clearly not realistic, and in order to provide more useful results we have considered a fixed overhead at the beginning of each execution of a VM. Considering this overhead, a set of real-time tasks, the speed of each processor core, and a certain processor utilization of the VM containing the real-time tasks, we present a simulation study and some performance bounds that make it possible to determine if it is possible to schedule the real-time tasks in the VM, and in that case for which periods of the VM that this is possible.

  • 125.
    Shirinbab, Sogand
    et al.
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Lundberg, Lars
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Scheduling Tasks with Hard Deadlines in CloudBased Virtualized Software SystemsManuscript (preprint) (Other academic)
    Abstract [en]

    There is scheduling on two levels in real-time applications executing in a virtualized environment: traditional real-time scheduling of the tasks in the realtime application, and scheduling of different Virtual Machines (VMs) on the hypervisor level. In this paper, we describe a technique for calculating a period and an execution time for a VM containing a real-time application with hard deadlines. This result makes it possible to apply existing real-time scheduling theory when scheduling VMs on the hypervisor level, thus making it possible to guarantee that the real-time tasks in a VM meet their deadlines. If overhead for switching from one VM to another is ignored, it turns out that (infinitely) short VM periods minimize the utilization that each VM needs to guarantee that all real-time tasks in that VM will meet their deadlines. Having infinitely short VM periods is clearly not realistic, and in order to provide more useful results we have considered a fixed overhead at the beginning of each execution of a VM. Considering this overhead, a set of real-time tasks, the speed of each processor core, and a certain processor utilization of the VM containing the real-time tasks, we present a simulation study and some performance bounds that make it possible to determine if it is possible to schedule the real-time tasks in the VM, and in that case for which periods of the VM that this is possible.

  • 126.
    Shirinbab, Sogand
    et al.
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Lundberg, Lars
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Scheduling Tasks with Hard Deadlines in Virtualized Software SystemsIn: Article in journal (Refereed)
    Abstract [en]

    There is scheduling on two levels in real-time applications executing in a virtualized environment: traditional real-time scheduling of the tasks in the real-time application, and scheduling of different Virtual Machines (VMs) on the hypervisor level. In this paper, we describe a technique for calculating a period and an execution time for a VM containing a real-time application with hard deadlines. This result makes it possible to apply existing real-time scheduling theory when scheduling VMs on the hypervisor level, thus making it possible to guarantee that the real-time tasks in a VM meet their deadlines. If overhead for switching from one VM to another is ignored, it turns out that (infinitely) short VM periods minimize the utilization that each VM needs to guarantee that all real-time tasks in that VM will meet their deadlines. Having infinitely short VM periods is clearly not realistic, and in order to provide more useful results we have considered a fixed overhead at the beginning of each execution of a VM. Considering this overhead, a set of real-time tasks, the speed of  each processor core, and a certain processor utilization of the VM containing the real-time tasks, we present a simulation study and some performance bounds that make it possible to determine if it is possible to schedule the real-time tasks in the VM, and in that case for which periods of the VM that  is possible.

  • 127.
    Shirinbab, Sogand
    et al.
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Lundberg, Lars
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Casalicchio, Emiliano
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Performance Comparison between Horizontal Scaling of Hypervisor and Container Based Virtualization using Cassandra NoSQL Database2018In: Proceeding of the 3rd International Conference on Virtualization Application and Technology, 2018, , p. 6Conference paper (Refereed)
    Abstract [en]

    Cloud computing promises customers the ondemand ability to scale in face of workload variations. There are different ways to accomplish scaling, one is vertical scaling and the other is horizontal scaling. The vertical scaling refers to buying more power (CPU, RAM), buying a more expensive and robust server, which is less challenging to implement but exponentially expensive. While, the horizontal scaling refers to adding more servers with less processor and RAM, which is usually cheaper overall and can scale very well. The majority of cloud providers prefer the horizontal scaling approach, and for them would be very important to know about the advantages and disadvantages of both technologies from the perspective of the application performance at scale. In this paper, we compare performance differences caused by scaling of the different virtualization technologies in terms of CPU utilization, latency, and the number of transactions per second. The workload is Apache Cassandra, which is a leading NoSQL distributed database for Big Data platforms. Our results show that running multiple instances of the Cassandra database concurrently, affected the performance of read and write operations differently; for both VMware and Docker, the maximum number of read operations was reduced when we ran several instances concurrently, whereas the maximum number of write operations increased when we ran instances concurrently.

  • 128.
    Shirinbab, Sogand
    et al.
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Lundberg, Lars
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Casalicchio, Emiliano
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Performance Evaluation of Container and Virtual Machine Running Cassandra Workload2017In: PROCEEDINGS OF 2017 3RD INTERNATIONAL CONFERENCE OF CLOUD COMPUTING TECHNOLOGIES AND APPLICATIONS (CLOUDTECH) / [ed] Essaaidi, M Zbakh, M, 2017, p. 24-31Conference paper (Refereed)
    Abstract [en]

    Today, scalable and high-available NoSQL distributed databases are largely used as Big Data platforms. Such distributed databases typically run on a virtualized infrastructure that could be implemented using Hypervisorb ased virtualiz ation or Container-based virtualiz ation. Hypervisor-based virtualization is a mature technology but imposes overhead on CPU, memory, networking, and disk Recently, by sharing the operating system resources and simplifying the deployment of applications, container-based virtualization is getting more popular. Container-based virtualization is lightweight in resource consumption while also providing isolation. However, disadvantages are security issues and 110 performance. As a result, today these two technologies are competing to provide virtual instances for running big data platforms. Hence, a key issue becomes the assessment of the performance of those virtualization technologies while running distributed databases. This paper presents an extensive performance comparison between VMware and Docker container, while running Apache Cassandra as workload. Apache Cassandra is a leading NoSQL distributed database when it comes to Big Data platforms. As baseline for comparisons we used the Cassandra's performance when running on a physical infrastructure. Our study shows that Docker had lower overhead compared to the VMware when running Cassandra. In fact, the Cassandra's performance on the Dockerized infrastructure was as good as on the Non-Virtualized.

  • 129.
    Shirinbab, Sogand
    et al.
    Blekinge Institute of Technology, School of Computing.
    Lundberg, Lars
    Blekinge Institute of Technology, School of Computing.
    Erman, David
    Blekinge Institute of Technology, School of Computing.
    Performance evaluation of distributed storage systems for cloud computing2013In: International Journal of Computers and Their Applications, ISSN 1076-5204, Vol. 20, no 4, p. 195-207Article in journal (Refereed)
    Abstract [en]

    The possibility to migrate a virtual server from one physical computer in a cloud to another physical computer in the same cloud is important in order to obtain a balanced load. In order to facilitate live migration of virtual servers, one needs to provide large shared storage systems that are accessible for all the physical servers that are used in the cloud. Distributed storage systems offer reliable and cost-effective storage of large amounts of data and such storage systems will be used in future Cloud Computing. We have evaluated four large distributed storage systems. Two of these use Distributed Hash Tables (DHTs) in order to keep track of how data is distributed, and two systems use multicasting to access the stored data. We measure the read/write/delete performance, as well as the recovery time when a storage node goes down. The evaluations are done on the same hardware, consisting of 24 storage nodes and a total storage capacity of 768 TB of data. These evaluations show that the multicast approach outperforms the DHT approach

  • 130.
    Shirinbab, Sogand
    et al.
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Lundberg, Lars
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Håkansson, Jim
    Ericsson AB, SWE.
    Comparing Automatic Load Balancing using VMware DRS with a Human Expert2016In: 2016 IEEE INTERNATIONAL CONFERENCE ON CLOUD ENGINEERING WORKSHOP (IC2EW), IEEE, 2016, p. 239-246Conference paper (Refereed)
    Abstract [en]

    In recent years, there has been a rapid growth of interest in dynamic management of resources in virtualized systems. Virtualization provides great flexibility in terms of resource sharing but at the same time it also brings new challenges for load balancing using automatic migrations of virtual machines. In this paper, we have evaluated VMware's Distributed Resource Scheduler (DRS) in a number of realistic scenarios using multiple instances of a large industrial telecommunication application. We have measured the performance on the hosts before and after the migration in terms of CPU utilization, and compared DRS migrations with human expert migrations. According to our results, DRS with the most aggressive threshold gave us the best results. It could balance the load in 40% of cases while in other cases it could not balance the load properly. DRS did completely unnecessary migrations back and forth in some cases.

  • 131.
    Shirinbab, Sogand
    et al.
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Lundberg, Lars
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Ilie, Dragos
    Blekinge Institute of Technology, Faculty of Computing, Department of Communication Systems.
    Performance Comparison of KVM, VMware and XenServer using a Large Telecommunication Application2014Conference paper (Refereed)
    Abstract [en]

    One of the most important technologies in cloud computing is virtualization. This paper presents the results from a performance comparison of three well-known virtualization hypervisors: KVM, VMware and XenServer. In this study, we measure performance in terms of CPU utilization, disk utilization and response time of a large industrial real-time application. The application is running inside a virtual machine (VM) controlled by the KVM, VMware and XenServer hypervisors, respectively. Furthermore, we compare the three hypervisors based on downtime and total migration time during live migration. The results show that the Xen hypervisor results in higher CPU utilization and thus also lower maximum performance compared to VMware and KVM. However, VMware causes more write operations to disk than KVM and Xen, and Xen causes less downtime than KVM and VMware during live migration. This means that no single hypervisor has the best performance for all aspects considered here.

  • 132.
    Sidorova, Yulia
    et al.
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Lundberg, Lars
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Rosander, Oliver
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Grahn, Håkan
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Skold, Lars
    telenor, SWE.
    Recommendations for marketing campaigns in telecommunication business based on the footprint analysis: Who is a good client?2018In: 2017 8th International Conference on Information, Intelligence, Systems and Applications, IISA 2017, Institute of Electrical and Electronics Engineers Inc. , 2018, p. 1-6Conference paper (Refereed)
    Abstract [en]

    A major investment made by a telecom operator goes into the infrastructure and its maintenance, while business revenues depend on how efficiently it is exploited. We present a data-driven analytic strategy based on combinatorial optimization and analysis of historical data. The data cover historical mobility in one region of Sweden during a week. Applying the proposed method in a case study, we have identified the optimal combination of geodemographic segments in the customer base, developed a functionality to assess the potential of a planned marketing campaign, and investigated how many and which segments to target for customer base growth. A comprehensible summary of the conclusions is created via execution of the queries with a fuzzy logic component. © 2017 IEEE.

  • 133.
    Sidorova, Yulia
    et al.
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Rosander, Oliver
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Sköld, Lars
    Telenor, SWE.
    Grahn, Håkan
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Lundberg, Lars
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Finding a healthy equilibrium of geo-demographic segments for a telecom business: Who are malicious hot-spotters?2019In: Machine Learning Paradigms: Advances in Data Analytics / [ed] George A. Tsihrintzis, Dionisios N. Sotiropoulos, Lakhmi C. Jain, Springer Science and Business Media Deutschland GmbH , 2019, p. 187-196Chapter in book (Refereed)
    Abstract [en]

    In telecommunication business, a major investment goes into the infrastructure and its maintenance, while business revenues are proportional to how big, good, and well-balanced the customer base is. In our previous work we presented a data-driven analytic strategy based on combinatorial optimization and analysis of the historical mobility designed to quantify the desirability of different geo-demographic segments, and several segments were recommended for a partial reduction. Within a segment, clients are different. In order to enable intelligent reduction, we introduce the term infrastructure-stressing client and, using the proposed method, we reveal the list of the IDs of such clients. We also have developed a visualization tool to allow for manual checks: it shows how the client moved through a sequence of hot spots and was repeatedly served by critically loaded antennas. The code and the footprint matrix are available on the SourceForge. © 2019, Springer International Publishing AG, part of Springer Nature.

  • 134.
    Sidorova, Yulia
    et al.
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Sköld, Lars
    Telenor Sverige AB, SWE.
    Rosander, Oliver
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Lundberg, Lars
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Optimizing utilization in cellular radio networks using mobility data2019In: Optimization and Engineering, ISSN 1389-4420, E-ISSN 1573-2924, Vol. 20, no 1, p. 37-64Article in journal (Refereed)
    Abstract [en]

    The main resource for any telecom operator is the physical radio cell network. We present two related methods for optimizing utilization in radio networks: Tetris optimization and selective cell expansion. Tetris optimization tries to find the mix of users from different market segments that provides the most even load in the network. Selective cell expansion identifies hotspot cells, expands the capacity of these radio cells, and calculates how many subscribers the radio network can handle after the expansions. Both methods are based on linear programming and use mobility data, i.e., data defining where different categories of subscribers tend to be during different times of the week. Based on real-world mobility data from a region in Sweden, we show that Tetris optimization based on six user segments made it possible to increase the number of subscribers by 58% without upgrading the physical infrastructure. The same data show that by selectively expanding less than 6% of the cells we are able to increase the number of subscribers by more than a factor of three without overloading the network. We also investigate the best way to combine Tetris optimization and selective cell expansion. © 2018 The Author(s)

  • 135. Svahnberg, Charlie
    et al.
    Lundberg, Lars
    Roos, M
    A performance dimensioning guide for a large telecommunication system2000Conference paper (Refereed)
    Abstract [en]

    In this paper we present a performance dimensioning guide for a large telecommunication application - a billing gateway. We compare two approaches: a parametric approach where the performance predictions are based on linear combinations of the performance implications of certain parameters (i.e. the amount of filtering and formatting in the configuration), and a holistic approach where the predictions are based on recordings from a number of representative configurations. The predictions are used to select the appropriate hardware platform. We compare the two approaches for three configurations. These evaluations show that the holistic approach is more accurate and easier to use.

  • 136. Svahnberg, Mikael
    et al.
    Wohlin, Claes
    Lundberg, Lars
    Mattsson, Michael
    A Method for Understanding Quality Attributes in Software Architecture Structures.2002Conference paper (Refereed)
  • 137. Svahnberg, Mikael
    et al.
    Wohlin, Claes
    Lundberg, Lars
    Mattsson, Michael
    A Quality-Driven Decision Support Method for Identifying Software Architecture Candidates2003In: International journal of software engineering and knowledge engineering, ISSN 0218-1940, Vol. 13, no 5, p. 547-573Article in journal (Refereed)
    Abstract [en]

    To sustain the qualities of a software system during evolution, and to adapt the quality attributes as the requirements evolve, it is necessary to have a clear software architecture that is understood by all developers and to which all changes to the system adheres. This software architecture can be created beforehand, but must also be updated as the domain of the software, and hence the requirements on the software system evolve. Creating a software architecture for a system or part of a system so that the architecture fulfils the desired quality requirements is often hard. We propose a decision-support method to aid in the understanding of different architecture candidates for a software system. We propose a method that is adaptable with respect to both the set of potential architecture candidates and quality attributes relevant for the system's domain to help in this task. The method creates a support framework, using a multicriteria decision method, supporting comparison of different software architecture candidates for a specific software quality attribute and vice versa, and then uses this support framework to reach a consensus on the benefits and liabilities of the different software architecture candidates and to increase the confidence in the resulting architecture decision.

  • 138. Tomaszewski, Piotr
    et al.
    Grahn, Håkan
    Lundberg, Lars
    A Method for an Accurate Early Prediction of Faults in Modified Classes,2006Conference paper (Refereed)
  • 139. Tomaszewski, Piotr
    et al.
    Håkansson, Jim
    Grahn, Håkan
    Lundberg, Lars
    Statistical Models vs. Expert Estimation for Fault Prediction in Modified Code: an Industrial Case Study2007In: Journal of Systems and Software, ISSN 0164-1212 , Vol. 80, no 8, p. 1227-1238Article in journal (Refereed)
  • 140. Tomaszewski, Piotr
    et al.
    Håkansson, Jim
    Lundberg, Lars
    Grahn, Håkan
    The Accuracy of Fault Prediction in Modified Code –Statistical Model vs. Expert Estimation2006Conference paper (Refereed)
    Abstract [en]

    Fault prediction models still seem to be more popular in academia than in industry. In industry expert estimations of fault proneness are the most popular methods of deciding where to focus the fault defection efforts. In this paper we present a study in which we empirically evaluate the accuracy of fault prediction offered by statistical models as compared to expert estimations. The study is industry based It involves a large telecommunication system and experts that were involved in the development of this system. Expert estimations are compared to simple prediction models built on another large system, also from the telecommunication domain. We show that the statistical methods clearly outperform the expert estimations. As the main reason for the superiority of the statistical models we see their ability to cope with large datasets, which results in their ability to perform reliable predictions for larger number of components in the system, as well as the ability to perform prediction at a more fine-grain level, e.g., at the class instead of at the component level.

  • 141. Tomaszewski, Piotr
    et al.
    Lundberg, Lars
    Evaluating the Productivity in Software Development for Telecommunication Applications2004Conference paper (Refereed)
  • 142. Tomaszewski, Piotr
    et al.
    Lundberg, Lars
    Software Development Productivity on a New Platform: an Industrial Case Study2005In: Information and Software Technology, ISSN 0950-5849, E-ISSN 1873-6025, Vol. 47, no 4, p. 257-269Article in journal (Refereed)
    Abstract [en]

    The high non-functional requirements on mobile telecommunication applications call for new solutions. An example of such a solution can be a software platform that provides high performance and availability. The introduction of such a platform may, however, affect the development productivity. In this study, we present experiences from research carried out at Ericsson. The purpose of the research was productivity improvement and assessment when using the new platform. In this study, we quantify and evaluate the current productivity level by comparing it with UNIX development. The comparison is based on two large, commercially, available systems. We reveal a factor of four differences in productivity. Later, we decompose the problem into two issues: code writing speed and average amount of code necessary to deliver a certain functionality. We assess the impact of both these issues. We describe the nature of the problem by identifying factors that affect productivity and estimating their importance. To the issues identified we suggest a number of remedies. The main methods used in the study are interviews and historical data research. (C) 2004 Elsevier B.V. All rights reserved.

  • 143. Tomaszewski, Piotr
    et al.
    Lundberg, Lars
    The increase of productivity over time: an industrial case study2006In: Information and Software Technology, ISSN 0950-5849, E-ISSN 1873-6025, Vol. 48, no 9, p. 915-927Article in journal (Refereed)
  • 144. Tomaszewski, Piotr
    et al.
    Lundberg, Lars
    Grahn, Håkan
    Improving Fault Detection in Modified Code: A Study from the Telecommunication Industry2007In: Journal of Computer Science and Technology, ISSN 1000-9000, E-ISSN 1860-4749, Vol. 22, no 3, p. 397-409Article in journal (Refereed)
  • 145. Tomaszewski, Piotr
    et al.
    Lundberg, Lars
    Grahn, Håkan
    Increasing the Efficiency of Fault Detection in Modified Code2005Conference paper (Refereed)
  • 146. Tomaszewski, Piotr
    et al.
    Lundberg, Lars
    Grahn, Håkan
    The accuracy of early fault prediction in modified code2005Conference paper (Refereed)
  • 147. Tomaszewski, Piotr
    et al.
    Lundberg, Lars
    Håkansson, Jim
    Häggander, Daniel
    A Cost-Efficient Server Architecture for Real-Time Credit-Control2005Conference paper (Refereed)
  • 148. Tomaszewski, Piotr
    et al.
    Lundberg, Lars
    Håkansson, Jim
    Häggander, Daniel
    Evaluating Real-Time Credit-Control Server Architectures Implemented on a Standard Platform2005Conference paper (Refereed)
  • 149.
    Vishnubhotla, Sai Datta
    et al.
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Mendes, Emilia
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering. Blekinge Institute of Technology, Faculty of Computing, Department of Software Engineering.
    Lundberg, Lars
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    An insight into the capabilities of professionals and teams in agile software development: A systematic literature review2018In: ACM International Conference Proceeding Series, Association for Computing Machinery , 2018, p. 10-19Conference paper (Refereed)
    Abstract [en]

    Background: Previous studies investigated key characteristics of software engineers and factors influencing the performance of individuals, productivity of teams and project success within agile software development (ASD). They aided in the active investigation of human aspects in ASD. However, capability measurement and prediction with respect to agile workforce, owing to its importance, is an area that needs spotlight. Objective: The objective of this paper is to present the state of the art relating to capability measurement of software engineers and teams working in ASD projects. Method: We carried out a systematic literature review (SLR) focused on identifying attributes used for measuring and predicting the capabilities of individual software engineers and teams. Results: Evidence from 16 studies showed attributes that can measure capabilities of engineers and teams, and also attributes that can be used as capability predictors. Further, different instruments used to measure those attributes were presented. Conclusions: The SLR presented a wide list of attributes that were grouped into various categories. This information can be used by project managers as, for example, a checklist to consider when allocating software engineers to teams and in turn teams to a project. Further, this study indicated the necessity for an investigation into capability prediction models. © 2018 Association for Computing Machinery.

  • 150.
    Vishnubhotla, Sai Datta
    et al.
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Mendes, Emilia
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering. Blekinge Institute of Technology, Faculty of Computing, Department of Software Engineering.
    Lundberg, Lars
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Designing a capability-centric web tool to support agile team composition and task allocation: A work in progress2018In: 2018 IEEE/ACM 11TH INTERNATIONAL WORKSHOP ON COOPERATIVE AND HUMAN ASPECTS OF SOFTWARE ENGINEERING (CHASE), IEEE Computer Society , 2018, Vol. F137813, p. 41-44Conference paper (Refereed)
    Abstract [en]

    A significant number of studies reported models for competence profiling, measuring capabilities of professionals and recommendation systems for roles within agile software development (ASD). These models coordinated in human resource management within ASD. However, in the light of swift, incremental and iterative nature of ASD practices, designing solutions that easily integrate capability measurements with ongoing project management routines, is an important area for investigation. With the support of interviews, grounded theory procedure and workshops, we identified the aspects valued by our industrial collaborator while allocating professionals to tasks. This information was further utilized towards devising a framework for capability-centric Web tool. This tool provides a one-stop solution for project managers to create projects, keep track of capabilities and execute allocation routines. © 2018 ACM.

1234 101 - 150 of 152
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf