SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "swepub ;lar1:(cth);pers:(Tsigas Philippas 1967)"

Sökning: swepub > Chalmers tekniska högskola > Tsigas Philippas 1967

  • Resultat 1-10 av 234
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Benkner, Siegfried, et al. (författare)
  • PEPPHER : Efficient and Productive Usage of Hybrid Computing Systems
  • 2011
  • Ingår i: IEEE Micro. - : IEEE Institute of Electrical and Electronics. - 0272-1732 .- 1937-4143. ; 31:5, s. 28-41
  • Tidskriftsartikel (refereegranskat)abstract
    • PEPPHER, a three-year European FP7 project, addresses efficient utilization of hybrid (heterogeneous) computer systems consisting of multicore CPUs with GPU-type accelerators. This article outlines the PEPPHER performance-aware component model, performance prediction means, runtime system, and other aspects of the project. A larger example demonstrates performance portability with the PEPPHER approach across hybrid systems with one to four GPUs.
  •  
2.
  • Nguyen, Dang Nhan, 1983, et al. (författare)
  • ParMarkSplit : A Parallel Mark-Split Garbage Collector Based on a Lock-Free Skip-List
  • 2014
  • Ingår i: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). - Cham : Springer. - 1611-3349 .- 0302-9743. - 9783319144719 - 9783319144726 ; 8878, s. 372-387
  • Konferensbidrag (refereegranskat)abstract
    • Mark-split is a garbage collection algorithm that combines advantages of both the mark-sweep and the copying collection algorithms. In this paper, we present a parallel mark-split garbage collector (GC). Our parallel design introduces and makes use of an efficient concurrency control mechanism for handling the list of free memory intervals. This mechanism is based on a lock-free skip-list design which supports an extended set of operations. Beside basic operations, it can perform a composite one that can search and remove and also insert two elements atomically. We have implemented the parallel mark-split GC in OpenJDK’s HotSpot virtual machine. We experimentally evaluate our collector and compare it with the default concurrent mark-sweep GC in HotSpot, using the DaCapo benchmarks, on two contemporary multiprocessor systems; one has 12 Intel Nehalem cores with HyperThreading and the other has 48 AMD Bulldozer cores. The evaluation shows that our parallel mark-split keeps the characteristics of the sequential mark-split, that it performs better than the concurrent mark-sweep in applications that have low live/garbage ratio, and have live objects locating contiguously, therefore being marked consecutively. Our parallel mark-split performs significantly better than a trivial parallelization based on locks in terms of both collection time and scalability.
  •  
3.
  • Atalar, Aras, 1985, et al. (författare)
  • Modeling Energy Consumption of Lock-Free Queue Implementations
  • 2015
  • Ingår i: 29th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2015, Hyderabad, India, 25-29 May. - : IEEE Computer Society. - 1530-2075. - 9781479986484 ; , s. 229-238
  • Konferensbidrag (refereegranskat)abstract
    • This paper considers the problem of modeling the energy behavior of lock-free concurrent queue data structures. Our main contribution is a way to model the energy behavior of lock-free queue implementations and parallel applications that use them. Focusing on steady state behavior we decompose energy behavior into throughput and power dissipation which can be modeled separately and later recombined into several useful metrics, such as energy per operation. Based on our models, instantiated from synthetic benchmark data, and using only a small amount of additional application specific information, energy and throughput predictions can be made for parallel applications that use the respective data structure implementation. To model throughput we propose a generic model for lock-free queue throughput behavior, based on a combination of the dequeuers' throughput and enqueuers' throughput. To model power dissipation we commonly split the contributions from the various computer components into static, activation and dynamic parts, where only the dynamic part depends on the actual instructions being executed. To instantiate the models a synthetic benchmark explores each queue implementation over the dimensions of processor frequency and number of threads. Finally, we show how to make predictions of application throughput and power dissipation for a parallel application using a lock-free queue requiring only a limited amount of information about the application work done between queue operations. Our case study on a Mandelbrot application shows convincing prediction results.
  •  
4.
  • Sundell, Håkan, 1968, et al. (författare)
  • A Lock-Free Algorithm for Concurrent Bags
  • 2011
  • Ingår i: 23rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'11.San Jose, 4-6 June 2011. - New York, NY, USA : ACM. - 9781450307437 ; , s. 335-344
  • Rapport (övrigt vetenskapligt/konstnärligt)abstract
    • A lock-free bag data structure supporting unordered buffering is presented in this paper. The algorithmsupports multiple producers and multiple consumers, as well as dynamic collection sizes. To handle concurrencyefficiently, the algorithm was designed to thrive for disjoint-access-parallelism for the supportedsemantics. Therefore, the algorithm exploits a distributed design combined with novel techniques for handlingconcurrent modifications of linked lists using double marks, detection of total emptiness, and efficientmemory management. Experiments on a 24-way multi-core platform show significantly better performancefor the new algorithm compared to previous algorithms of relevance.Keywords: concurrent; data structure; non-blocking; shared memory;
  •  
5.
  • Gidenstam, Anders, et al. (författare)
  • Cache-Aware Lock-Free Queues for Multiple Producers/Consumers and Weak Memory Consistency
  • 2010
  • Ingår i: Proceedings of the 14th International Conference on Principles of Distributed Systems (OPODIS) 2010. - Berlin, Heidelberg : Springer. - 9783642176524 - 3642176526 ; 6490, s. 302-317
  • Konferensbidrag (refereegranskat)abstract
    • A lock-free FIFO queue data structure is presented in this paper. The algorithm supports multiple producers and multiple consumers and weak memory models. It has been designed to be cache-aware and work directly on weak memory models. It utilizes the cache behavior in concert with lazy updates of shared data, and a dynamic lock-free memory management scheme to decrease unnecessary synchronization and increase performance. Experiments on an 8-way multi-core platform show significantly better performance for the new algorithm compared to previous fast lock-free algorithms.
  •  
6.
  • Gulisano, Vincenzo, 1982, et al. (författare)
  • STRETCH : Virtual Shared-Nothing Parallelism for Scalable and Elastic Stream Processing
  • 2022
  • Ingår i: IEEE Transactions on Parallel and Distributed Systems. - : IEEE COMPUTER SOC. - 1045-9219 .- 1558-2183. ; 33:12, s. 4221-4238
  • Tidskriftsartikel (refereegranskat)abstract
    • Stream processing applications extract value from raw data through Directed Acyclic Graphs of data analysis tasks. Shared-nothing (SN) parallelism is the de-facto standard to scale stream processing applications. Given an application, SN parallelism ins9tantiates several copies of each analysis task, making each instance responsible for a dedicated portion of the overall analysis, and relies on dedicated queues to exchange data among connected instances. On the one hand, SN parallelism can scale the execution of applications both up and out since threads can run task instances within and across processes/nodes. On the other hand, its lack of sharing can cause unnecessary overheads and hinder the scaling up when threads operate on data that could be jointly accessed in shared memory. This trade-off motivated us in studying a way for stream processing applications to leverage shared memory and boost the scale up (before the scale out) while adhering to the widely-adopted and SN-based APIs for stream processing applications. We introduce STRETCH, a framework that maximizes the scale up and offers instantaneous elastic reconfigurations (without state transfer) for stream processing applications. We propose the concept of Virtual Shared-Nothing (VSN) parallelism and elasticity and provide formal definitions and correctness proofs for the semantics of the analysis tasks supported by STRETCH, showing they extend the ones found in common Stream Processing Engines. We also provide a fully implemented prototype and show that STRETCH's performance exceeds that of state-of-the-art frameworks such as Apache Flink and offers, to the best of our knowledge, unprecedented ultra-fast reconfigurations, taking less than 40 ms even when provisioning tens of new task instances.
  •  
7.
  • Nikolakopoulos, Ioannis, 1986, et al. (författare)
  • A Consistency Framework for Iteration Operations in Concurrent Data Structures
  • 2015
  • Ingår i: 2015 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2015, Hyderabad, India, May 25-29, 2015. - : IEEE Computer Society. - 1530-2075. - 9781479986484 ; , s. 239-248
  • Konferensbidrag (refereegranskat)abstract
    • Concurrent data structures provide the means to multi-threaded applications to share data. Data structures come with a set of predefined operations, specified by the semantics of the data structure. In the literature and in several contemporary commonly used programming environments, the notion of iteration has been introduced for collection data structures, as a bulk operation enhancing the native set of operations. Iterations in several of these contexts have been treated as sequential in nature and may provide weak consistency guarantees when running concurrently with the native operations of the data structures. In this work we study iterations in concurrent data structures in the context of concurrency with the native operations and the guarantees that they provide. Besides invariability, we propose a set of consistency specifications for such bulk operations, including also concurrency-aware properties by building on Lamppost's systematic definitions for registers. Furthermore, by using queues and composite registers as case-studies of underlying objects, we provide a set of constructions of iteration operations, satisfying the properties and showing containment relations. Besides the trade-off between consistency and throughput, we point out and study trade-off between the overhead of the bulk operation and possible support (helping) by the native operations of the data structure.
  •  
8.
  •  
9.
  • Moradi, Farnaz, 1983, et al. (författare)
  • A Graph-Based Analysis of Medical Queries of a Swedish Health Care Portal
  • 2014
  • Ingår i: The Fifth International Workshop on Health Text Mining and Information Analysis (Louhi). - 9781937284909 ; , s. 2-10
  • Konferensbidrag (refereegranskat)abstract
    • Today web portals play an increasingly important role in health care allowing information seekers to learn about diseases and treatments, and to administrate their care. Therefore, it is important that the portals are able to support this process as well as possible. In this paper, we study the search logs of a public Swedish health portal to address the questions if health information seeking differs from other types of Internet search and if there is a potential for utilizing network analysis methods in combination with semantic annotation to gain insights into search behaviors. Using a semantic-based method and a graph-based analysis of word cooccurrences in queries, we show there is an overlap among the results indicating a potential role of these types of methods to gain insights and facilitate improved information search. In addition we show that samples, windows of a month, of search logs may be sufficient to obtain similar results as using larger windows. We also show that medical queries share the same structural properties found for other types of information searches, thereby indicating an ability to reuse existing analysis methods for this type of search data.
  •  
10.
  • Benkner, S., et al. (författare)
  • Peppher: Performance Portability and Programmability for Heterogeneous Many-Core Architectures
  • 2017
  • Ingår i: Programming Multicore and Many-Core Computing Systems. - Hoboken, NJ, USA : John Wiley & Sons, Inc.. - 9781119332015 - 9780470936900 ; , s. 241-260
  • Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
    • © 2017 by John Wiley & Sons, Inc. All rights reserved. PEPPHER takes a pluralistic and parallelization agnostic approach to programmability and performance portability for heterogeneous many-core architectures. The PEPPHER framework is in principle language independent but focuses on supporting C++ code with PEPPHER-specific annotations as pragmas or external annotations. The framework is open and extensible; the PEPPHER methodology details how new architectures are incorporated. The PEPPHER methodology consists of rules for how to extend the framework for new architectures. This mainly concerns adaptivity and autotuning for algorithm libraries, the necessary hooks and extensions for the run-time system and any supporting algorithms and data structures that this relies on. Offloading is a specific technique for programming heterogeneous platforms that can sometimes be applied with high efficiency. Offload as developed by the PEPPHER partner Codeplay is a particular, nonintrusive C++ extension allowing portable C++ code to support diverse heterogeneous multicore architectures in a single code base.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 234
Typ av publikation
konferensbidrag (127)
tidskriftsartikel (56)
rapport (45)
bokkapitel (4)
samlingsverk (redaktörskap) (1)
bok (1)
visa fler...
visa färre...
Typ av innehåll
refereegranskat (178)
övrigt vetenskapligt/konstnärligt (56)
Författare/redaktör
Papatriantafilou, Ma ... (78)
Cederman, Daniel, 19 ... (27)
Elmqvist, Niklas, 19 ... (24)
Ha, Phuong, 1976 (24)
Nikolakopoulos, Ioan ... (22)
visa fler...
Schiller, Elad, 1974 (21)
Gulisano, Vincenzo M ... (20)
Gidenstam, Anders, 1 ... (19)
Sundell, Håkan, 1968 (19)
Walulya, Ivan, 1985 (16)
Larsson, Andreas, 19 ... (13)
Moradi, Farnaz, 1983 (12)
Olovsson, Tomas, 195 ... (11)
Atalar, Aras, 1985 (10)
Chatterjee, Bapi, 19 ... (9)
Nguyen, Dang Nhan, 1 ... (7)
Fu, Zhang, 1982 (6)
Hoepman, Jaap-Henk (5)
Renaud Goud, Paul, 1 ... (5)
Dolev, Shlomi (5)
Spirakis, Paul G. (5)
Damaschke, Peter, 19 ... (4)
Almgren, Magnus, 197 ... (4)
Bäckström, Karl, 199 ... (4)
Träff, J.L. (4)
Pllana, Sabri (3)
Assarsson, Ulf, 1972 (3)
Soudris, D. (3)
Mustafa, Mohamed, 19 ... (3)
Petig, Thomas, 1985 (3)
Najdataei, Hannaneh, ... (3)
Salem, Iosif, 1986 (3)
Richards, A. (2)
Wimmer, M. (2)
Sanders, P (2)
Berger, Christian, 1 ... (2)
Larsson Träff, Jespe ... (2)
Benkner, S. (2)
Namyst, R. (2)
Moloney, D. (2)
Dahlgren, Erik, 1989 (2)
Grundén, Johan, 1985 (2)
Gunnarsson, Daniel, ... (2)
Holtryd, Nadja, 1988 (2)
Khazal, Anmar, 1988 (2)
Steup, Christoph (2)
Swantesson, Viktor, ... (2)
Chaudhry, Muhammad T ... (2)
Stasko, John (2)
visa färre...
Lärosäte
Högskolan i Borås (14)
Göteborgs universitet (3)
Linnéuniversitetet (3)
Mälardalens universitet (2)
Linköpings universitet (1)
Språk
Engelska (234)
Forskningsämne (UKÄ/SCB)
Naturvetenskap (227)
Teknik (38)
Samhällsvetenskap (2)

År

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy