The SCEAS System
Navigation Menu

Conferences in DBLP

IEEE Symposium on Parallel and Distributed Processing (SPDP) (spdp)
1991 (conf/spdp/1991)


  1. On the cost-effectiveness of PRAMs. [Citation Graph (, )][DBLP]


  2. Fast load balancing on a PRAM. [Citation Graph (, )][DBLP]


  3. A practical hierarchical model of parallel computation. [Citation Graph (, )][DBLP]


  4. Prototyping parallel and distributed programs in Proteus. [Citation Graph (, )][DBLP]


  5. Adaptive protocols for managing replicated distributed databases. [Citation Graph (, )][DBLP]


  6. Data skew and the scalability of parallel joins. [Citation Graph (, )][DBLP]


  7. Modeling and optimization of complex database queries in a shared-nothing system. [Citation Graph (, )][DBLP]


  8. Caching and writeback policies in parallel file systems. [Citation Graph (, )][DBLP]


  9. An optimizing compiler for FP*-a data-parallel dialect of FP. [Citation Graph (, )][DBLP]


  10. Compiling functional languages for SIMD architectures. [Citation Graph (, )][DBLP]


  11. Parallel algorithms that solve problems by communication. [Citation Graph (, )][DBLP]


  12. A new approach to parallel functional programming. [Citation Graph (, )][DBLP]


  13. Embedding all binary trees in the hypercube. [Citation Graph (, )][DBLP]


  14. Embedding complete binary trees in faulty hypercubes. [Citation Graph (, )][DBLP]


  15. On the tradeoff between node degree and communication channel width in shuffle-exchange networks. [Citation Graph (, )][DBLP]


  16. Analysis of the modified even networks. [Citation Graph (, )][DBLP]


  17. Upper and lower bounds for one-write multivalued regular registers. [Citation Graph (, )][DBLP]


  18. Explicit dynamic exclusion algorithm. [Citation Graph (, )][DBLP]


  19. Boolean theory of coteries. [Citation Graph (, )][DBLP]


  20. What is an effective schedule? [Citation Graph (, )][DBLP]


  21. Implementing a conventional language for a dataflow architecture. [Citation Graph (, )][DBLP]


  22. A comparison of structure accessing techniques in IdA and SISAL on the CSIRAC II dataflow multiprocessor. [Citation Graph (, )][DBLP]


  23. Compile-time partitioning of a non-strict language into sequential threads. [Citation Graph (, )][DBLP]


  24. Efficient support of concurrent threads in a hybrid dataflow/von Neumann architecture. [Citation Graph (, )][DBLP]


  25. An NC algorithm for the general planar monotone circuit value problem. [Citation Graph (, )][DBLP]


  26. Efficient parallel independent subsets and matrix factorizations. [Citation Graph (, )][DBLP]


  27. Univariate polynomial division with a remainder by means of evaluation and interpolation. [Citation Graph (, )][DBLP]


  28. DC Transpose: a method for reducing communication in divide-and-conquer algorithms on mesh-based computers. [Citation Graph (, )][DBLP]


  29. Examining the effects of CU/PE overlap and synchronization overhead when using the complete sums approach to image correlation. [Citation Graph (, )][DBLP]


  30. Spectrum of choices: superpipelined, superscalar, or multiprocessor? [Citation Graph (, )][DBLP]


  31. Transputer-based architectures for associative image classification. [Citation Graph (, )][DBLP]


  32. Parallel tree search on a SIMD machine. [Citation Graph (, )][DBLP]


  33. The M-cache: a message-retrieving mechanism for multicomputer systems. [Citation Graph (, )][DBLP]


  34. An efficient protocol for ordering broadcast messages in distributed systems. [Citation Graph (, )][DBLP]


  35. Parallel algorithms for information dissemination by packets. [Citation Graph (, )][DBLP]


  36. Optimization of distributed communication in multiprotocol Tuple Space. [Citation Graph (, )][DBLP]


  37. Fault-tolerant meshes with minimal numbers of spares. [Citation Graph (, )][DBLP]


  38. Duplicating keys to streamline sorting on a mesh-connected computer. [Citation Graph (, )][DBLP]


  39. Off-line routing with small queues on a mesh-connected processor array. [Citation Graph (, )][DBLP]


  40. Optimal randomized algorithms for multipacket and cut through routing on the mesh. [Citation Graph (, )][DBLP]


  41. A decentralized task scheduling algorithm and its performance modeling for computer networks. [Citation Graph (, )][DBLP]


  42. Approximate MVA from Markov model of software client/server systems. [Citation Graph (, )][DBLP]


  43. Performance of multi-threaded execution in a shared-memory multiprocessor. [Citation Graph (, )][DBLP]


  44. An analytical model for predicting performance in a heterogeneous system. [Citation Graph (, )][DBLP]


  45. Well-formed generalized task graphs. [Citation Graph (, )][DBLP]


  46. Stabilizing Petri nets. [Citation Graph (, )][DBLP]


  47. Pitfalls of Petri net transformation. [Citation Graph (, )][DBLP]


  48. Reliagram-a communication abstraction for distributed processing. [Citation Graph (, )][DBLP]


  49. New divide-and-conquer techniques for finding disjoint paths. [Citation Graph (, )][DBLP]


  50. Parallel algorithm and complexity results for telephone link simulation. [Citation Graph (, )][DBLP]


  51. Lower bounds and parallel algorithms for planar orthogonal grid drawings. [Citation Graph (, )][DBLP]


  52. Parallel and distributed algorithms for finite constraint satisfaction problems. [Citation Graph (, )][DBLP]


  53. Three disjoint path paradigms in star networks. [Citation Graph (, )][DBLP]


  54. BDG-torus union graph-an efficient algorithmically specializedparallel interconnect. [Citation Graph (, )][DBLP]


  55. Data communication and computational geometry on the star and pancake interconnection networks. [Citation Graph (, )][DBLP]


  56. A comparison of task scheduling strategies for multiprocessor systems. [Citation Graph (, )][DBLP]


  57. On a new approach for enhancing the fault coverage of conformance testing of protocols. [Citation Graph (, )][DBLP]


  58. Reliability analysis of a fault-tolerant multi-bus multiprocessor system. [Citation Graph (, )][DBLP]


  59. Hierarchical reliability evaluation of large networks. [Citation Graph (, )][DBLP]


  60. A new algorithm-based fault tolerance technique for computing matrix operations. [Citation Graph (, )][DBLP]


  61. Fault-tolerant routing with regularity restoration in Boolean n -cube interconnection networks. [Citation Graph (, )][DBLP]


  62. Fast fault-tolerant parallel communication for de Bruijn networks using information dispersal. [Citation Graph (, )][DBLP]


  63. Distributed fault-tolerant routing on hypercubes algorithms and performance study. [Citation Graph (, )][DBLP]


  64. Embedding classical communication topologies in the OPAM architecture. [Citation Graph (, )][DBLP]


  65. Performance evaluation of an efficient multiple copy update algorithm. [Citation Graph (, )][DBLP]


  66. Local vs. global memory in the IBM RP3: experiments and performance modelling. [Citation Graph (, )][DBLP]


  67. Performance evaluation of a local area network for real-time applications. [Citation Graph (, )][DBLP]


  68. Performance analysis of inclusion effects in multi-level multiprocessor caches. [Citation Graph (, )][DBLP]


  69. An evaluation of concurrent priority queue algorithms. [Citation Graph (, )][DBLP]


  70. Asynchronous parallel search by the parallel genetic algorithm. [Citation Graph (, )][DBLP]


  71. Circuit partitioning using parallel mean field annealing algorithms. [Citation Graph (, )][DBLP]


  72. A parallel hybrid learning approach to artificial neural nets. [Citation Graph (, )][DBLP]


  73. ATARIC: an algebraic technique to analyse reconfiguration for fault tolerance in a hypercube. [Citation Graph (, )][DBLP]


  74. Very efficient cyclic shifts on hypercubes. [Citation Graph (, )][DBLP]


  75. Adaptive routing in generalized hypercube architectures. [Citation Graph (, )][DBLP]


  76. A heuristic processor allocation strategy in hypercube systems. [Citation Graph (, )][DBLP]


  77. On mapping Bezier curve and surface subdivision algorithms into a hypercube with geometric adjacency constraint. [Citation Graph (, )][DBLP]


  78. Multiprogramming on multiprocessors. [Citation Graph (, )][DBLP]


  79. Synthesis of parallel Ada code from a knowledge base of rules. [Citation Graph (, )][DBLP]


  80. Object oriented Fortran for development of portable parallel programs. [Citation Graph (, )][DBLP]


  81. A high performance barrier synchronizer and its novel applications in highly parallel systems. [Citation Graph (, )][DBLP]


  82. SUPRA-RPC: SUbprogram PaRA meters in Remote Procedure Calls. [Citation Graph (, )][DBLP]


  83. An optimal algorithm for the longest common subsequence problem. [Citation Graph (, )][DBLP]


  84. Explicit construction for reliable reconfigurable array architectures. [Citation Graph (, )][DBLP]


  85. A period-processor-time-minimal systolic array for cubical mesh algorithms. [Citation Graph (, )][DBLP]


  86. SIMD-emulations of hypercubes and related networks. [Citation Graph (, )][DBLP]


  87. The effects of multiprogramming on barrier synchronization. [Citation Graph (, )][DBLP]


  88. Effective load sharing in distributed real-time systems. [Citation Graph (, )][DBLP]


  89. Dynamic control of parallelism and granularity in executing nested parallel loops. [Citation Graph (, )][DBLP]


  90. Load balancing in large networks: a comparative study. [Citation Graph (, )][DBLP]


  91. Detection of strong predicates in distributed programs. [Citation Graph (, )][DBLP]


  92. Test generation in a distributed environment. [Citation Graph (, )][DBLP]


  93. A parallel system for test pattern generation. [Citation Graph (, )][DBLP]


  94. Debugging concurrent programs using static analysis and run-time hardware monitoring. [Citation Graph (, )][DBLP]


  95. Distributed computing on anonymous hypercube networks. [Citation Graph (, )][DBLP]


  96. Towards a complexity hierarchy of wait-free concurrent objects. [Citation Graph (, )][DBLP]


  97. The complexity of readiness and failure equivalences for processes. [Citation Graph (, )][DBLP]


  98. A group of permutations with edge-disjoint paths on hypercubes. [Citation Graph (, )][DBLP]


  99. Parallel matching on expanders. [Citation Graph (, )][DBLP]


  100. An optimal parallel matching algorithm for cographs. [Citation Graph (, )][DBLP]


  101. Super critical tree numbering and optimal tree ranking are in NC. [Citation Graph (, )][DBLP]


  102. On a fast deterministic parallel approximate matching algorithm. [Citation Graph (, )][DBLP]


  103. Multistage bus network (MBN): an interconnection network for cache coherent multiprocessors. [Citation Graph (, )][DBLP]


  104. Broadcast ring sandwich networks. [Citation Graph (, )][DBLP]


  105. Performance enhancement of multistage interconnection network with nonuniform traffic. [Citation Graph (, )][DBLP]


  106. Propagating buffer: a new approach to deadlock freedom in store-and-forward networks. [Citation Graph (, )][DBLP]


  107. A divide-and-conquer method of solving tridiagonal systems on hypercube massively parallel computers. [Citation Graph (, )][DBLP]


  108. A high speed systolic architecture for labeling connected components in an image. [Citation Graph (, )][DBLP]


  109. Broadcasting on incomplete hypercubes. [Citation Graph (, )][DBLP]


  110. Packet routing on square meshes with row and column buses. [Citation Graph (, )][DBLP]


  111. Deadlock-free adaptive routing algorithms for multicomputers: evaluation of a new algorithm. [Citation Graph (, )][DBLP]


  112. An algorithm for dynamic reconfiguration of a multicomputer network. [Citation Graph (, )][DBLP]


  113. Bounds on the performances of message routing heuristics. [Citation Graph (, )][DBLP]


  114. Performance analysis of single-buffered multistage interconnection networks. [Citation Graph (, )][DBLP]


  115. A shared-memory multiprocessor garbage collector and its evaluation for committed-choice logic programs. [Citation Graph (, )][DBLP]


  116. Memory allocation constructs to complement NUMA memory management. [Citation Graph (, )][DBLP]


  117. Reliability oriented allocation of files on distributed systems. [Citation Graph (, )][DBLP]


  118. On multi-threaded list-processing and garbage collection. [Citation Graph (, )][DBLP]

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002