INFSOF
2002
13 years 4 months ago
2002
Petri nets have been extensively used in the modelling and analysis of concurrent and distributed systems. The veri
DC
1998
13 years 4 months ago
1998
We show that the problem of predicate detection in distributed systems is NP-complete. In the past, efficient algorithms have been developed for special classes of predicates suc...
COMCOM
1998
13 years 4 months ago
1998
Many researchers are devising algorithms for task placement in distributed systems, but few are designing the necessary mechanisms to provide the information required by those alg...
FGCS
2002
13 years 4 months ago
2002
High-performance computing increasingly occurs on "computational grids" composed of heterogeneous and geographically distributed systems of computers, networks, and stor...
ENTCS
2002
13 years 4 months ago
2002
The perceived advantages of distributed systems, such as increased reliability and availability, are o set by the increased complexity of developing such applications. The develop...
FGCS
2000
13 years 4 months ago
2000
Modern scientific computing involves organizing, moving, visualizing, and analyzing massive amounts of data from around the world, as well as employing large-scale computation. The...
CIE
2004
Springer
13 years 4 months ago
2004
Springer
When dealing with large, distributed systems that use state-of-the-art components, individual components are usually developed in parallel. As development continues, the decouplin...
JPDC
2007
13 years 4 months ago
2007
High quality of security is increasingly critical for applications running on heterogeneous distributed systems. However, existing scheduling algorithms for heterogeneous distribu...
JCIT
2007
13 years 4 months ago
2007
An important issue of distributed systems is interoperability. Lack of interoperability between distributed systems is a common problem with current and legacy applications. Since...
FUIN
2007
13 years 4 months ago
2007
Concurrent runs reveal more insight into distributed systems than interleaved runs. This is shown by help of Dijkstra’s paradigm of five philosophers.