SwePub
Sök i SwePub databas

  Utökad sökning

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

Sökning: LAR1:cth > Tsigas Philippas 1967

Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Almgren, Magnus, 1972-, et al. (författare)
  • Mapping Systems Security Research at Chalmers
  • 2011
  • Ingår i: First SysSec Workshop (SysSec 2011). - 978-0-7695-4530-1 ; s. 67-70
  • Konferensbidrag (refereegranskat)abstract
    • The department of Computer Science and Engineering at Chalmers University has a long tradition of research in systems security, including security metrics, attack detection, and mitigation. We focus on security issues arising in four specific environments: (1) backbone links, (2) sensor networks, (3) the connected car, and (4) the smart grid. In this short summary we describe recent results as well as open research questions we are exploring.
  •  
2.
  • Assarsson, Ulf, 1972-, et al. (författare)
  • Image-Space Dynamic Transparency for Improved Object Discovery in 3D Environments
  • 2006
  • Rapport (övrigt vetenskapligt)abstract
    • We present an image-space algorithm for dynamic transparency with the purpose of supporting object discovery and access in information-rich 3D visualization environments. The algorithm is based on multiple rendering passes and detects instances of object occlusion in the image-space using the fragment shader capabilities of modern programmable graphics hardware, creating alpha maps of opacity gradients around the occluded objects. In essence, the effect is somewhat similar to “X-ray vision” of a superhero. We have implemented a prototype version of our algorithm with real-time rendering performance using a number of optimizations and speedups on current graphics hardware. To evaluate its use, we have also implemented three different example applications portraying different scenarios, including abstract visualization, virtual walkthrough, and gaming. Preliminary results from an empirical user study comparing our technique to standard viewpoint controls indicate that our technique is superior in regards to object discovery efficiency. These results hold over both completion times as well as correctness of a visual search task.
  •  
3.
  • Benkner, S., 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. ; 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.
  •  
4.
5.
  •  
6.
  • Casado, Lander, 1985-, et al. (författare)
  • ContikiSec: A Secure Network Layer for Wireless Sensor Networks under the Contiki Operating System
  • 2009
  • Ingår i: Proceedings of the 14th Nordic Conference on Secure IT Systems (NordSec 2009), Lecture Notes in Computer Science. - 1611-3349. - 978-3-642-04765-7 ; 5838, s. 133-147
  • Konferensbidrag (refereegranskat)abstract
    • In this paper we introduce ContikiSec, a secure network layer for wireless sensor networks, designed for the Contiki Operating System. ContikiSec has a configurable design, providing three security modes starting from confidentiality and integrity, and expanding to confidentiality, authentication, and integrity. ContikiSec has been designed to balance low energy consumption and security while conforming to a small memory footprint. Our design was based on performance evaluation of existing security primitives and is part of the contribution of this paper. Our evaluation was performed in the Modular Sensor Board hardware platform for wireless sensor networks, running Contiki. Contiki is an open source, highly portable operating system for wireless sensor networks (WSN) that is widely used in WSNs.
  •  
7.
  • Casimiro, Antonio, et al. (författare)
  • KARYON: Towards Safety Kernels for Cooperative Vehicular Systems
  • 2012
  • Ingår i: Stabilization, Safety, and Security of Distributed Systems - 14th International Symposium, SSS 2012, Toronto, Canada, October 1-4, 2012. Proceedings, Springer, Lecture Notes in Computer Science. ; 7596, s. 232-235
  • Konferensbidrag (refereegranskat)abstract
    • KARYON, a kernel-based architecture for safety-critical control, is a European project that proposes a new perspective to improve performance of smart vehicle coordination focusing on Advanced Driver Assistance Systems (ADASs) and Unmanned Aerial Systems (UAS). The key objective is to provide system solutions for predictable and safe coordination of smart vehicles that autonomously cooperate and interact in an open and inherently uncertain environment. Currently, these systems are not allowed to operate on the public roads or in the air space, as the risk of causing severe damage cannot be excluded with sufficient certainty. The impact of the project is two-fold; it will provide improved vehicle density without driver involvement and increased traffic throughput to maintain mobility without a need to build new traffic infrastructures. The results will improve interaction in cooperation scenarios while preserving safety and assessing it according to standards. The prospective project results include self-stabilizing algorithms for vehicle coordination, communication and synchronization. In addition, we aim at showing that the safety kernel can be designed to be a self-stabilizing one.
8.
  • Cederman, Daniel, 1981-, et al. (författare)
  • A Practical Quicksort Algorithm for Graphics Processors
  • 2008
  • Rapport (övrigt vetenskapligt)abstract
    • In this paper we describe GPU-Quicksort, an efficient Quicksort algorithm suitable for highly parallel multi-core graphics processors. Quicksort has previously been considered an inefficient sorting solution for graphics processors, but we show that in CUDA, NVIDIA's programming platform for general purpose computations on graphical processors, GPU-Quicksort performs better than the fastest known sorting implementations for graphics processors, such as radix and bitonic sort. Quicksort can thus be seen as a viable alternative for sorting large quantities of data on graphics processors.
  •  
9.
  • Cederman, Daniel, 1981-, et al. (författare)
  • A Practical Quicksort Algorithm for Graphics Processors
  • 2008
  • Ingår i: Proceedings of the 16th Annual European Symposium on Algorithms (ESA 2008), Lecture Notes in Computer Science.. - 0302-9743. ; 5193, s. 246-258
  • Konferensbidrag (refereegranskat)abstract
    • In this paper we present GPU-Quicksort, an efficient Quicksort algorithm suitable for highly parallel multi-core graphics processors. Quicksort has previously been considered as an inefficient sorting solution for graphics processors, but we show that GPU-Quicksort often performs better than the fastest known sorting implementations for graphics processors, such as radix and bitonic sort. Quicksort can thus be seen as a viable alternative for sorting large quantities of data on graphics processors.
  •  
10.
  • Cederman, Daniel, 1981-, et al. (författare)
  • A Study of the Behavior of Synchronization Methods in Commonly Used Languages and Systems
  • 2013
  • Ingår i: Proceedings of the 27th IEEE International Parallel & Distributed Processing Symposium. ; s. 1309-1320
  • Konferensbidrag (refereegranskat)abstract
    • Synchronization is a central issue in concurrency and plays an important role in the behavior and performance of modern programmes. Programming languages and hardware designers are trying to provide synchronization constructs and primitives that can handle concurrency and synchronization issues efficiently. Programmers have to find a way to select the most appropriate constructs and primitives in order to gain the desired behavior and performance under concurrency. Several parameters and factors affect the choice, through complex interactions among (i) the language and the language constructs that it supports, (ii) the system architecture, (iii) possible run-time environments, virtual machine options and memory management support and (iv) applications. We present a systematic study of synchronization strategies, focusing on concurrent data structures. We have chosen concurrent data structures with different number of contention spots. We consider both coarse-grain and fine-grain locking strategies, as well as lock-free methods. We have investigated synchronization-aware implementations in C++, C# (.NET and Mono) and Java. Considering the machine architectures, we have studied the behavior of the implementations on both Intel's Nehalem and AMD's Bulldozer. The properties that we study are throughput and fairness under different workloads and multiprogramming execution environments. For NUMA architectures fairness is becoming as important as the typically considered throughput property. To the best of our knowledge this is the first systematic and comprehensive study of synchronization-aware implementations. This paper takes steps towards capturing a number of guiding principles and concerns for the selection of the programming environment and synchronization methods in connection to the application and the system characteristics.
  •  
Skapa referenser, mejla, bekava och länka
Åtkomst
fritt online (6)
Typ av publikation
konferensbidrag (78)
rapport (43)
tidskriftsartikel (37)
bokkapitel (3)
samlingsverk (redaktörskap) (1)
bok (1)
visa fler...
visa färre...
Typ av innehåll
refereegranskat (110)
övrigt vetenskapligt (53)
Författare/redaktör
Papatriantafilou, Ma ... (47)
Ha, Phuong, 1976- (26)
Elmqvist, Niklas, 19 ... (25)
Cederman, Daniel, 19 ... (24)
Schiller, Elad Micha ... (17)
visa fler...
Gidenstam, Anders, 1 ... (17)
Sundell, Håkan, 1968 ... (17)
Larsson, Andreas, 19 ... (12)
Moradi, Farnaz, 1983 ... (9)
Koldehofe, Boris, 19 ... (9)
Olovsson, Tomas, 195 ... (8)
Anshus, Otto (8)
Zhang, Yi, 1971-, (8)
Fu, Zhang, 1982-, (6)
Dolev, Shlomi (6)
Spirakis, Paul G. (5)
Damaschke, Peter, 19 ... (4)
Hoepman, Jaap-Henk (4)
Assarsson, Ulf, 1972 ... (3)
Almgren, Magnus, 197 ... (3)
Mustafa, Mohamed, (3)
Nikolakopoulos, Yian ... (3)
Stasko, John (3)
Wimmer, Martin (3)
Berger, Christian, (2)
Dahlgren, Erik, 1989 ... (2)
Grundén, Johan, 1985 ... (2)
Holtryd, Nadia, 1988 ... (2)
Khazal, Anmar, 1988- ... (2)
Steup, Christoph (2)
Swantesson, Viktor, ... (2)
Chatterjee, Bapi, 19 ... (2)
Nguyen Dang, Nhan, 1 ... (2)
Chaudhry, Muhammad T ... (2)
Tudoreanu, Eduard (2)
Gidenstam, A. (2)
Fouchal, Hacène (2)
Petig, Thomas, 1985- ... (2)
Sundell, Per Håkan, (2)
Larsson Träff, Jespe ... (2)
Karlsson, Johan, 195 ... (1)
Zhang, Yi (1)
Jonsson, Erland, 194 ... (1)
Gulisano, Vincenzo, ... (1)
Landsiedel, Olaf, 19 ... (1)
Kleberger, Pierre, 1 ... (1)
Pirzadeh, Laleh, 198 ... (1)
Maggi, Federico (1)
John, Wolfgang, 1978 ... (1)
visa färre...
Lärosäte
Chalmers tekniska högskola (163)
Högskolan i Borås (4)
Göteborgs universitet (2)
Linnéuniversitetet (1)
Linköpings universitet (1)
Språk
Engelska (163)
Ämne (HSV)
Naturvetenskap (155)
Teknik (3)
Samhällsvetenskap (2)

År

 
pil uppåt Stäng

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