Sciweavers

1163 search results - page 88 / 233
» Concurrent Subspaces Analysis
Sort
View
MOC
1998
64views more  MOC 1998»
15 years 3 months ago
Analysis of non-overlapping domain decomposition algorithms with inexact solves
In this paper we construct and analyze new non-overlapping domain decomposition preconditioners for the solution of second-order elliptic and parabolic boundary value problems. The...
James H. Bramble, Joseph E. Pasciak, Apostol T. Va...
134
Voted
SIGSOFT
2010
ACM
15 years 1 months ago
Building scalable software systems in the multicore era
Software systems must face two challenges today: growing complexity and increasing parallelism in the underlying computational models. The problem of increased complexity is often...
Hridesh Rajan
120
Voted
PPOPP
2005
ACM
15 years 9 months ago
Static analysis of atomicity for programs with non-blocking synchronization
In concurrent programming, non-blocking synchronization is very efficient but difficult to design correctly. This paper presents a static analysis to show that code blocks are ato...
Liqiang Wang, Scott D. Stoller
APN
1993
Springer
15 years 7 months ago
Transient Analysis of Deterministic and Stochastic Petri Nets
This paper introduces an efficient numerical algorithm for transient analysis of deterministic and stochastic Petri nets (DSPNs) and other discrete-event stochastic systems with ...
Hoon Choi, Vidyadhar G. Kulkarni, Kishor S. Trived...
COMPSAC
2006
IEEE
15 years 9 months ago
Performance Analysis of an Asynchronous Web Server
Modern Web servers need to process multiple requests concurrently in order to fulfill the workload demands expected of them. Concurrency can be implemented in a Web server using ...
U. Praphamontripong, Swapna S. Gokhale, Aniruddha ...