Parallel Search On Shared Memory
Parallel Search On Shared Memory is a computational framework within the domain of parallel algorithms that enables concurrent access to a common memory space by multiple processing units to accelerate the search process through coordinated exploration of shared data structures.
22
Publications
636
Citations
59
Authors
37
Institutions
Publications per year
2017–2026
1
Parents
22
Marc Snir · SIAM Journal on Computing · 1985 · 110 citations
Parallel BLAST on split databases
David R. Mathog · Bioinformatics · 2003 · 74 citations · Full text
1–5 of 22
59
2
h-index
Rutgers, The State University of New Jersey, United States
1 publications · 16 citations
1
h-index
1
h-index
IBM Research - Thomas J. Watson Research Center, United States
1 publications · 57 citations
1
h-index
1
h-index
1–5 of 59
37
Chinese University of Hong Kong
Hong Kong, Hong Kong
1 h-index
1 publications
29 citations

United States Department of the Army
Arlington, United States
1 h-index
2 publications
46 citations
IBM (United States)
Armonk, United States
1 h-index
2 publications
114 citations
Friedrich-Alexander-Universität Erlangen-Nürnberg
Erlangen, Germany
1 h-index
1 publications
16 citations

University of New Hampshire
Durham, United States
1 h-index
3 publications
42 citations
Kyushu University
Fukuoka, Japan
1 h-index
4 publications
72 citations
University of Maryland, College Park
College Park, United States
1 h-index
1 publications
23 citations
University of Konstanz
Konstanz, Germany
1 h-index
2 publications
32 citations
1–8 of 37
2 publications · 80 citations
2
h-index
IJCSE · 1 publications · 12 citations
1
h-index
Conference · 1 publications · 11 citations
1
h-index
Repository · 1 publications · 18 citations
1
h-index
1 publications · 14 citations
1
h-index
1–5