Ändra sökning
Avgränsa sökresultatet
3456789 251 - 300 av 534
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 251.
    Hyun Kim, Jin
    et al.
    University of Penn, PA 19104 USA.
    Kang, Inhye
    University of Seoul, South Korea.
    Kang, Sungwon
    Korea Adv Institute Science and Technology, South Korea.
    Boudjadar, Abdeldjalil
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    A Process Algebraic Approach to Resource-Parameterized Timing Analysis of Automotive Software Architectures2016Ingår i: IEEE Transactions on Industrial Informatics, ISSN 1551-3203, E-ISSN 1941-0050, Vol. 12, nr 2, 655-671 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Modern automotive software components are often first developed by different suppliers and then integrated under limited resources by a manufacturer. The integration of software components under various resource configurations is prone to timing errors because the components are resources independently designed by the supplier and viewed by the manufacturer as black boxes during the integration stage, so that imposing resource constraints/requirements on their behavior is a challenge. This paper introduces an engineering awareness environment for the analysis of automotive systems with respect to two perspectives: 1) time-aware design models that correspond to the supplier perspective; and 2) resource-aware design models imposed by the manufacturer during integration. To this end, first we propose two timed behavioral models, a time-constrained model (TcM) and a resource-constrained model (RcM) that are extended from a functional model (FM). A timing analysis of applications can hence be conducted incrementally by adopting the separation of concerns principle coming from the model-driven architectures (MDAs). Second, given a basic application component description of AUTomotive Open System Architecture with timing properties, we specify how to define the behavior of the basic components as process terms using a process algebra, algebra of communicating shared resources with value passing (ACSR-VP), in order to exploit the description capability of the language for both timing aspects and resource-constrained aspects of a system. As a result, a timed behavioral model of a system can be seamlessly refined by various resource configurations, and both platform-independent and platform-dependent timing properties of real-time systems can be analyzed in a consistent and efficient manner.

  • 252.
    Härlin, Magnus
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system.
    Testing and Gherkin in agile projects2016Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Testing in agile software development is important to ensure that the rightproduct is being developed. Is it possible to include everyone in agilesoftware development by using a business readable DSL and also createtest cases based directly on that DSL?Observations, interviews, a study of literature, third degree collectedartifacts and an implementation has been performed to analyse the processof introducing Gherkin as a tool in agile software development projects.The process of performing and conducting tests has been examined at Accedoto understand how Gherkin together with CucumberJS can be usedin projects, with the purpose of increasing collaboration between dierentroles and create a ubiquitous way of referring to the same piece of softwarewithout the need to specifying implementation details.To include the entire project team in the whole process of developingsoftware is essential for a usage of Gherkin to be successful. Since thepurpose is that everyone should be able to contribute as well as understandthe progress of development in projects and share an agreement on whatis being developed. A business readable DSL provides a uniform formatto specifying tasks causing the internal communication to be improved inprojects.

  • 253.
    Högberg, Marcus
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    A Cross-platform Picture Transfer Protocol for Linux-based Camera2015Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    The Universal Serial Bus, USB, is widely used for connecting peripheral devices to a computer. Through the years devices that use USB has evolved and more and more complicated communication protocols have been developed using the USB standard. There are many different ways to set up communication between a USB device and a host computer. The USB standard does not include any security and this poses risks when designing communication over such a connection.

    This thesis investigates how a USB-based picture transfer protocol can be designed between a small camera running embedded Linux and a host computer. The USB functionality in Windows and Mac OS/X operating systems are investigated. Solutions to create a secure USB communication are also investigated. One of three the methods of creating a USB connection with a USB device running embedded Linux are chosen based on the investigations. A protocol is then designed and an implementation developed. The protocol designed in the thesis uses existing USB functionality in the host computer operating systems Windows and Mac OS/X.

    The designed protocol is evaluated for performance and security. The evaluation is made on an evaluation platform for the camera. The transfer speed of the protocol is measured to around 18 MB/s in an ideal environment. The designed protocol could be improved by using one of the security methods found in the investigations.

  • 254.
    Islam, Md. Zahidul
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    A Cloud Based Platform for Big Data Science2014Självständigt arbete på avancerad nivå (masterexamen), 30 poäng / 45 hpStudentuppsats (Examensarbete)
    Abstract [en]

    With the advent of cloud computing, resizable scalable infrastructures for data processing is now available to everyone. Software platforms and frameworks that support data intensive distributed applications such as Amazon Web Services and Apache Hadoop enable users to the necessary tools and infrastructure to work with thousands of scalable computers and process terabytes of data. However writing scalable applications that are run on top of these distributed frameworks is still a demanding and challenging task. The thesis aimed to advance the core scientific and technological means of managing, analyzing, visualizing, and extracting useful information from large data sets, collectively known as “big data”. The term “big-data” in this thesis refers to large, diverse, complex, longitudinal and/or distributed data sets generated from instruments, sensors, internet transactions, email, social networks, twitter streams, and/or all digital sources available today and in the future. We introduced architectures and concepts for implementing a cloud-based infrastructure for analyzing large volume of semi-structured and unstructured data. We built and evaluated an application prototype for collecting, organizing, processing, visualizing and analyzing data from the retail industry gathered from indoor navigation systems and social networks (Twitter, Facebook etc). Our finding was that developing large scale data analysis platform is often quite complex when there is an expectation that the processed data will grow continuously in future. The architecture varies depend on requirements. If we want to make a data warehouse and analyze the data afterwards (batch processing) the best choices will be Hadoop clusters and Pig or Hive. This architecture has been proven in Facebook and Yahoo for years. On the other hand, if the application involves real-time data analytics then the recommendation will be Hadoop clusters with Storm which has been successfully used in Twitter. After evaluating the developed prototype we introduced a new architecture which will be able to handle large scale batch and real-time data. We also proposed an upgrade of the existing prototype to handle real-time indoor navigation data.

  • 255.
    Izosimov, Viacheslav
    et al.
    Embedded Intelligent Solutions (EIS) by Semcon AB, Linköping, Sweden.
    Di Guglielmo, Giuseppe
    University of Verona, Italy.
    Lora, Michele
    University of Verona, Italy.
    Pravadelli, Graziano
    University of Verona, Italy.
    Fummi, Franco
    University of Verona, Italy.
    Peng, Zebo
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Fujita, Masahiro
    University of Tokyo, Japan; Japan Scence and Technology Agency, Japan.
    Time-Constraint-Aware Optimization of Assertions in Embedded Software2012Ingår i: Journal of electronic testing, ISSN 0923-8174, E-ISSN 1573-0727, Vol. 28, nr 4, 469-486 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Technology shrinking and sensitization have led to more and more transient faults in embedded systems. Transient faults are intermittent and non-predictable faults caused by external events, such as energetic particles striking the circuits. These faults do not cause permanent damages, but may affect the running applications. One way to ensure the correct execution of these embedded applications is to keep debugging and testing even after shipping of the systems, complemented with recovery/restart options. In this context, the executable assertions that have been widely used in the development process for design validation can be deployed again in the final product. In this way, the application will use the assertion to monitor itself under the actual execution and will not allow erroneous out-of-the-specification behavior to manifest themselves. This kind of software-level fault tolerance may represent a viable solution to the problem of developing commercial off-the-shelf embedded systems with dependability requirements. But software-level fault tolerance comes at a computational cost, which may affect time-constrained applications. Thus, the executable assertions shall be introduced at the best possible points in the application code, in order to satisfy timing constraints, and to maximize the error detection efficiency. We present an approach for optimization of executable assertion placement in time-constrained embedded applications for the detection of transient faults. In this work, assertions have different characteristics such as tightness, i.e., error coverage, and performance degradation. Taking into account these properties, we have developed an optimization methodology, which identifies candidate locations for assertions and selects a set of optimal assertions with the highest tightness at the lowest performance degradation. The set of selected assertions is guaranteed to respect the real-time deadlines of the embedded application. Experimental results have shown the effectiveness of the proposed approach, which provides the designer with a flexible infrastructure for the analysis of time-constrained embedded applications and transient-fault-oriented executable assertions.

  • 256.
    Jensen, Henrik
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Industry Foundation Classes: A study of its requested use in Configura2015Självständigt arbete på grundnivå (högskoleexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Configura Sverige AB is developing the software solutions Configura and CET Designer for companies dealing with highly configurable and complex products that also require space planning. The aim is to simplify the selling process. Configura Sverige AB has received requests from their customers to be able to read and write files according to an ISO standard called Industry Foundation Classes (IFC). IFC is an open international standard within Building Information Modeling (BIM) to exchange data between different software applications used for projects in the building industry and facility management. To assist Configura Sverige AB in a decision on how to further proceed, questions why users request IFC, how they need to work with IFC, and about possible workflows with IFC are considered in this thesis. To answer the questions, an interpretive case study method was used to view the questions from different perspectives. A qualitative approach was used to collect and analyze data, involving for example a survey among users requesting IFC and input from two different contractors requesting IFC files from these users. The results show that users have been requested by architects and contractors to supply IFC files, and a conclusion is that demands on the use of BIM and IFC within the public sector in certain countries is a major reason to these requests. The results has much focus on import and export of IFC files and on possible workflows using IFC files. With IFC files, users may be a part of a collaboration between several different disciplines within the building industry. Users need to base their work on other disciplines models, which in many cases will be the architect's IFC file. An IFC export shall only include the user's products, it will be up to another application to integrate these products in a coordination BIM. The IFC export will be used for interdisciplinary coordination, visualization and collision detection and it is important to use simple graphical representation of the products.

  • 257.
    Jiang, Ke
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Security-Driven Design of Real-Time Embedded Systems2015Doktorsavhandling, monografi (Övrigt vetenskapligt)
    Abstract [en]

    Real-time embedded systems (RTESs) have been widely used in modern society. And it is also very common to find them in safety and security critical applications, such as transportation and medical equipment. There are, usually, several constraints imposed on a RTES, for example, timing, resource, energy, and performance, which must be satisfied simultaneously. This makes the design of such systems a difficult problem.

    More recently, the security of RTESs emerges as a major design concern, as more and more attacks have been reported. However, RTES security, as a parameter to be considered during the design process, has been overlooked in the past. This thesis approaches the design of secure RTESs focusing on aspects that are particularly important in the context of RTES, such as communication confidentiality and side-channel attack resistance.

    Several techniques are presented in this thesis for designing secure RTESs, including hardware/software co-design techniques for communication confidentiality on distributed platforms, a global framework for secure multi-mode real-time systems, and a scheduling policy for thwarting differential power analysis attacks. 

    All the proposed solutions have been extensively evaluated in a large amount of experiments, including two real-life case studies, which demonstrate the efficiency of the presented techniques.

  • 258.
    Jiang, Ke
    et al.
    Linköpings universitet, Institutionen för datavetenskap, ESLAB - Laboratoriet för inbyggda system. Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Batina, Lejla
    Institute for Computing and Information Sciences, Radboud University Nijmegen, The Netherlands.
    Eles, Petru
    Linköpings universitet, Institutionen för datavetenskap, ESLAB - Laboratoriet för inbyggda system. Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Peng, Zebo
    Linköpings universitet, Institutionen för datavetenskap, ESLAB - Laboratoriet för inbyggda system. Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Robustness Analysis of Real-Time Scheduling Against Differential Power Analysis Attacks2014Ingår i: IEEE Computer Society Annual Symposium on VLSI, IEEE Computer Society, 2014, 450-455 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    Embedded systems (ESs) have been a prominent solution for enhancing system performance and reliability in recent years. ESs that are required to ensure functional correctness under timing constraints are referred to as real-time embedded systems (RTESs). With the emerging trend of utilizing RTESs in safety and reliability critical areas, security of RTESs, especially confidentiality of the communication, becomes of great importance. More recently, side-channel attacks (SCAs) posed serious threats to confidentiality protection mechanisms, namely, cryptographic algorithms. In this work, we present the first analytical framework for quantifying the influence of real-time scheduling policies on the robustness of secret keys against differential power analysis (DPA) attacks, one of the most popular type of SCAs. We validated the proposed concept on two representative scheduling algorithms, earliest deadline first scheduling (EDF) and rate-monotonic scheduling (RMS), via extensive experiments.

  • 259.
    Jiang, Ke
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Eles, Petru Ion
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Peng, Zebo
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Power-Aware Design Techniques of Secure Multimode Embedded Systems2016Ingår i: ACM Transactions on Embedded Computing Systems, ISSN 1539-9087, E-ISSN 1558-3465, Vol. 15, nr 1, 6- s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Nowadays, embedded systems have been widely used in all types of application areas, some of which belong to the safety and reliability critical domains. The functional correctness and design robustness of the embedded systems involved in such domains are crucial for the safety of personal/enterprise property or even human lives. Thereby, a holistic design procedure that considers all the important design concerns is essential. In this article, we approach embedded systems design from an integral perspective. We consider not only the classic real-time and quality of service requirements, but also the emerging security and power efficiency demands. Modern embedded systems are not any more developed for a fixed purpose, but instead designed for undertaking various processing requests. This leads to the concept of multimode embedded systems, in which the number and nature of active tasks change during runtime. Under dynamic situations, providing high performance along with various design concerns becomes a really difficult problem. Therefore, we propose a novel power-aware secure embedded systems design framework that efficiently solves the problem of runtime quality optimization with security and power constraints. The efficiency of our proposed techniques are evaluated in extensive experiments.

  • 260.
    Jiang, Ke
    et al.
    Linköpings universitet, Institutionen för datavetenskap, ESLAB - Laboratoriet för inbyggda system. Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Eles, Petru
    Linköpings universitet, Institutionen för datavetenskap, ESLAB - Laboratoriet för inbyggda system. Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Peng, Zebo
    Linköpings universitet, Institutionen för datavetenskap, ESLAB - Laboratoriet för inbyggda system. Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    A Design Framework for Dynamic Embedded Systems with Security Constraints2013Ingår i: The 12th Swedish System-on-Chip Conference (SSoCC 2013), Ystad, Sweden, May 6-7, 2013 (not reviewed, not printed)., 2013Konferensbidrag (Övrigt vetenskapligt)
  • 261.
    Jiang, Ke
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Eles, Petru
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Peng, Zebo
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Optimization of Secure Embedded Systems with Dynamic Task Sets2013Ingår i: Design, Automation & Test in Europe (DATE 2013), IEEE , 2013, 1765-1770 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, we approach embedded systems design from a new angle that considers not only quality of service but also security as part of the design process. Moreover, we also take into consideration the dynamic aspect of modern embedded systems in which the number and nature of active tasks are variable during run-time. In this context, providing both high quality of service and guaranteeing the required level of security becomes a difficult problem. Therefore, we propose a novel secure embedded systems design framework that efficiently solves the problem of run-time quality optimization with security constraints. Experiments demonstrate the efficiency of our proposed techniques.

  • 262.
    Jiang, Ke
    et al.
    Linköpings universitet, Institutionen för datavetenskap, ESLAB - Laboratoriet för inbyggda system. Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Eles, Petru
    Linköpings universitet, Institutionen för datavetenskap, ESLAB - Laboratoriet för inbyggda system. Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Peng, Zebo
    Linköpings universitet, Institutionen för datavetenskap, ESLAB - Laboratoriet för inbyggda system. Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Performance Comparison of Simulated Annealing and Tabu Search on Block Cipher Optimization in Distributed Embedded Systems2011Ingår i: The 11th Swedish System-on-Chip Conference, Varberg, Sweden, May 2-3, 2011, 2011Konferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    In this paper, we consider distributed embedded systems in which privacy or confidentiality of the internal communication is critical, and present an approach to optimize cryptographic algorithms under strict timing constraints. We have developed a technique searching for the best system-affordable cryptographic protection for the messages transmitted over the internal communication bus. On account of the complexity of the problem, finding the optimal solution is only feasible for very small systems. Therefore, we formulate the technique in two efficient metaheuristics, and study their performance from extensive experiments.

  • 263.
    Jiang, Ke
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Eles, Petru
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Peng, Zebo
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Power-Aware Design Techniques of Secure Multimode Embedded Systems2016Ingår i: ACM Transactions on Embedded Computing Systems, ISSN 1539-9087, E-ISSN 1558-3465, Vol. 15, 6:1-6:29 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Nowadays, embedded systems have been widely used in all types of application areas, some of which belong to the safety and reliability critical domains. The functional correctness and design robustness of the embedded systems involved in such domains are crucial for the safety of personal/enterprise property or even human lives. Thereby, a holistic design procedure that considers all the important design concerns is essential.

    In this article, we approach embedded systems design from an integral perspective. We consider not only the classic real-time and quality of service requirements, but also the emerging security and power efficiency demands. Modern embedded systems are not any more developed for a fixed purpose, but instead designed for undertaking various processing requests. This leads to the concept of multimode embedded systems, in which the number and nature of active tasks change during runtime. Under dynamic situations, providing high performance along with various design concerns becomes a really difficult problem. Therefore, we propose a novel power-aware secure embedded systems design framework that efficiently solves the problem of runtime quality optimization with security and power constraints. The efficiency of our proposed techniques are evaluated in extensive experiments.

  • 264.
    Jiang, Ke
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Eles, Petru
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Peng, Zebo
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Chattopadhyay, Sudipta
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Batina, Lejla
    Radboud University Nijmegen, The Netherlands.
    SPARTA: A scheduling policy for thwarting differential power analysis attacks2016Ingår i: 2016 21ST ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE (ASP-DAC), IEEE Press, 2016, 667-672 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    Embedded systems (ESs) have been widely used in various application domains. It is very important to design ESs that guarantee functional correctness of the system under strict timing constraints. Such systems are known as the real-time embedded systems (RTESs). More recently, RTESs started to be utilized in safety and reliability critical areas, which made the overlooked security issues, especially confidentiality of the communication, a serious problem. Differential power analysis attacks (DPAs) pose serious threats to confidentiality protection mechanisms, i.e., implementations of cryptographic algorithms, on embedded platforms. In this work, we present a scheduling policy, SPARTA, that thwarts DPAs. Theoretical guarantees and preliminary experimental results are presented to demonstrate the efficiency of the SPARTA scheduler.

  • 265.
    Jiang, Ke
    et al.
    Linköpings universitet, Institutionen för datavetenskap, ESLAB - Laboratoriet för inbyggda system. Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Lifa, Adrian Alin
    Linköpings universitet, Institutionen för datavetenskap, ESLAB - Laboratoriet för inbyggda system. Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Eles, Petru
    Linköpings universitet, Institutionen för datavetenskap, ESLAB - Laboratoriet för inbyggda system. Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Peng, Zebo
    Linköpings universitet, Institutionen för datavetenskap, ESLAB - Laboratoriet för inbyggda system. Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Jiang, Wei
    University of Electronic Science and Technology of China, Chengdu.
    Energy-Aware Design of Secure Multi-Mode Real-Time Embedded Systems with FPGA Co-Processors2013Ingår i: Proceedings of the 21st International conference on Real-Time Networks and Systems / [ed] Michel Auguin, Robert de Simone, Robert Davis, Emmanuel Grolleau, New York: Association for Computing Machinery (ACM), 2013, 109-118 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    We approach the emerging area of energy efficient, secure real-time embedded systems design. Many modern embedded systems have to fulfill strict security constraints and are often required to meet stringent deadlines in different operation modes, where the number and nature of active tasks vary (dynamic task sets). In this context, the use of dynamic voltage/frequency scaling (DVFS) techniques and onboard field-programmable gate array (FPGA) co-processors offer new dimensions for energy savings and performance enhancement. We propose a novel design framework that provides the best security protection consuming the minimal energy for all operation modes of a system. Extensive experiments demonstrate the efficiency of our techniques.

  • 266.
    Jiang, Wei
    et al.
    School of Computer Science and Technology, University of Electronic Science and Technology of China.
    Jiang, Ke
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Ma, Yue
    School of Computer Science and Technology, University of Electronic Science and Technology of China.
    Resource Allocation of Security-Critical Tasks with Statistically Guaranteed Energy Constraint2012Ingår i: International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2012), Seoul, Korea, August 19-22, 2012., IEEE , 2012, 330-339 s.Konferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    In this paper, we are interested in resourceallocation for energy constrained and security-criticalembedded systems. Tasks in such systems need to besuccessfully executed under certain energy budget and berobust against serious security threatens. Different to formerenergy minimal scheduling problem, we introduce a newoptimization problem for a set of tasks with energyconstraint and multiple security choices. We present adynamic programming based approximation algorithm tominimize the security risk of the system while statisticallyguaranteeing energy consumption constraints for givenenergy slack ratio. The proposed algorithm is very efficientin both time and space dimensions, and achieves goodsolutions. Extensive simulations demonstrate the superiorityof our algorithm over other approaches.

  • 267.
    Jiang, Wei
    et al.
    School of Computer Science and Engineering, University of Electronic Science and Technology of China, China School of Information and Software Engineering, University of Electronic Science and Technology of China, China .
    Jiang, Ke
    Linköpings universitet, Institutionen för datavetenskap, ESLAB - Laboratoriet för inbyggda system. Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Zhang, Xia
    School of Information and Software Engineering, University of Electronic Science and Technology of China, China .
    Ma, Yue
    Department of Computer Science and Engineering, University of Notre Dame, United States .
    Energy Aware Real-Time Scheduling Policy with Guaranteed Security Protection2014Ingår i: 2014 19TH ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE (ASP-DAC), IEEE conference proceedings, 2014, 317-322 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this work, we address the emerging scheduling problem existed in the design of secure and energy-efficient real-time embedded systems. The objective is to minimize the energy consumption subject to security and schedulability constraints. Due to the complexity of the problem, we propose a dynamic programming based approximation approach to find the near-optimal solutions with respect to predefined security constraint. The proposed technique has polynomial time complexity which is about half of traditional approximation approaches. The efficiency of our algorithm is validated by extensive experiments.

  • 268.
    Jiang, Wei
    et al.
    University of Elect Science and Technology China, Peoples R China.
    Jiang, Ke
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Zhang, Xia
    University of Texas Dallas, TX 75230 USA.
    Ma, Yue
    University of Notre Dame, IN 46556 USA.
    Energy Optimization of Security-Critical Real-Time Applications with Guaranteed Security Protection2015Ingår i: Journal of systems architecture, ISSN 1383-7621, E-ISSN 1873-6165, Vol. 61, nr 7, 282-292 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Designing energy-efficient applications has become of critical importance for embedded systems, especially for battery-powered systems. Additionally, the emerging requirements on both security and real-time make it much more difficult to produce ideal solutions. In this work, we address the emerging scheduling problem existed in the design of secure and energy-efficient real-time embedded systems. The objective is to minimize the system energy consumption subject to security and schedulability constraints. Due to the complexity of the problem, we propose a dynamic programming based approximation approach to find efficient solutions under given constraints. The proposed technique has polynomial time complexity which is half of existing approximation approaches. The efficiency of our algorithm is validated by extensive experiments and a real-life case study. Comparing with other approaches, the proposed approach achieves energy-saving up to 37.6% without violating the real-time and security constraints of the system.

  • 269.
    Jianqiang, Cheng
    et al.
    Univ. Paris Sud, France.
    Kosuch, Stefanie
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Lisser, Abdel
    Univ. Paris Sud, France.
    Stochastic Shortest Path Problem with Uncertain Delays2012Ingår i: Proceedings of the 1st International Conference on Operations Research and Enterprise Systems (ICORES-2012 / [ed] Carlos J. Luz, Fernando Valente, 2012, 256-264 s.Konferensbidrag (Övrigt vetenskapligt)
  • 270.
    Johansson, Marcus
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system.
    Generating SkePU Code from Automatically Detected Algorithmic Patterns in C Source Programs2016Självständigt arbete på grundnivå (kandidatexamen), 10,5 poäng / 16 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Modern heterogeneous multi-core architectures containing one or multiple GPU de- vices require expert knowledge in order to be fully utilized through parallelization by the programmer. Software written for one hardware setup might not easily be portable to work as efficiently on a differing architecture. Automatic parallelization of sequential C code to make efficient use of such architecture in an extensible man- ner would facilitate the porting of legacy code and provide a non-expert programmer with a tool granting access to modern hardware architectures.

    We present an early prototype of such an extensible tool-chain and attempt to apply it on domain-specific C source code. It is based on a generic tool for hierarchical pattern matching in C source codes, where the user can define own patterns and recognition rules, and a code generation back-end. We show how it, combined with existing libraries, can be used to automatically port sequential legacy code to different multicore architectures, such as multicore CPUs and GPUs. Our tool is an attempt to do this and yields valid parallelized code, but fails to reach speedup for most implemented patterns. The tool is applied on one test case, a legacy ODE implementation in C, with similar results. A reason for slowdown is discussed in the concluding section.

  • 271.
    Jonsson, Anders
    et al.
    University of Pompeu Fabra, Spain .
    Jonsson, Peter
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Lööw, Tomas
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Limitations of acyclic causal graphs for planning2014Ingår i: Artificial Intelligence, ISSN 0004-3702, E-ISSN 0374-2539, Vol. 210, 36-55 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Causal graphs are widely used in planning to capture the internal structure of planning instances. Researchers have paid special attention to the subclass of planning instances with acyclic causal graphs, which in the past have been exploited to generate hierarchical plans, to compute heuristics, and to identify classes of planning instances that are easy to solve. This naturally raises the question of whether planning is easier when the causal graph is acyclic. In this article we show that the answer to this question is no, proving that in the worst case, the problem of plan existence is PSPACE-complete even when the causal graph is acyclic. Since the variables of the planning instances in our reduction are propositional, this result applies to STRIPS planning with negative preconditions. We show that the reduction still holds if we restrict actions to have at most two preconditions. Having established that planning is hard for acyclic causal graphs, we study two subclasses of planning instances with acyclic causal graphs. One such subclass is described by propositional variables that are either irreversible or symmetrically reversible. Another subclass is described by variables with strongly connected domain transition graphs. In both cases, plan existence is bounded away from PSPACE, but in the latter case, the problem of bounded plan existence is hard, implying that optimal planning is significantly harder than satisficing planning for this class.

  • 272.
    Jonsson, Anders
    et al.
    Universitat Pompeu Fabra, Barcelona, Spain.
    Jonsson, Peter
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Lööw, Tomas
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    When Acyclicity is not Enough: Limitations of the Causal Graph2013Ingår i: Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, AAAI Press, 2013, 117-125 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    Causal graphs are widely used in planning to capture the internal  structure of planning instances. In the past, causal graphs have been exploited to generate hierarchical plans, to compute heuristics, and  to identify classes of planning instances that are easy to solve. It  is generally believed that planning is easier when the causal graph is acyclic. In this paper we show that this is not true in the worst  case, proving that the problem of plan existence is PSPACE-complete  even when the causal graph is acyclic. Since the variables of the  planning instances in our reduction are propositional, this result  applies to STRIPS planning with negative pre-conditions. Having  established that planning is hard for acyclic causal graphs, we study  a subclass of planning instances with acyclic causal graphs whose  variables have strongly connected domain transition graphs. For this  class, we show that plan existence is easy, but that bounded plan  existence is hard, implying that optimal planning is significantly  harder than satisficing planning for this class.

  • 273.
    Jonsson, Leif
    et al.
    Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska fakulteten. Ericsson AB, Sweden.
    Borg, Markus
    Lund University, Sweden.
    Broman, David
    KTH Royal Institute Technology, Sweden; University of Calif Berkeley, CA 94720 USA.
    Sandahl, Kristian
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Eldh, Sigrid
    Ericsson AB, Sweden.
    Runeson, Per
    Lund University, Sweden.
    Automated bug assignment: Ensemble-based machine learning in large scale industrial contexts2016Ingår i: Journal of Empirical Software Engineering, ISSN 1382-3256, E-ISSN 1573-7616, Vol. 21, nr 4, 1533-1578 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Bug report assignment is an important part of software maintenance. In particular, incorrect assignments of bug reports to development teams can be very expensive in large software development projects. Several studies propose automating bug assignment techniques using machine learning in open source software contexts, but no study exists for large-scale proprietary projects in industry. The goal of this study is to evaluate automated bug assignment techniques that are based on machine learning classification. In particular, we study the state-of-the-art ensemble learner Stacked Generalization (SG) that combines several classifiers. We collect more than 50,000 bug reports from five development projects from two companies in different domains. We implement automated bug assignment and evaluate the performance in a set of controlled experiments. We show that SG scales to large scale industrial application and that it outperforms the use of individual classifiers for bug assignment, reaching prediction accuracies from 50 % to 89 % when large training sets are used. In addition, we show how old training data can decrease the prediction accuracy of bug assignment. We advice industry to use SG for bug assignment in proprietary contexts, using at least 2,000 bug reports for training. Finally, we highlight the importance of not solely relying on results from cross-validation when evaluating automated bug assignment.

  • 274.
    Jonsson, Leif
    et al.
    Linköpings universitet, Institutionen för datavetenskap, PELAB - Laboratoriet för programmeringsomgivningar. Ericsson AB, Sweden.
    Broman, David
    KTH Royal Institute Technology, Sweden; University of Calif Berkeley, CA USA.
    Magnusson, Måns
    Linköpings universitet, Institutionen för datavetenskap, Statistik. Linköpings universitet, Tekniska fakulteten.
    Sandahl, Kristian
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Villani, Mattias
    Linköpings universitet, Institutionen för datavetenskap, Statistik. Linköpings universitet, Filosofiska fakulteten.
    Eldh, Sigrid
    Ericsson AB, Sweden.
    Automatic Localization of Bugs to Faulty Components in Large Scale Software Systems using Bayesian Classification2016Ingår i: 2016 IEEE INTERNATIONAL CONFERENCE ON SOFTWARE QUALITY, RELIABILITY AND SECURITY (QRS 2016), IEEE , 2016, 425-432 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    We suggest a Bayesian approach to the problem of reducing bug turnaround time in large software development organizations. Our approach is to use classification to predict where bugs are located in components. This classification is a form of automatic fault localization (AFL) at the component level. The approach only relies on historical bug reports and does not require detailed analysis of source code or detailed test runs. Our approach addresses two problems identified in user studies of AFL tools. The first problem concerns the trust in which the user can put in the results of the tool. The second problem concerns understanding how the results were computed. The proposed model quantifies the uncertainty in its predictions and all estimated model parameters. Additionally, the output of the model explains why a result was suggested. We evaluate the approach on more than 50000 bugs.

  • 275.
    Jonsson, Marcus
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system.
    Resource planning in a multi-project organization: A case study at Sanmina in Örnsköldsvik2016Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    To plan resources for multiple parallel projects is not an easy task, this has been experienced at a contract manufacturing company called Sanmina in Örnsköldsvik where this thesis work was performed. The aim of this thesis was to identify the problems with the resource planning process used today and to come up with a feasible solution. Different factors such as routines, formalization, time resources and opportunities for recuperation was also investigated to see if a solution to the identified problems could be used to decrease the amount of perceived psychological stress reactions. The thesis was divided into three phases, a pre-study phase, an implementation phase and an evaluation phase. In the pre-study phase a series of interviews was performed to get a better understanding of the current problems and this knowledge was then used to see if any existing tool for resource planning could be used. No tool was found that fulfilled all the requirements. In the implementation phase a new tool was developed with the requirements found in the pre-study. In the evaluation phase this new tool was tested in workshops on faked projects and then evaluated in the form of interviews with the attendees. The conclusion from this evaluation is that this new tool will in fact reduce the perceived amount of stress in the studied case at Sanmina in Örnsköldsvik. To be able to verify that this is the case for any multi-project organization a much more extensive evaluation would have to be done with real projects in different companies in different trades.

  • 276.
    Jonsson, Peter
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Finite Unary Relations and Qualitative Constraint Satisfaction2016Ingår i: ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, IOS PRESS , 2016, Vol. 285, 37-45 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    Extending qualitative CSPs with the ability of restricting selected variables to finite sets of possible values has been proposed as an important research direction with important applications. Complexity results for this kind of formalisms have appeared in the literature but they focus on concrete examples and not on general principles. We propose three general methods. The first two methods are based on analysing the given CSP from a model-theoretical perspective, while the third method is based on directly analysing the growth of the representation of solutions. We exemplify our methods on temporal and spatial formalisms including Allens algebra and RCC5.

  • 277.
    Jonsson, Peter
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Lagerkvist, Victor
    Technical University of Dresden, Germany.
    An initial study of time complexity in infinite-domain constraint satisfaction2017Ingår i: Artificial Intelligence, ISSN 0004-3702, E-ISSN 1872-7921, Vol. 245, 115-133 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The constraint satisfaction problem (CSP) is a widely studied problem with numerous applications in computer science and artificial intelligence. For infinite-domain CSPs, there are many results separating tractable and NP-hard cases while upper and lower bounds on the time complexity of hard cases are virtually unexplored, Hence, we initiate a study of the worst-case time complexity of such CSPs, We analyze backtracking algorithms and determine upper bounds on their time complexity. We present asymptotically faster algorithms based on enumeration techniques and we show that these algorithms are applicable to well-studied problems in, for instance, temporal reasoning. Finally, we prove non-trivial lower bounds applicable to many interesting CSPs, under the assumption that certain complexity-theoretic assumptions hold. The gap between upper and lower bounds is in many cases surprisingly small, which suggests that our upper bounds cannot be significantly improved. (C) 2017 Elsevier B.V. All rights reserved.

    Publikationen är tillgänglig i fulltext från 2019-01-27 14:26
  • 278.
    Jonsson, Peter
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Lagerkvist, Victor
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Upper and Lower Bounds on the Time Complexity of Infinite-domain CSPs2015Ingår i: Principles and Practice of Constraint Programming - 21st International Conference, CP 2015, Cork, Ireland, August 31 - September 4, 2015, Proceedings, Springer Berlin/Heidelberg, 2015, Vol. 9255, 183-199 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    The constraint satisfaction problem (CSP) is a widely studied problem with numerous applications in computer science. For infinite-domain CSPs, there are many results separating tractable and NP-hard cases while upper bounds on the time complexity of hard cases are virtually unexplored. Hence, we initiate a study of the worst-case time cmplexity of such CSPs. We analyse backtracking algorithms and show that they can be improved by exploiting sparsification. We present even faster algorithms based on enumerating finite structures. Last, we prove non-trivial lower bounds applicable to many interesting CSPs, under the assumption that the strong exponential-time hypothesis is true.

  • 279.
    Jonsson, Peter
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Lagerkvist, Victor
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Nordh, Gustav
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Blowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction2013Ingår i: Principles and Practice of Constraint Programming / [ed] Christian Schulte, Springer Berlin/Heidelberg, 2013, 398-414 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    We consider methods for constructing NP-intermediate problems under the assumption that P ≠ NP. We generalize Ladner’s original method for obtaining NP-intermediate problems by using parameters with various characteristics. In particular, this generalization allows us to obtain new insights concerning the complexity of CSP problems. We begin by fully characterizing the problems that admit NP-intermediate subproblems for a broad and natural class of parameterizations, and extend the result further such that structural CSP restrictions based on parameters that are hard to compute (such as tree-width) are covered. Hereby we generalize a result by Grohe on width parameters and NP-intermediate problems. For studying certain classes of problems, including CSPs parameterized by constraint languages, we consider more powerful parameterizations. First, we identify a new method for obtaining constraint languages Γ such that CSP(Γ) are NP-intermediate. The sets Γ can have very different properties compared to previous constructions (by, for instance, Bodirsky & Grohe) and provides insights into the algebraic approach for studying the complexity of infinite-domain CSPs. Second, we prove that the propositional abduction problem parameterized by constraint languages admits NP-intermediate problems. This settles an open question posed by Nordh & Zanuttini.

  • 280.
    Jonsson, Peter
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Lagerkvist, Victor
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Nordh, Gustav
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Constructing NP-intermediate problems by blowing holes with parameters of various properties2015Ingår i: Theoretical Computer Science, ISSN 0304-3975, Vol. 581, 67-82 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The search for natural NP-intermediate problems is one of the holy grails within computational complexity. Ladners original diagonalization technique for generating NP-intermediate problems, blowing holes, has a serious shortcoming: it creates problems with a highly artificial structure by arbitrarily removing certain problem instances. In this article we limit this problem by generalizing Ladners method to use parameters with various characteristics. This allows one to define more fine-grained parameters, resulting in NP-intermediate problems where we only blow holes in a controlled subset of the problem. We begin by fully characterizing the problems that admit NP-intermediate subproblems for a broad and natural class of parameterizations, and extend the result further such that structural CSP restrictions based on parameters that are hard to compute (such as tree-width) are covered, thereby generalizing a result by Grohe. For studying certain classes of problems, including CSPs parameterized by constraint languages, we consider more powerful parameterizations. First, we identify a new method for obtaining constraint languages Gamma such that CSP(Gamma) are NP-intermediate. The sets Gamma can have very different properties compared to previous constructions (by, for instance, Bodirsky and Grohe) and provides insights into the algebraic approach for studying the complexity of infinite-domain CSPs. Second, we prove that the propositional abduction problem parameterized by constraint languages admits NP-intermediate problems. This settles an open question posed by Nordh and Zanuttini. (C) 2015 Elsevier B.V. All rights reserved.

  • 281.
    Jonsson, Peter
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Lagerkvist, Victor
    Technical University of Dresden, Germany.
    Nordh, Gustav
    Kvarnvagen 6, Sweden.
    Zanuttini, Bruno
    Normandie University, France.
    Strong partial clones and the time complexity of SAT problems2017Ingår i: Journal of computer and system sciences (Print), ISSN 0022-0000, E-ISSN 1090-2724, Vol. 84, 52-78 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Improving exact exponential-time algorithms for NP-complete problems is an expanding research area. Unfortunately, general methods for comparing the complexity of such problems are sorely lacking. In this article we study the complexity of SAT(S) with reductions increasing the amount of variables by a constant (CV-reductions) or a constant factor (LV-reductions). Using clone theory we obtain a partial order amp;lt; on languages such that SAT(S) is CV-reducible to SAT(S) if S amp;lt; S. With this ordering we identify the computationally easiest NP-complete SAT(S) problem (SAT({R})), which is strictly easier than 1-in-3-SAT. We determine many other languages in amp;lt; and bound their complexity in relation to SAT({R}). Using LV-reductions we prove that the exponential-time hypothesis is false if and only if all SAT(S) problems are subexponential. This is extended to cover degree-bounded SAT(S) problems. Hence, using clone theory, we obtain a solid understanding of the complexity of SAT(S) with CV-and LV-reductions. (C) 2016 Elsevier Inc. All rights reserved.

  • 282.
    Jonsson, Peter
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Lagerkvist, Victor
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Schmidt, Johannes
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Uppman, Hannes
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis2014Ingår i: Mathematical Foundations of Computer Science 2014: 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II / [ed] Erzsébet Csuhaj-Varjú, Martin Dietzfelbinger, Zoltán Ésik, Springer Berlin/Heidelberg, 2014, 408-419 s.Kapitel i bok, del av antologi (Refereegranskat)
    Abstract [en]

    Obtaining lower bounds for NP-hard problems has for a long time been an active area of research. Recent algebraic techniques introduced by Jonsson et al. (SODA 2013) show that the time complexity of the parameterized SAT(·) problem correlates to the lattice of strong partial clones. With this ordering they isolated a relation R such that SAT(R) can be solved at least as fast as any other NP-hard SAT(·) problem. In this paper we extend this method and show that such languages also exist for the max ones problem (Max-Ones(Γ)) and the Boolean valued constraint satisfaction problem over finite-valued constraint languages (VCSP(Δ)). With the help of these languages we relate Max-Ones and VCSP to the exponential time hypothesis in several different ways.

  • 283.
    Jonsson, Peter
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Lagerkvist, Viktor
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Nordh, Gustav
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Zanuttini, Bruno
    Université de Caen Basse-Normandie, France.
    Complexity of SAT problems, Clone Theory and the Exponential Time Hypothesis2013Ingår i: SODA-2013, SIAM , 2013, 1264-1277 s.Konferensbidrag (Refereegranskat)
  • 284.
    Jonsson, Peter
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Lööw, Tomas
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Computational complexity of linear constraints over the integers2013Ingår i: Artificial Intelligence, ISSN 0004-3702, E-ISSN 0374-2539, Vol. 195, 44-62 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Temporal reasoning problems arise in many areas of Al, including planning, natural language understanding, and reasoning about physical systems. The computational complexity of continuous-time temporal constraint reasoning is fairly well understood. There are, however, many different cases where discrete time must be considered; various scheduling problems and reasoning about sampled physical systems are two examples. Here, the complexity of temporal reasoning is not as well-studied nor as well-understood. In order to get a better understanding, we consider the powerful Horn disjunctive linear relations (Horn DLR) formalism adapted for discrete time and study its computational complexity. We show that the full formalism is NP-hard and identify several maximal tractable subclasses. We also lift the maximality results to obtain hardness results for other families of constraints. Finally, we discuss how the results and techniques presented in this paper can be used for studying even more expressive classes of temporal constraints.

  • 285.
    Jonsson, Peter
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Thapper, Johan
    Université Paris-Sud 11, Laboratoire de Recherche en Informatique (LRI) .
    Affine Consistency and the Complexity of Semilinear Constraints2014Ingår i: Mathematical Foundations of Computer Science 2014, Springer Berlin/Heidelberg, 2014, 420-431 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals or the integers. Semilinear relations have been studied in connection with algebraic geometry, automata theory, and spatiotemporal reasoning, just to mention a few examples. We concentrate on relations over the reals and rational numbers. Under this assumption, the computational complexity of the constraint satisfaction problem (CSP) is known for all finite sets Γ of semilinear relations containing the relations R +={(x,y,z) | x+y=z}, ≤ and {1}. These problems correspond to extensions of LP feasibility. We generalise this result as follows. We introduce an algorithm, based on computing affine hulls, which solves a new class of semilinear CSPs in polynomial time. This allows us to fully determine the complexity of CSP(Γ) for semilinear Γ containing R+ and satisfying two auxiliary conditions. Our result covers all semilinear Γ such that {R+,{1}}⊆Γ. We continue by studying the more general case when Γ contains R+ but violates either of the two auxiliary conditions. We show that each such problem is equivalent to a problem in which the relations are finite unions of homogeneous linear sets and we present evidence that determining the complexity of these problems may be highly non-trivial.

  • 286.
    Jonsson, Peter
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Thapper, Johan
    University of Paris Est Marne la Vallee, France.
    Constraint satisfaction and semilinear expansions of addition over the rationals and the reals2016Ingår i: Journal of computer and system sciences (Print), ISSN 0022-0000, E-ISSN 1090-2724, Vol. 82, nr 5, 912-928 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    A semilinear relation is a finite union of finite intersections of open and closed half spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry, automata theory, and spatiotemporal reasoning. We consider semilinear relations over the rationals and the reals. Under this assumption, the computational complexity of the constraint satisfaction problem (CSP) is known for all finite sets containing R+ = {(x, y, z) vertical bar x y = z}, <=, and {1}. These problems correspond to expansions of the linear programming feasibility problem. We generalise this result and fully determine the complexity for all finite sets of semilinear relations containing R+. This is accomplished in part by introducing an algorithm, based on computing affine hulls, which solves a new class of semilinear CSPs in polynomial time. We further analyse the complexity of linear optimisation over the solution set and the existence of integer solutions. (C) 2016 Elsevier Inc. All rights reserved.

    Publikationen är tillgänglig i fulltext från 2018-03-17 16:49
  • 287.
    Joshi, Prachi
    et al.
    Virginia Tech, Blacksburg, VA, USA.
    Zeng, Haibo
    Virginia Tech, Blacksburg, VA, USA.
    Bordoloi, Unmesh D.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. General Motors, USA.
    Samii, Soheil
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. General Motors, USA.
    Ravi, S. S.
    Virginia Tech,Blacksburg, VA, USA.
    Shukla, Sandeep K.
    IT Kanpur, Kanpur, India.
    The Multi-Domain Frame Packing Problem for CAN-FD2017Konferensbidrag (Refereegranskat)
    Abstract [en]

    The Controller Area Network with Flexible Data-Rate (CAN-FD) is a new communication protocol to meet the bandwidth requirements for the constantly growing volume of data exchanged in modern vehicles. The problem of frame packing for CAN-FD, as studied in the literature, assumes a single sub-system where one CAN-FD bus serves as the communication medium among several Electronic Control Units (ECUs). Modern automotive electronic systems, on the other hand, consist of several sub-systems, each facilitating a certain functional domain such as powertrain, chassis and suspension. A substantial fraction of all signals is exchanged across sub-systems. In this work, we study the frame packing problem for CAN-FD with multiple sub-systems, and propose a two-stage optimization framework. In the first stage, we pack the signals into frames with the objective of minimizing the bandwidth utilization. In the second stage, we extend Audsley's algorithm to assign priorities/identifiers to the frames. In case the resulting solution is not schedulable, our framework provides a potential repacking method. We propose two solution approaches: (a) an Integer Linear Programming (ILP) formulation that provides an optimal solution but is computationally expensive for industrial-size problems; and (b) a greedy heuristic that scales well and provides solutions that are comparable to optimal solutions. Experimental results show the efficiency of our optimization framework in achieving feasible solutions with low bandwidth utilization. The results also show a significant improvement over the case when there is no cross-domain consideration (as in prior work).

  • 288.
    Kalns, Gundars
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Nadjm-Tehrani, Simin
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Vasilevskaya, Maria
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Trading off Latency against Security in Open Energy Metering Infrastructures2016Ingår i: Proceedings of The 4th International Symposium for Industrial Control Systems and SCADA Cyber Security (ICS-CSR), British Computer Society (BCS), 2016Konferensbidrag (Refereegranskat)
    Abstract [en]

    Embedded devices are expected to transform the landscape of networked services in many domains, among them smart homes and smart grid systems. The reliable and optimised operation of smart grids is dependent on reliable data provided by end nodes (e.g. smart meters), and assurance of secure communication across networks. Understanding whether advanced security building blocks have a role to play in forthcoming infrastructures needs a basic understanding of each potential building block with respect to resource usage and impact on timing. In this paper we study the performance penalty of asymmetric cryptography techniques used for protection of wirelessly transmitted data in a prototype smart metering system. The prototype system is built using hardware and software components from “Open Energy Monitor” project using a wireless data link between the metering device and the data collector device. We investigate the use of the Elliptic Curve Integrated Encryption Scheme (ECIES) in two versions - with standard building blocks and with added Elliptic Curve Digital Signature Algorithm (ECDSA) support. The use of the ECDSA allows the system to achieve the non-repudiation property. We compare those cryptographic techniques with the Advanced Encryption Standard in Galois Counter Mode (AES-GCM) technique in two versions - with 128 bit and 256 bit keys. Performance is compared in terms of execution time of (1) preparing data, (2) unpacking it, and (3) roundtrip time. We then discuss the implications of the measurements, where the roundtrip time of sending one measurement ranges from 378 ms in case of AES128-GCM to 16.3 sec using ECIES with ECDSA.

  • 289.
    Karlsson, Jonathan
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Network protocol for distribution and handling of data from JAS 39 Gripen2015Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    On board the aircraft JAS 39 Gripen a measuring system, Data Acquisition System (DAS), is sending sensor data to a server on the ground. In this master thesis, a unified API for distribution and handling of the sensor data is designed and implemented. The work has been carried out at Saab Aeronautics, Linköping during, 2014.

    During flights with the aircraft the engineers at Saab need to monitor different sensors in the aircraft, including the exact commands of the pilots. All that data is serialized and sent via radio link to a server at Saab. The current data distribution solution includes several clients that need to connect to the server. Each client has its own connection protocol, making the system complex and difficult to maintain. An API is needed in order to make the clients connect in a unified manner. This would also enable future clients to implement the API and start receiving sensor data from the server.

    The research conducted in the thesis project was centered on the different choices that exist for designing such an API. The question that needed answering was; how can an existing complex system can be replaced by a publish-subscribe system and what the benefits would be in terms of latency and flexibility of the system? The design would have to be flexible enough to support multiple clients. The investigated research question was answered with a design utilizing ZMQ, pthreads and a design pattern. The result is a flexible system that was sufficiently fast for the requirements set at Saab and open to future extensions.

    The thesis work also included designing a unified API with requirements on latency and functionality. The resulting API was designed using the publish-subscribe design pattern, the network library Zero Message Queue (ZMQ) and the threading library pthreads. The resulting system supports multiple coexisting servers and clients that request sensor data. A new feature is that the clients can start sending calculations performed on samples to other clients.

    To demonstrate that the solution provides a unified framework, two existing clients and the server were developed with the proposed API. To test the latency requirements, tests were performed in the control room at Saab. 

  • 290.
    Kastegård, Sandra
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Automated testing of a web-based user interface2015Självständigt arbete på grundnivå (högskoleexamen), 10,5 poäng / 16 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Testing is a vital part of software development and test automation is an increasingly common practise. Performing automated testing on web-based applications is more complicated than desktop applications, which is particularly clear when it comes to testing a web based user interface as they are becoming more complex and dynamic. Depending on the goals and needed complexity of the testing, a variety of different frameworks/tools are available to help implementing it.

    This thesis investigates how automated testing of a web-based user interface can be implemented. Testing methods and a selection of relevant testing frameworks/tools are presented and evaluated based on given requirements. Out of the selected frameworks/tools, the Selenium WebDriver framework is chosen and used for implementation. The implementation results in automated test cases for regression testing of the functionality of a user interface created by Infor AB.

  • 291.
    Keller, Jörg
    et al.
    FernUniversität in Hagen, Germany.
    Kessler, Christoph W.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Hultén, Rikard
    Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska högskolan.
    Optimized On-Chip-Pipelining for Memory-Intensive Computations on Multi-Core Processors with Explicit Memory Hierarchy2012Ingår i: Journal of Universal Computer Science, ISSN 0948-695X, Vol. 18, nr 14, 1987-2023 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Limited bandwidth to off-chip main memory tends to be a performance bottleneck in chip multiprocessors, and this will become even more problematic with an increasing number of cores. Especially for streaming computations where the ratio between computational work and memory transfer is low, transforming the program into more memory-efficient code is an important program optimization.

    On-chip pipelining reorganizes the computation so that partial results of subtasks are forwarded immediately between the cores over the high-bandwidth internal network, in order to reduce the volume of main memory accesses, and thereby improves the throughput for memory-intensive computations. At the same time, throughput is also constrained by the limited amount of on-chip memory available for buffering forwarded data. By optimizing the mapping of tasks to cores, balancing a trade-off between load balancing, buffer memory consumption, and communication load on the on-chip network, a larger buffer size can be applied, resulting in less DMA communication and scheduling overhead.

    In this article, we consider parallel mergesort as a representative memory-intensive application in detail, and focus on the global merging phase, which is dominating the overall sorting time for larger data sets. We work out the technical issues of applying the on-chip pipelining technique, and present several algorithms for optimized mapping of merge trees to the multiprocessor cores. We also demonstrate how some of these algorithms can be used for mapping of other streaming task graphs.

    We describe an implementation of pipelined parallel mergesort for the Cell Broadband Engine, which serves as an exemplary target. We evaluate experimentally the influence of buffer sizes and mapping optimizations, and show that optimized on-chip pipelining indeed speeds up, for realistic problem sizes, merging times by up to 70% on QS20 and 143% on PS3 compared to the merge phase of CellSort, which was by now the fastest merge sort implementation on Cell.

  • 292.
    Keller, Jörg
    et al.
    FernUniversität in Hagen, Germany.
    Majeed, Mudassar
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Kessler, Christoph
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Balancing CPU Load for Irregular MPI Applications2012Ingår i: Advances in Parallel Computing: Applications, Tools and Techniques on the Road to Exascale Computing / [ed] Koen De Bosschere, Erik H. D'Hollander, Gerhard R. Joubert, David Padua, Frans Peters, Mark Sawyer, IOS Press, 2012, 307-316 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    MPI applications typically are designed to be run on a parallel machine with one process per core. If processes exhibit different computational load, either the code must be rewritten for load balancing, with negative side-effects on readability and maintainability, or the one-process-per-core philosophy leads to a low utilization of many processor cores. If several processes are mapped per core to increase CPU utilization, the load might still be unevenly distributed among the cores if the mapping is unaware of the process characteristics.

    Therefore, similarly to the MPI_Graph_create() function where the program gives hints on communication patterns so that MPI processes can be placed favorably, we propose a MPI_Load_create() function where the program supplies information on the relative loads of the MPI processes, such that processes can be favorably grouped and mapped onto processor cores. In order to account for scalability and restricted knowledge of individual MPI processes, we also propose an extension MPI_Dist_load_create() similar to MPI_Dist_graph_create(), where each individual MPI process only knows the loads of a subset of the MPI processes.

    We detail how to implement both variants on top of MPI, and provide experimental performance results both for synthetic and numeric example applications. The results indicate that load balancing is favorable in both cases.

  • 293.
    Kessler, Christoph
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Compiling for VLIW DSPs2013Ingår i: Handbook of signal processing systems / [ed] Shuvra S. Bhattacharyya, Ed F. Deprettere, Rainer Leupers, Jarmo Takala, New York: Springer, 2013, 2, 1177-1214 s.Kapitel i bok, del av antologi (Refereegranskat)
    Abstract [en]

    This handbook, organized into four parts, provides the reader with a comprehensive and standalone overview of signal processing systems. It contains a comprehensive index for ease of use, and an extensive bibliography for further reading.

  • 294.
    Kessler, Christoph
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Compiling for VLIW DSPs2010Ingår i: Handbook of signal processing systems / [ed] Shuvra S. Bhattacharyya, Ed F. Deprettere, Rainer Leupers, Jarmo Takala, New York: Springer, 2010, 1, 603-638 s.Kapitel i bok, del av antologi (Refereegranskat)
  • 295.
    Kessler, Christoph
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Fourth Swedish Workshop on Multi-Core Computing MCC-2011: November 23-25, 2011, Linköping University, Linköping, Sweden2011Proceedings (redaktörskap) (Övrigt vetenskapligt)
    Abstract [en]

    MCC-2011 covers a wide variety of topics, including programming for GPU-based systems, mobile multi-core based platforms, scalable concurrent data structures, memory hierarchies, auto-tuning, transactional memory and thread-level speculation, parallel programming models, scheduling and mapping, applications, and even teaching of multicore programming.

  • 296.
    Kessler, Christoph
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Programming Techniques for the Cell Processor2011Ingår i: it - Information Technology, ISSN 1611-2776, Vol. 53, nr 2, 66-74 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Cell Broadband Engine is a heterogeneous multicore processor designed mainly for applications in scientific computing, graphics, and gaming with high performance requirements. We give an overview of its architecture, review some selected development tools and programming frameworks, and describe techniques for writing efficient programs for Cell.

  • 297.
    Kessler, Christoph
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Programming the Cell Processor2010Ingår i: Fundamentals of Multicore Software Development / [ed] Victor Pankratius, Ali-Reza Adl-Tabatabai, Walter Tichy, CRC Press, 2010, 155-198 s.Kapitel i bok, del av antologi (Övrigt vetenskapligt)
  • 298.
    Kessler, Christoph
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Dastgeer, Usman
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Li, Lu
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Optimized Composition: Generating Efficient Code for Heterogeneous Systems from Multi-Variant Components, Skeletons and Containers2014Ingår i: Proc. First Workshop on Resource awareness and adaptivity in multi-core computing (Racing 2014), May 2014, Paderborn, Germany / [ed] F. Hannig and J. Teich, 2014, 43-48 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this survey paper, we review recent work on frameworks for the high-level, portable programming of heterogeneous multi-/manycore systems (especially, GPU-based systems) using high-level constructs such as annotated user-level software components, skeletons (i.e., predefined generic components) and containers, and discuss the optimization problems that need to be considered in selecting among multiple implementation variants, generating code and providing runtime support for efficient execution on such systems.

  • 299.
    Kessler, Christoph
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Dastgeer, Usman
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Majeed, Mudassar
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Furmento, Nathalie
    University of Bordeaux, INRIA, Bordeaux, France.
    Thibault, Samuel
    University of Bordeaux, INRIA, Bordeaux, France.
    Namyst, Raymond
    University of Bordeaux, INRIA, Bordeaux, France.
    Benkner, Siegfried
    University of Vienna, Austria.
    Pllana, Sabri
    University of Vienna, Austria.
    Träff, Jesper
    Technical University of Vienna, Austria.
    Wimmer, Martin
    Technical University of Vienna, Austria.
    Leveraging PEPPHER Technology for Performance Portable Supercomputing2013Ingår i: High Performance Computing, Networking, Storage and Analysis (SCC), 2012 SC Companion, Salt Lake City, USA: IEEE conference proceedings, 2013, 1395-1396 s.Konferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    PEPPHER is a 3-year EU FP7 project that develops a novel approach and framework to enhance performance portability and programmability of heterogeneous multi-core systems. Its primary target is single-node heterogeneous systems, where several CPU cores are supported by accelerators such as GPUs. This poster briefly surveys the PEPPHER framework for single-node systems, and elaborates on the prospectives for leveraging the PEPPHER approach to generate performance-portable code for heterogeneous multi-node systems.

  • 300.
    Kessler, Christoph
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Dastgeer, Usman
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Thibault, Samuel
    INRIA / University of Bordeaux, France.
    Namyst, Raymond
    INRIA / University of Bordeaux, France.
    Richards, Andrew
    Codeplay Software Ltd., Edinburgh, UK.
    Dolinsky, Uwe
    Codeplay Software Ltd., Edinburgh, UK.
    Benkner, Siegfried
    University of Vienna, Austria.
    Träff, Jesper
    Technical University of Vienna, Austria.
    Pllana, Sabri
    University of Vienna, Austria.
    Programmability and Performance Portability Aspects of Heterogeneous Multi-/Manycore Systems2012Konferensbidrag (Refereegranskat)
    Abstract [en]

    We discuss three complementary approaches that can provide both portability and an increased level of abstraction for the programming of heterogeneous multicore systems. Together, these approaches also support performance portability, as currently investigated in the EU FP7 project PEPPHER. In particular, we consider (1) a library-based approach, here represented by the integration of the SkePU C++ skeleton programming library with the StarPU runtime system for dynamic scheduling and dynamic selection of suitable execution units for parallel tasks; (2) a language-based approach, here represented by the Offload-C++ high-level language extensions and Offload compiler to generate platform-specific code; and (3) a component-based approach, specifically the PEPPHER component system for annotating user-level application components with performance metadata, thereby preparing them for performance-aware composition. We discuss the strengths and weaknesses of these approaches and show how they could complement each other in an integrational programming framework for heterogeneous multicore systems.

3456789 251 - 300 av 534
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf