Change search
Refine search result
1234567 101 - 150 of 601
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.
    Carlsson, Mats
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Boolean constraints in SICStus Prolog1991Report (Other academic)
    Abstract [en]

    This report documents the implementation of a Boolean constraint solver and its integration with a Prolog engine. The solver comprises built-in predicates for checking consistency and entailment of a new constraint w.r.t. accumulated constraints and for generating particular solutions to a set of constraints, and extensions to the Prolog top-level for displaying answer constraints. Boolean unification was chosen as the strategy for the consistency check. Boolean unification fits well with the Prolog execution model, and allows the accumulated constraints to be associated in a natural way with the variables being eliminated. The answer constraints are computed by existentially quantifying in the accumulated set of constraints all variables not occurring in the user query. The simplified set of constraints constitutes the answer constraints. Boolean formulas are internally represented as DAGs. Details are provided on this representation and the support for it provides by Prolog Engine. We have investigated various optimizations of the Boolean unification algorithm, and a preliminary performance evaluation is included.

  • 102.
    Carlsson, Mats
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Design and Implementation of an OR-Parallel Prolog Engine1990Doctoral thesis, monograph (Other academic)
  • 103.
    Carlsson, Mats
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Dispensation order generation for pyrosequencing2005In: ERCIM NewsArticle in journal (Other (popular science, discussion, etc.))
  • 104.
    Carlsson, Mats
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Filtering algorithms for global constraints2005Conference paper (Refereed)
  • 105.
    Carlsson, Mats
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Finite domain constraints in SICStus prolog2001Conference paper (Other academic)
  • 106.
    Carlsson, Mats
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Freeze, indexing, and other implementation issues in the WAM1987In: Proceedings of the 4th International Conference on Logic Programming (ICLP'87), May 1987, Melbourne, Australia / [ed] Lassez, Jean-Louis, The MIT Press , 1987, 1, p. 40-58Conference paper (Refereed)
  • 107.
    Carlsson, Mats
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Freeze, indexing, and other implementation issues in the WAM1986Report (Other academic)
    Abstract [en]

    Two very useful extensions to Prolog's computation model, dif and freeze were introduced with Prolog II. A method for their incorporation into the Warren Abstract Machine is presented. Under reasonable assumptions, the method does not incur any overhead on programs not using these extensions. The clause indexing mechanism is also discussed, as it is not unrelated to the freeze mechanism.

  • 108.
    Carlsson, Mats
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    On compiling indexing and cut for the WAM1986Report (Other academic)
  • 109.
    Carlsson, Mats
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    On the Efficiency of Optimising Shallow Backtracking in Prolog1990Report (Other academic)
    Abstract [en]

    The cost of backtracking has been identified as one of the bottlenecks in achieving peak performance in compiled Prolog programs. Much of the backtracking in Prolog programs is shallow, i.e. is caused by unification failures in the head of a clause when there are more alternatives for the same procedure, and so special treatment of this form of backtracking has been proposed as a significant optimisation. This paper describes a modified WAM which optimises shallow backtracking. Four different implementation approaches are compared. A number of benchmark results are presented, measuring the relative tradeoffs between compilation time, code size, and run time. The results show that the speedup gained by this optimisation can be significant.

  • 110.
    Carlsson, Mats
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    SICStus Prolog user's manual1995Other (Other academic)
  • 111.
    Carlsson, Mats
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    The SICStus emulator1991Report (Other academic)
    Abstract [en]

    This report documents internal details of Industrial SICStus Prolog, developed at the Logic Programming Laboratory of SICS. The development was funded by Ericsson Telecomm AB, NobelTech Systems AB, Infologics AB and Televerket under the IT4-program. The Implementation was done on Sun-3 and Sun-4 workstations. It has proved portable to a wide range of byte-addressed 32-bit computers running Berkeley Unix.

  • 112.
    Carlsson, Mats
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    The SICStus Prolog finite domain constraint programming library2006Conference paper (Refereed)
  • 113.
    Carlsson, Mats
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Beldiceanu, Nicolas
    Arc-Consistency for a Chain of Lexicographic Ordering Constraints2002Report (Other academic)
    Abstract [en]

    We present an arc-consistency algorithm for a chain of lexicographic ordering constraints on $m$ vectors of $n$ variables each. The algorithm maintains arc-consistency and runs in $O(nmd)$ time per invocation, where $d$ is the cost of certain domain operations.

  • 114.
    Carlsson, Mats
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Beldiceanu, Nicolas
    Dispensation order generation for pyrosequencing2004In: Proceedings. Bioinformatics 2004. Second Asia-Pacific Bioinformatics Conference (APBC2004), 2004, 1, Vol. 29, p. 5p. 327-332Conference paper (Refereed)
    Abstract [en]

    This article describes a dispensation order generation algorithm for genotyping using the Pyrosequencing method. The input template of the algorithm is a slightly restricted regular expression over the DNA strings that can be expected in a given sample. The algorithm computes a dispensation order that allows for determining, for each polymorphism in the input template, the genotype of any sample. The algorithm has the structure of a non-deterministic rewrite system, which gives rise to a search tree. We show that within any branch of the search tree, the rewrite system is confluent and terminating. We use nogood generation and limited discrepancy search to prune the search tree and to focus the search for shorter dispensation orders before looking for longer ones. The algorithm as described herein assumes samples from a diploid genome, but can readily be generalized to general k-ploid genomes.

  • 115.
    Carlsson, Mats
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Beldiceanu, Nicolas
    Dispensation Order Generation for Pyrosequencing2005Conference paper (Refereed)
  • 116.
    Carlsson, Mats
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Beldiceanu, Nicolas
    From constraints to finite automata to filtering algorithms2004In: Proceedings ESOP2004: Programming languages and systems, Springer , 2004, 1, , p. 15p. 94-108Conference paper (Refereed)
    Abstract [en]

    We introduce an approach to designing filtering algorithms by derivation from finite automata operating on constraint signatures. We illustrate this approach in two case studies of constraints on vectors of variables. This has enabled us to derive an incremental filtering algorithm that runs in O(n) plus amortized O(1) time per propagation event for the lexicographic ordering constraint over two vectors of size n, and an O(nmd) time filtering algorithm for a chain of m-1 such constraints, where d is the cost of certain domain operations. Both algorithms maintain hyperarc consistency. Our approach can be seen as a first step towards a methodology for semi-automatic development of filtering algorithms.

  • 117.
    Carlsson, Mats
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Beldiceanu, Nicolas
    Multiplex dispensation order generation for pyrosequencing2004Conference paper (Refereed)
    Abstract [en]

    This paper introduces the multiplex dispensation order generation problem, a real-life combinatorial problem that arises in the context of analyzing large numbers of short to medium length DNA sequences. The problem is modeled as a constraint optimization problem (COP). We present the COP, its constraint programming formulation, and a custom search procedure. We give some experimental data supporting our design decisions. One of the lessons learnt from this study is that the ease with which the relevant constraints are expressed can be a crucial factor in making design decisions in the COP model.

  • 118.
    Carlsson, Mats
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Beldiceanu, Nicolas
    Revisiting the Lexicographic Ordering Constraint2002Report (Other academic)
    Abstract [en]

    We present a global consistency algorithm for the lexicographic ordering constraint on two vectors of $n$ variables. The algorithm maintains arc-consistency, runs in $O(n)$ time on posting plus amortized $O(1)$ time per propagation event, and detects entailment or rewrites itself to a simpler constraint whenever possible. The algorithm was derived from a finite automaton operating on a string which captures the relationship between each variable pair of the two vectors.

  • 119.
    Carlsson, Mats
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Beldiceanu, Nicolas
    Martin, Julien
    A geometric constraint over k-dimensional objects and shapes subject to business rules2008Report (Other academic)
    Abstract [en]

    This report presents a global constraint that enforces rules written in a language based on arithmetic and first-order logic to hold among a set of objects. In a first step, the rules are rewritten to Quantifier-Free Presburger Arithmetic (QFPA) formulas. Secondly, such formulas are compiled to generators of k-dimensional forbidden sets. Such generators are a generalization of the indexicals of cc(FD). Finally, the forbidden sets generated by such indexicals are aggregated by a sweep-based algorithm and used for filtering. The business rules allow to express a great variety of packing and placement constraints, while admitting efficient and effective filtering of the domain variables of the k-dimensional object, without the need to use spatial data structures. The constraint was used to directly encode the packing knowledge of a major car manufacturer and tested on a set of real packing problems under these rules, as well as on a packing-unpacking problem.

  • 120.
    Carlsson, Mats
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Beldiceanu, Nicolas
    Martin, Julien
    A geometric constraint over k-dimensional objects and shapes subject to business rules2008In: Proc. CP'2008, Springer-Verlag , 2008, 2, Vol. 5202, p. 15p. 220-234Conference paper (Refereed)
    Abstract [en]

    This report presents a global constraint that enforces rules written in a language based on arithmetic and first-order logic to hold among a set of objects. In a first step, the rules are rewritten to Quantifier-Free Presburger Arithmetic (QFPA) formulas. Secondly, such formulas are compiled to generators of k-dimensional forbidden sets. Such generators are a generalization of the indexicals of cc(FD). Finally, the forbidden sets generated by such indexicals are aggregated by a sweep-based algorithm and used for filtering. The business rules allow to express a great variety of packing and placement constraints, while admitting efficient and effective filtering of the domain variables of the k-dimensional object, without the need to use spatial data structures. The constraint was used to directly encode the packing knowledge of a major car manufacturer and tested on a set of real packing problems under these rules, as well as on a packing-unpacking problem.

  • 121.
    Carlsson, Mats
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Grindal, Mats
    Automatic frequency assignment for cellular telephones using constraint satisfaction techniques1993In: Proc. Tenth International Conference on Logic Programming, The MIT Press , 1993, 1, , p. 18p. 647-665Conference paper (Refereed)
    Abstract [en]

    We study the problem of automatic frequency assignment for cellular telephone systems. The frequency assignment problem is viewed as the problem to minimize the unsatisfied soft constraints in a constraint satisfaction problem (CSP) over a finite domain of frequencies involving co-channel, adjacent channel, and co-site constraints. The soft constraints are automatically derived from signal strength prediction data. The CSP is solved using a generalized graph coloring algorithm. Graph-theoretical results play a crucial role in making the problem tractable. Performance results from a real-world frequency assignment problem are presented. We develop the generalized graph coloring algorithm by stepwise refinement, starting from DSATUR and augmenting it with local propagation, constraint lifting, intelligent backtracking, redundancy avoidance, and iterative deepening.

  • 122.
    Carlsson, Mats
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Kreuger, Per
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Åström, Emil
    RISE - Research Institutes of Sweden, ICT, SICS.
    Constraint-based resource allocation and scheduling in steel manufacturing1999Conference paper (Refereed)
    Abstract [en]

    This paper describes a flow maximization problem in steel manufacturing, decomposes it into three sub-problems, and models them in terms of finite domain constraints. Greedy algorithms are used for solving the sub-problems. The constraints are used for maintaining consistency rules, not for optimization. A tool implementing these algorithms and equipped with a GUI has been implemented.

  • 123.
    Carlsson, Mats
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Mildner, Per
    RISE, Swedish ICT, SICS.
    SICStus Prolog -- The first 25 years2012In: TPLP, Vol. 12, p. 35-66Article in journal (Refereed)
    Abstract [en]

    SICStus Prolog has evolved for nearly 25 years. This is an appropriate point in time for revisiting the main language and design decisions, and try to distill some lessons. SICStus Prolog was conceived in a context of multiple, conflicting Prolog dialect camps and a fledgling standardization effort. We reflect on the impact of this effort and role model implementations on our development. After summarizing the development history, we give a guided tour of the system anatomy, exposing some designs that were not published before. We give an overview of our new interactive development environment, and describe a sample of key applications. Finally, we try to identify key good and not so good design decisions.

  • 124.
    Carlsson, Mats
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Ottosson, Greger
    A Comparison of CP, IP and Hybrids for Configuration Problems1999Report (Other academic)
    Abstract [en]

    We investigate different solution techniques for solving a basic part of configuration problems, namely linear arithmetic constraints over integer variables. Approaches include integer programming, constraint programming over finite domains and hybrid techniques. We also discuss important extensions of the basic problem and how these can be accommodated in the different solution approaches.

  • 125.
    Carlsson, Mats
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Ottosson, Greger
    Anytime frequency allocation with soft constraints1996In: / [ed] J. Burg, M. Leconte and Roland H.C. Yap, 1996, 6Conference paper (Refereed)
    Abstract [en]

    

  • 126.
    Carlsson, Mats
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Ottosson, Greger
    Carlson, Björn
    An Open-Ended finite domain constraint solver1997In: Programming Languages: Implementations, Logics, and Programming / [ed] H. Glaser, P. Hartel and H. Kuchen, Springer-Verlag , 1997, 1, Vol. 1292, p. 191-206Conference paper (Refereed)
  • 127.
    Carlsson, Mats
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Pearson, Justin
    Grinchtein, Olga
    Protocol Log Analysis with Constraint Programming2014Conference paper (Refereed)
    Abstract [en]

    Testing a telecommunication protocol often requires protocol log analysis. A protocol log is a sequence of messages with timestamps. Protocol log analysis involves checking that the content of messages and timestamps are correct with respect to the protocol specification. We model the protocol specification using constraint programming (MiniZinc), and we present an approach where a constraint solver is used to perform protocol log analysis. Our case study is the Public Warning System service, which is a part of the Long Term Evolution (LTE) 4G standard.

  • 128.
    Carlsson, Mats
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Schulte, Christian
    RISE, Swedish ICT, SICS.
    Finite domain constraint programming systems2002Other (Other academic)
  • 129.
    Carlsson, Mats
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Szeredi, Péter
    The Aurora Abstract Machine and its Emulator1990Report (Other academic)
    Abstract [en]

    Aurora is a prototype Or-Parallel implementation of the full Prolog language fot shared-memory multiprocessors, developed as part of an informal research collaboration known as the "Gigalips Project". This report describes the abstract machine of the implementation, expressed in terms of a Prolog engine adapted for Or-Parallel execution by means of the SRI model. An algorithms interface defining the communication between the engine and sheduler components of each Aurora process is described, and enables different engine and scheduler components to be used interchangeably. Both the interface and the engine are Fundamentally revised versions of those used in previous generations of the implementation.

  • 130.
    Carlsson, Mats
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Widén, Johan
    SICStus Prolog user's manual1988Report (Other academic)
  • 131.
    Carlsson, Mats
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Widén, Johan
    RISE - Research Institutes of Sweden, ICT, SICS.
    Andersson, Johan
    Andersson, Stefan
    Boortz, Kent
    Nilsson, Hans
    Sjöland, Thomas
    RISE - Research Institutes of Sweden, ICT, SICS.
    Industrial SICStus Prolog user's manual1991Report (Other academic)
  • 132. Casati, Fabio
    et al.
    Daniel, Florian
    Dantchev, Guenadi
    Eriksson, Joakim
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Finne, Niclas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Karnouskos, Stamatis
    Moreno Montero, Patricio
    Mottola, Luca
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Oppermann, Felix
    Picco, Gian Pietro
    Quartulli, Antonio
    Römer, Kay
    Spiess, Patrik
    Tranquillini, Stefano
    Voigt, Thiemo
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Demo Abstract: From Business Process Specifications to Sensor Network Deployments2012Conference paper (Refereed)
  • 133. Casati, Fabio
    et al.
    Daniel, Florian
    Dantchev, Guenadi
    Eriksson, Joakim
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Finne, Niclas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Karnouskos, Stamatis
    Moreno Montero, Patricio
    Mottola, Luca
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Oppermann, Felix
    Picco, Gian Pietro
    Quartulli, Antonio
    Römer, Kay
    Spiess, Patrik
    Tranquillini, Stefano
    Voigt, Thiemo
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Towards Business Processes Orchestrating the Physical Enterprise with Wireless Sensor Networks2012Conference paper (Refereed)
  • 134.
    Castaneda Lozano, Roberto
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Integrated Register Allocation and Instruction Scheduling with Constraint Programming2014Licentiate thesis, monograph (Other academic)
    Abstract [en]

    This dissertation proposes a combinatorial model, program representations, and constraint solving techniques for integrated register allocation and instruction scheduling in compiler back-ends. In contrast to traditional compilers based on heuristics, the proposed approach generates potentially optimal code by considering all trade-offs between interdependent decisions as a single optimization problem. The combinatorial model is the first to handle a wide array of global register allocation subtasks, including spill code optimization, ultimate coalescing, register packing, and register bank assignment, as well as instruction scheduling for Very Long Instruction Word (VLIW) processors. The model is based on three novel, complementary program representations: Linear Static Single Assignment for global register allocation; copy extension for spilling, basic coalescing, and register bank assignment; and alternative temporaries for spill code optimization and ultimate coalescing. Solving techniques are proposed that exploit the program representation properties for scalability. The model, program representations, and solving techniques are implemented in Unison, a code generator that delivers potentially optimal code while scaling to medium-size functions. Thorough experiments show that Unison: generates faster code (up to 41% with a mean improvement of 7%) than LLVM (a state-of-the-art compiler) for Hexagon (a challenging VLIW processor), generates code that is competitive with LLVM for MIPS32 (a simpler RISC processor), is robust across different benchmarks such as MediaBench and SPECint 2006, scales up to medium-size functions of up to 1000 instructions, and adapts easily to different optimization criteria. The contributions of this dissertation are significant. They lead to a combinatorial approach for integrated register allocation and instruction scheduling that is, for the first time, practical (it robustly scales to medium-size functions) and effective (it yields better code than traditional heuristic approaches).

  • 135.
    Castaneda Lozano, Roberto
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Carlsson, Mats
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Drejhammar, Frej
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Schulte, Christian
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Constraint-based Register Allocation and Instruction Scheduling2012Conference paper (Refereed)
    Abstract [en]

    This paper introduces a constraint model and solving techniques for code generation in a compiler back-end. It contributes a new model for global register allocation that combines several advanced aspects: multiple register banks (subsuming spilling to memory), coalescing, and packing. The model is extended to include instruction scheduling and bundling. The paper introduces a decomposition scheme exploiting the underlying program structure and exhibiting robust behavior for functions with thousands of instructions. Evaluation shows that code quality is on par with LLVM, a state-of-the-art compiler infrastructure. The paper makes important contributions to the applicability of constraint programming as well as compiler construction: essential concepts are unified in a high-level model that can be solved by readily available modern solvers. This is a significant step towards basing code generation entirely on a high-level model and by this facilitates the construction of correct, simple, flexible, robust, and high-quality code generators.

  • 136.
    Castaneda Lozano, Roberto
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Carlsson, Mats
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Hjort Blindell, Gabriel
    KTH Royal Institute of Technology, Sweden.
    Schulte, Christian
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Combinatorial Spill Code Optimization and Ultimate Coalescing2014Conference paper (Refereed)
    Abstract [en]

    This paper presents a novel combinatorial model that integrates global register allocation based on ultimate coalescing, spill code optimization, register packing, and multiple register banks with instruction scheduling (including VLIW). The model exploits alternative temporaries that hold the same value as a new concept for ultimate coalescing and spill code optimization. The paper presents Unison as a code generator based on the model and advanced solving techniques using constraint programming. Thorough experiments using MediaBench and a processor (Hexagon) that are typical for embedded systems demonstrate that Unison: is robust and scalable; generates faster code than LLVM (up to 41% with a mean improvement of 7%); possibly generates optimal code (for 29% of the experiments); effortlessly supports different optimization criteria (code size on par with LLVM). Unison is significant as it addresses the same aspects as traditional code generation algorithms, yet is based on a simple integrated model and robustly can generate optimal code.

  • 137.
    Castaneda Lozano, Roberto
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory. KTH Royal Institute of Technology, Sweden.
    Carlsson, Mats
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Hjort Blindell, Gabriel
    KTH Royal Institute of Technology, Sweden.
    Schulte, Christian
    RISE, Swedish ICT, SICS, Computer Systems Laboratory. KTH Royal Institute of Technology, Sweden.
    Register allocation and instruction scheduling in Unison2016In: Proceedings of the 25th International Conference on Compiler Construction, 2016, 6, p. 263-264Conference paper (Refereed)
    Abstract [en]

    This paper describes Unison, a simple, flexible, and potentially optimal software tool that performs register allocation and instruction scheduling in integration using combinatorial optimization. The tool can be used as an alternative or as a complement to traditional approaches, which are fast but complex and suboptimal. Unison is most suitable whenever high-quality code is required and longer compilation times can be tolerated (such as in embedded systems or library releases), or the targeted processors are so irregular that traditional compilers fail to generate satisfactory code.

  • 138.
    Castaneda Lozano, Roberto
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Hjort Blindell, Gabriel
    Carlsson, Mats
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Drejhammar, Frej
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Schulte, Christian
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Constraint-based Code Generation2013Conference paper (Refereed)
  • 139.
    Castaneda Lozano, Roberto
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Schulte, Christian
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Survey on Combinatorial Register Allocation and Instruction Scheduling2014In: arXiv:1409.7628 [cs.PL]Article in journal (Refereed)
    Abstract [en]

    Register allocation and instruction scheduling are two central compiler back-end problems that are critical for quality. In the last two decades, combinatorial optimization has emerged as an alternative approach to traditional, heuristic algorithms for these problems. Combinatorial approaches are generally slower but more flexible than their heuristic counterparts and have the potential to generate optimal code. This paper surveys existing literature on combinatorial register allocation and instruction scheduling. The survey covers approaches that solve each problem in isolation as well as approaches that integrate both problems. The latter have the potential to generate code that is globally optimal by capturing the trade-off between conflicting register allocation and instruction scheduling decisions.

  • 140.
    Castaneda Lozano, Roberto
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Schulte, Christian
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Wahlberg, Lars
    Testing Continuous Double Auctions with a Constraint-based Oracle2010Conference paper (Refereed)
    Abstract [en]

    Computer trading systems are essential for today's financial markets where the trading systems' correctness is of paramount economical significance. Automated random testing is a useful technique to find bugs in these systems, but it requires an independent system to decide the correctness of the system under test (known as oracle problem). This paper introduces a constraint-based oracle for random testing of a real-world trading system. The oracle provides the expected results by generating and solving constraint models of the trading system's continuous double auction. Constraint programming is essential for the correctness of the test oracle as the logic for calculating trades can be mapped directly to constraint models. The paper shows that the generated constraint models can be solved efficiently. Most importantly, the approach is shown to be successful by finding errors in a deployed financial trading system and in its specification.

  • 141. Ceriotti, M.
    et al.
    Mottola, Luca
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Picco, G. P.
    Murphy, A. L.
    Guna, S.
    Corrà, M.
    Pozzi, M.
    Zonta, D.
    Zanon, P.
    Monitoring Heritage Buildings with Wireless Sensor Networks: The Torre Aquila Deployment2009In: Proc. of the 8th Int. Conf. on Information Processing in Sensor Networks (IPSN), 2009, 8Conference paper (Refereed)
  • 142. Ceriotti, Matteo
    et al.
    Corrà, M.
    D'Orazio, Leandro
    Doriguzzi, Roberto
    Facchin, Daniele
    Guna, Stefan
    Jesi, Gianpaolo
    Lo Cigno, Renato
    Mottola, Luca
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Murphy, Amy
    Pescalli, Massimo
    Picco, Gian Pietro
    Pregnolato, Denis
    Torghele, Carloalberto
    Is There Light at the Ends of the Tunnel? Wireless Sensor Networks for Adaptive Lighting in Road Tunnels2011Conference paper (Refereed)
  • 143. Chen, Shujuan
    et al.
    Dunkels, Adam
    RISE, Swedish ICT, SICS.
    Österlind, Fredrik
    RISE, Swedish ICT, SICS.
    Voigt, Thiemo
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Johansson, Mikael
    Time synchronization for predictable and secure data collection in wireless sensor networks2007In: Proceedings of The Sixth Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net 2007), 2007, 1Conference paper (Refereed)
  • 144. Collins, John
    et al.
    Arunachalam, Raghu
    Sadeh, Norman M.
    Eriksson, Joakim
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Finne, Niclas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Janson, Sverker
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    The Supply Chain Management Game for the 2005 Trading Agent Competition2004Other (Other academic)
    Abstract [en]

    The Supply Chain Management Game for the 2005 Trading Agent Competition held during IJCAI 2005, in Edinburgh, Scotland. The supplier model has been substantially revised to overcome the "Day Zero" strategic singularity in TAC SCM 2003 and 2004.

  • 145. Costa, Paolo
    et al.
    Mottola, Luca
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Tuple space middleware for wireless networks2009In: Middleware for Network Eccentric and Mobile Applications, Springer Press , 2009, 1, , p. 20Chapter in book (Refereed)
    Abstract [en]

    This chapter addresses tuple spaces, a programming abstraction for data sharing and coordination among distributed processes. The shared memory is called a tuple space, a multiset of elementary data structures. Each tuple is a sequence of typed fields and coordination among processes occurs through the writing and reading of tuples. Originally introduced in the context of parallel computing, it has recently enjoyed wide popularity to develop wireless applications. This chapter concisely describes some of the most representative systems implementing this abstraction and analyzes them along some fundamental dimensions of comparison.

  • 146. Dahlem, Dominik
    et al.
    Nickel, L.
    Sacha, Jan
    Biskupski, Bartosz
    Dowling, Jim
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Meier, Rene
    Towards Improving the Availability of Service Compositions2007In: Digital EcoSystems and Technologies Conference, 2007. DEST '07. Inaugural IEEE-IES, IEEE Press, 2007, 1, , p. 3Conference paper (Refereed)
    Abstract [en]

    The proliferation of open Internet-scale service-oriented platforms based on standards, such as WSDL, SOAP and BPEL, enables the composition of independent Web services into new value-added services. Such service compositions define the information flows between autonomous and potentially heterogeneous services across the boundaries of independent provider organisations. The availability of individual services in such digital ecosystems is likely to be variable due to fluctuating usage load and resource limitations imposed by a service provider's infrastructure. This problem becomes more acute as the number of services in a composition increases. This paper presents a mediation model for improving the availability of composed services. The mediation model masks failures in a service composition by transparently selecting (and executing) an alternative composition at runtime. Service consumers use a common interface to a set of functionally equivalent service compositions while a selection mechanism identifies the most suitable (alternative) service composition. An evaluation of our implementation of the proposed mediation model demonstrates that the consumer perceived availability of value-added services can be improved significantly

  • 147. Daniel, Florian
    et al.
    Eriksson, Joakim
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Finne, Niclas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Fuchs, Harald
    Gaglione, Andrea
    Karnouskos, Stamatis
    Moreno Montero, Patricio
    Mottola, Luca
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Oertel, Nina
    Oppermann, Felix
    Picco, Gian Pietro
    Römer, Kay
    Spiess, Patrik
    Tranquillini, Stefano
    Voigt, Thiemo
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    makeSense: Real-world Business Processes through Wireless Sensor Networks2013Conference paper (Refereed)
  • 148. Dawans, Sébastien
    et al.
    Duquennoy, Simon
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Bonaventure, Olivier
    On Link Estimation in Dense RPL Deployments2012Conference paper (Refereed)
    Abstract [en]

    The Internet of Things vision foresees billions of devices to connect the physical world to the digital world. Sensing applications such as structural health monitoring, surveillance or smart buildings employ multi-hop wireless networks with high density to attain sufficient area coverage. Such applications need networking stacks and routing protocols that can scale with network size and density while remaining energy-efficient and lightweight. To this end, the IETF RoLL working group has designed the IPv6 Routing Protocol for Low-Power and Lossy Networks (RPL). This paper discusses the problems of link quality estimation and neighbor management policies when it comes to handling high densities. We implement and evaluate different neighbor management policies and link probing techniques in Contiki’s RPL implementation. We report on our experience with a 100-node testbed with average 40-degree density. We show the sensitivity of high density routing with respect to cache sizes and routing metric initialization. Finally, we devise guidelines for design and implementation of density-scalable routing protocols.

  • 149. De Palma, Noel
    et al.
    Parlavanzas, Nikos
    Popov, Konstantin
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Brand, Per
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Vlassov, Vladimir
    Tools for Autonomic Computing2009In: 5th International Conference on Autonomic and Autonomous Systems (ICAS 2009), IEEE Computer Society , 2009, 10, p. 313-320Conference paper (Refereed)
  • 150.
    Dowling, Jim
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Developing a distributed electronic health-record store for India2008In: ERCIM News, ISSN 0926-4981, E-ISSN 1564-0094, Vol. 75, p. 2p. 56-57Article in journal (Refereed)
    Abstract [en]

    The DIGHT project is addressing the problem of building a scalable and highly available information store for the Electronic Health Records (EHRs) of the over one billion citizens of India.

1234567 101 - 150 of 601
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
v. 2.35.7