Firewall security: Policies, testing and performance evaluation
MR Lyu, LKY Lau - Proceedings 24th Annual International …, 2000 - ieeexplore.ieee.org
Explores the firewall security and performance relationships for distributed systems.
Experiments are conducted to set firewall security into seven different levels and to quantify …
Experiments are conducted to set firewall security into seven different levels and to quantify …
Fast and portable locking for multicore architectures
The scalability of multithreaded applications on current multicore systems is hampered by
the performance of lock algorithms, due to the costs of access contention and cache misses …
the performance of lock algorithms, due to the costs of access contention and cache misses …
Low-overhead software transactional memory with progress guarantees and strong semantics
Software transactional memory offers an appealing alternative to locks by improving
programmability, reliability, and scalability. However, existing STMs are impractical because …
programmability, reliability, and scalability. However, existing STMs are impractical because …
On developing optimistic transactional lazy set
Transactional data structures with the same performance of highly concurrent data structures
enable performance-competitive transactional applications. Although Software …
enable performance-competitive transactional applications. Although Software …
A model of security information flow on entities for trust computation
S Bahtiyar, M Cihan… - 2010 10th IEEE …, 2010 - ieeexplore.ieee.org
Service oriented environments are computer network systems that are highly dynamic and
change with time. Entities in such environments have different security needs from services …
change with time. Entities in such environments have different security needs from services …
Towards more scalable mutual exclusion for multicore architectures
JP Lozi - 2014 - theses.hal.science
The scalability of multithreaded applications on current multicore systems is hampered by
the performance of lock algorithms, due to the costs of access contention and cache misses …
the performance of lock algorithms, due to the costs of access contention and cache misses …
An automated framework for decomposing memory transactions to exploit partial rollback
A Dhoke, R Palmieri… - 2015 IEEE International …, 2015 - ieeexplore.ieee.org
In this paper, we present a framework that automatically decomposes programmer-written
flat transactions into closed-nested transactions. The framework relies on two key …
flat transactions into closed-nested transactions. The framework relies on two key …
[PDF][PDF] On Improving Transactional Memory: Optimistic Transactional Boosting, Remote Execution, and Hybrid Transactions
A Hassan - 2014 - ssrg.ece.vt.edu
In the beginning of the new century, computer manufacturers faced difficulties in increasing
CPU's clock speed because of hitting the overheating wall. As a result, multi-core …
CPU's clock speed because of hitting the overheating wall. As a result, multi-core …
Efficient Runtime Support for Reliable and Scalable Parallelism
M Zhang - 2016 - rave.ohiolink.edu
Commodity hardware is becoming more parallel. To benefit from parallel hardware, software
needs to become more parallel as well. Parallel execution of a concurrent program can …
needs to become more parallel as well. Parallel execution of a concurrent program can …
Designing, Modeling, and Optimizing Transactional Data Structures
AME Hassan - 2015 - vtechworks.lib.vt.edu
Transactional memory (TM) has emerged as a promising synchronization abstraction for
multi-core architectures. Unlike traditional lock-based approaches, TM shifts the burden of …
multi-core architectures. Unlike traditional lock-based approaches, TM shifts the burden of …