Sciweavers

5180 search results - page 372 / 1036
» Concurrency, Time, and Constraints
Sort
View
POPL
2009
ACM
16 years 7 months ago
The theory of deadlock avoidance via discrete control
Deadlock in multithreaded programs is an increasingly important problem as ubiquitous multicore architectures force parallelization upon an ever wider range of software. This pape...
Manjunath Kudlur, Scott A. Mahlke, Stéphane...
HASKELL
2009
ACM
16 years 1 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
ISCA
2007
IEEE
198views Hardware» more  ISCA 2007»
16 years 1 months ago
Making the fast case common and the uncommon case simple in unbounded transactional memory
Hardware transactional memory has great potential to simplify the creation of correct and efficient multithreaded programs, allowing programmers to exploit more effectively the s...
Colin Blundell, Joe Devietti, E. Christopher Lewis...
INFOCOM
1998
IEEE
15 years 11 months ago
TCP Behavior of a Busy Internet Server: Analysis and Improvements
The rapid growth of the World Wide Web in recent years has caused a significant shift in the composition of Internet traffic. Although past work has studied the behavior of TCP dy...
Hari Balakrishnan, Venkata N. Padmanabhan, Sriniva...
JUCS
2008
177views more  JUCS 2008»
15 years 6 months ago
An Improved Multi-Agent Simulation Methodology for Modelling and Evaluating Wireless Communication Systems Resource Allocation A
: Multi-Agent Systems (MAS) constitute a well known approach in modelling dynamical real world systems. Recently, this technology has been applied to Wireless Communication Systems...
P. M. Papazoglou, Dimitris A. Karras, Rallis C. Pa...