The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
A Partitioning Strategy for Nonuniform Problems on Multiprocessors
Open accessAbstract
We consider the partitioning of a problem on a domain with unequal work estimates in different subdomains in a way that balances the workload across multiple processors. Such a problem arises for example in solving partial differential equations using an adaptive method that places extra grid points in certain subregions of the domain. We use a binary decomposition of the domain to partition it into rectangles requiring equal computational effort. We then study the communication costs of mapping this partitioning onto different multiprocessors: a mesh- connected array, a tree machine, and a hypercube. The communication cost expressions can be used to determine the optimal depth of the above partitioning.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Adaptive mesh refinement for hyperbolic partial differential equations
Berger, M. J., & Oliger, J. (1984) · Journal of Computational Physics · doi:10.1016/0021-9991(84)90073-1 · Cited by 2,106
Adaptive Mesh Refinement for Hyperbolic Partial Differential Equations
Berger, M. J., & Oliger, J. (1983) · doi:10.21236/ada130162 · Cited by 1,523
GRAPH THEORY WITH APPLICATIONS TO ENGINEERING AND COMPUTER SCIENCE
Deo, N. (1975) · Networks · doi:10.1002/net.1975.5.3.299 · Cited by 1,302
The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer
Gottlieb, Grishman, Kruskal, McAuliffe, Rudolph, & Snir (1983) · IEEE Transactions on Computers · doi:10.1109/tc.1983.1676201 · Cited by 743
Multidimensional divide-and-conquer
Bentley, J. L. (1980) · Communications of the ACM · doi:10.1145/358841.358850 · Cited by 672
Waksman, A. (1968) · Journal of the ACM · doi:10.1145/321439.321449 · Cited by 459
Deo, N. (1974) · Prentice-Hall, Inc eBooks · Cited by 360
Cited by
Thompson, A. P., Aktulga, H. M., Berger, R., Bolintineanu, D. S., Brown, W. M., Crozier, P. S., in 't Veld, P. J., Kohlmeyer, A., Moore, S. G., Nguyen, T. D., et al. (2022) · Computer Physics Communications · doi:10.1016/j.cpc.2021.108171 · Cited by 12,598
VORPAL: a versatile plasma simulation code
Nieter, C., & Cary, J. R. (2004) · Journal of Computational Physics · doi:10.1016/j.jcp.2003.11.004 · Cited by 667
4D MR phase and magnitude segmentations with GPU parallel computing
Bergen, R. V., Lin, H.-Y., Alexander, M. E., & Bidinosti, C. P. (2015) · Magnetic Resonance Imaging · doi:10.1016/j.mri.2014.08.019 · Cited by 11
Metadata
- Authors
- Berger, & Bokhari
- Venue
- IEEE Transactions on Computers
- Published
- 1987-05
- Volume
- C-36
- Issue
- 5
- Pages
- 570-580
- ISSN
- 0018-9340 (ISSN-L)
- 1557-9956
- 2326-3814
- OpenAlex
- W2111516947
- Cited by
- 579
- References
- 7
- FWCI
- 7.73
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Partitioning Strategy for Nonuniform Problems on Multiprocessors. https://app.cochat.ai/papers/10.1109/tc.1987.1676942
- The paper
- Berger, & Bokhari. (1987). A Partitioning Strategy for Nonuniform Problems on Multiprocessors. IEEE Transactions on Computers. https://doi.org/10.1109/tc.1987.1676942
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
