|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 28 occurrences of 26 keywords
|
|
|
Results
Found 5 publication records. Showing 5 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
31 | Hussein M. Alnuweiri |
Constant-Time Parallel Algorithms for Image Labeling on a Reconfigurable Network of Processors. |
IEEE Trans. Parallel Distributed Syst. |
1994 |
DBLP DOI BibTeX RDF |
constant-time parallel algorithms, reconfigurable network of processors, minimum-labeled PE, timecomplexity, parallel algorithms, computational complexity, image recognition, reconfigurable architectures, multiprocessorinterconnection networks, image labeling |
31 | Hosame Abu-Amara, Vidya Gummadi |
New Model and Algorithms for Leader Election in Synchronous Fiber-Optic Networks. |
IEEE Trans. Parallel Distributed Syst. |
1994 |
DBLP DOI BibTeX RDF |
optical links, leader election algorithm, synchronous fiber-optic networks, timecomplexity, computational complexity, distributed algorithms, distributed algorithms, computer networks, message complexity, switching theory |
31 | Jong Kim 0001, Chita R. Das, Woei Lin |
A Top-Down Processor Allocation Scheme for Hypercube Computers. |
IEEE Trans. Parallel Distributed Syst. |
1991 |
DBLP DOI BibTeX RDF |
top-down processor allocation scheme, free list, bottom-upapproach, buddy allocation, timecomplexity, noncubic allocation, inclusion/exclusion allocation, parallel processing, hypercube networks, parallel implementation, gray code, average delay, hypercube computers, system utilization |
30 | JiangJing Pan, Shahin Hashtrudi-Zad |
Diagnosability Test for Timed Discrete-Event Systems. |
ICTAI |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Mayez A. Al-Mouhamed |
Analysis of Macro-Dataflow Dynamic Scheduling on Nonuniform Memory Access Architectures. |
IEEE Trans. Parallel Distributed Syst. |
1993 |
DBLP DOI BibTeX RDF |
macro-dataflow dynamic scheduling, nonuniform memory access architectures, computational tasks, least-communication, finish time, first-come first-served scheduling, scheduling, computational complexity, parallel programming, parallel architectures, time complexity, granularity, communication costs, data transfer, multiprocessing programs, scheduling heuristic |
Displaying result #1 - #5 of 5 (100 per page; Change: )
|
|