Sciweavers

75 search results - page 10 / 15
» Computing Applicability Conditions for Plans with Loops
Sort
View
PPOPP
2010
ACM
14 years 5 months ago
Lazy binary-splitting: a run-time adaptive work-stealing scheduler
We present Lazy Binary Splitting (LBS), a user-level scheduler of nested parallelism for shared-memory multiprocessors that builds on existing Eager Binary Splitting work-stealing...
Alexandros Tzannes, George C. Caragea, Rajeev Baru...
CGO
2009
IEEE
13 years 11 months ago
Alchemist: A Transparent Dependence Distance Profiling Infrastructure
Effectively migrating sequential applications to take advantage of parallelism available on multicore platforms is a well-recognized challenge. This paper addresses important aspec...
Xiangyu Zhang, Armand Navabi, Suresh Jagannathan
ICDCS
2009
IEEE
14 years 2 months ago
Explicit Batching for Distributed Objects
Although distributed object systems, for example RMI and CORBA, enable object-oriented programs to be easily distributed across a network, achieving acceptable performance usually...
Eli Tilevich, William R. Cook, Yang Jiao
ATAL
2006
Springer
13 years 11 months ago
A decision-theoretic approach to file consistency in constrained peer-to-peer device networks
As users interact with an increasing array of personal computing devices, maintaining consistency of data across those devices becomes significantly more difficult. Typical soluti...
David L. Roberts, Sooraj Bhat, Charles Lee Isbell ...
IH
2007
Springer
14 years 1 months ago
Software Integrity Checking Expressions (ICEs) for Robust Tamper Detection
Abstract. We introduce software integrity checking expressions (SoftICEs), which are program predicates that can be used in software tamper detection. We present two candidates, pr...
Mariusz H. Jakubowski, Prasad Naldurg, Vijay Patan...