Sciweavers

2300 search results - page 101 / 460
» Maximally Concurrent Programs
Sort
View
MICRO
2010
IEEE
170views Hardware» more  MICRO 2010»
15 years 4 months ago
Tolerating Concurrency Bugs Using Transactions as Lifeguards
Abstract--Parallel programming is hard, because it is impractical to test all possible thread interleavings. One promising approach to improve a multi-threaded program's relia...
Jie Yu, Satish Narayanasamy
TACAS
2010
Springer
142views Algorithms» more  TACAS 2010»
16 years 1 months ago
Tracking Heaps That Hop with Heap-Hop
Abstract. Heap-Hop is a program prover for concurrent heap-manipulating programs that use Hoare monitors and message-passing synchronization. Programs are annotated with pre and po...
Jules Villard, Étienne Lozes, Cristiano Cal...
RTCSA
2008
IEEE
16 years 18 days ago
Maximizing the Fault Tolerance Capability of Fixed Priority Schedules
Real-time systems typically have to satisfy complex requirements, mapped to the task attributes, eventually guaranteed by the underlying scheduler. These systems consist of a mix ...
Radu Dobrin, Hüseyin Aysan, Sasikumar Punnekk...
ICMCS
2005
IEEE
80views Multimedia» more  ICMCS 2005»
15 years 12 months ago
Maximizing the profit for cache replacement in a transcoding proxy
Recent technology advances in multimedia communication have ushered in a new era of personal communication. Users can ubiquitously access the Internet via various mobile devices. ...
Hao-Ping Hung, Ming-Syan Chen
FOCS
1992
IEEE
15 years 10 months ago
Maximizing Non-Linear Concave Functions in Fixed Dimension
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
Sivan Toledo