1205 search results - page 68 / 241 » On P Systems with Bounded Parallelism |
HPDC
2007
IEEE
14 years 2 months ago
2007
IEEE
Grid computations require global access to massive data stores. To meet this need, the GridNFS project aims to provide scalable, high-performance, transparent, and secure wide-are...
ENTCS
2000
13 years 7 months ago
2000
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Basic Parallel Processes (BPP). A PSPACE lower bound for BPA and NP lower bound fo...
CCGRID
2010
IEEE
13 years 8 months ago
2010
IEEE
Although shared memory programming models show good programmability compared to message passing programming models, their implementation by page-based software distributed shared m...
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
HPCN
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. The performance of HPF codes is in uenced by the characteristics of the parallel system and by the e ciency of the compilation system. Performance analysis has to take in...