急性
发表于 2025-3-26 23:54:55
Retrieval of scattered information by EREW, CREW and CRCW PRAMs,me, even if the number of processors is arbitrarily large and .=2. On the CREW PRAM, we show that every .-processor algorithm for .-compaction problem requires Ω(loglog .) time, even if .=2. Finally, we show that .(log .) time can be achieved on the ROBUST PRAM, a very weak CRCW PRAM model.
有罪
发表于 2025-3-27 01:34:11
http://reply.papertrans.cn/16/1529/152838/152838_32.png
HUSH
发表于 2025-3-27 07:47:02
Parallel algorithms for priority queue operations, of an MH from a set of . items takes .(n/p+log .) time. The given algorithms for insertion and deletion achieve the best possible running time for any number of processors ., with . ∈ .(log n/log log .), while the MH construction algorithm employs up to .(n/log .) processors optimally.
Missile
发表于 2025-3-27 12:29:01
http://reply.papertrans.cn/16/1529/152838/152838_34.png
疏远天际
发表于 2025-3-27 16:14:56
Fractional cascading simplified, and captures some of the inherent difficulties associated with the fractional casading data structure. In particular, we use tools from branching process theory and derive some useful asymptotic bounds. The probability of deviation from the expected performance bounds decreases rapidly with number of keys.
Generator
发表于 2025-3-27 21:26:14
https://doi.org/10.1007/978-3-658-29556-1me, even if the number of processors is arbitrarily large and .=2. On the CREW PRAM, we show that every .-processor algorithm for .-compaction problem requires Ω(loglog .) time, even if .=2. Finally, we show that .(log .) time can be achieved on the ROBUST PRAM, a very weak CRCW PRAM model.
羊齿
发表于 2025-3-27 22:42:23
Mandana Biegi,Jürgen Förster,Thomas Philipped algorithm routes packets consisting of . flits each (. arbitrary), with . · n/4 + 2 · . + . · log .).) routing steps, with very high probability. The practical importance of this work is enhanced even more by the fact that the distribution of the packets only needs to be approximately a . permutation.
门闩
发表于 2025-3-28 02:19:31
Kai Hafez,Susanne Frank,Sandra Tänzer of an MH from a set of . items takes .(n/p+log .) time. The given algorithms for insertion and deletion achieve the best possible running time for any number of processors ., with . ∈ .(log n/log log .), while the MH construction algorithm employs up to .(n/log .) processors optimally.
Pageant
发表于 2025-3-28 08:06:02
http://reply.papertrans.cn/16/1529/152838/152838_39.png
neutralize
发表于 2025-3-28 13:04:27
http://reply.papertrans.cn/16/1529/152838/152838_40.png