Sciweavers

1015 search results - page 183 / 203
» Syntactic Control of Concurrency
Sort
View
WINET
2011
13 years 2 months ago
High performance, low complexity cooperative caching for wireless sensor networks
During the last decade, Wireless Sensor Networks (WSNs) have emerged and matured at such point that currently support several applications like environment control, intelligent bu...
Nikos Dimokas, Dimitrios Katsaros, Leandros Tassiu...
ICDE
2011
IEEE
222views Database» more  ICDE 2011»
12 years 11 months ago
Dynamic prioritization of database queries
— Enterprise database systems handle a variety of diverse query workloads that are of different importance to the business. For example, periodic reporting queries are usually mi...
Sivaramakrishnan Narayanan, Florian Waas
ICLP
2011
Springer
12 years 11 months ago
Minimizing the overheads of dependent {AND}-parallelism
Parallel implementations of programming languages need to control synchronization overheads. Synchronization is essential for ensuring the correctness of parallel code, yet it add...
Peter Wang, Zoltan Somogyi
TACAS
2012
Springer
263views Algorithms» more  TACAS 2012»
12 years 3 months ago
Reachability under Contextual Locking
Abstract. The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of...
Rohit Chadha, P. Madhusudan, Mahesh Viswanathan
OOPSLA
2004
Springer
14 years 23 days ago
Transparent proxies for java futures
A proxy object is a surrogate or placeholder that controls access to another target object. Proxies can be used to support distributed programming, lazy or parallel evaluation, ac...
Polyvios Pratikakis, Jaime Spacco, Michael W. Hick...