Efficient partitioning and scheduling of computer vision and image processing data on bus networks using divisible load analysis
We investigate the data partitioning, distribution, and scheduling problem for minimizing the total processing time of computer vision and image processing (CVIP) data on bus networks. Using the recently evolved divisible load paradigm (DLT) [V. Bharadwaj, D. Ghose, V. Mani, T.G. Robertazzi, Schedul...
Uloženo v:
| Vydáno v: | Image and vision computing Ročník 18; číslo 11; s. 919 - 938 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
01.08.2000
|
| Témata: | |
| ISSN: | 0262-8856 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | We investigate the data partitioning, distribution, and scheduling problem for minimizing the total processing time of computer vision and image processing (CVIP) data on bus networks. Using the recently evolved divisible load paradigm (DLT) [V. Bharadwaj, D. Ghose, V. Mani, T.G. Robertazzi, Scheduling divisible loads in parallel and distributed systems, IEEE Computer Society Press, Los Almitos, California, 1996] for processing loads that are computationally intensive, we design and analyze a scheduler that optimally partitions the CVIP data and assigns it to the processors in the network in such a way that the total processing time is a minimum. In addition to the transmission delay in the network, we consider all the overhead components that penalize the time performance in the problem formulation. With this formulation, we derive closed-form solutions for the optimal processing time when the CVIP data distribution follows a fixed sequence. We then derive a
necessary and sufficient condition for the existence of an optimal processing time. We then prove an
optimal sequence theorem that identifies a sequence that gives rise to an optimal processing time among all possible load distribution sequences, whenever such a sequence of load distribution exists. The performance of the strategy proposed is also analyzed with respect to
speed-up and
processor utilization or efficiency metrics. Several illustrative examples are shown for the ease of understanding. |
|---|---|
| AbstractList | We investigate the data partitioning, distribution, and scheduling problem for minimizing the total processing time of computer vision and image processing (CVIP) data on bus networks. Using the recently evolved divisible load paradigm (DLT) [V. Bharadwaj, D. Ghose, V. Mani, T.G. Robertazzi, Scheduling divisible loads in parallel and distributed systems, IEEE Computer Society Press, Los Almitos, California, 1996] for processing loads that are computationally intensive, we design and analyze a scheduler that optimally partitions the CVIP data and assigns it to the processors in the network in such a way that the total processing time is a minimum. In addition to the transmission delay in the network, we consider all the overhead components that penalize the time performance in the problem formulation. With this formulation, we derive closed-form solutions for the optimal processing time when the CVIP data distribution follows a fixed sequence. We then derive a necessary and sufficient condition for the existence of an optimal processing time. We then prove an optimal sequence theorem that identifies a sequence that gives rise to an optimal processing time among all possible load distribution sequences, whenever such a sequence of load distribution exists. The performance of the strategy proposed is also analyzed with respect to speed-up and processor utilization or efficiency metrics. Several illustrative examples are shown for the ease of understanding. We investigate the data partitioning, distribution, and scheduling problem for minimizing the total processing time of computer vision and image processing (CVIP) data on bus networks. Using the recently evolved divisible load paradigm (DLT) [V. Bharadwaj, D. Ghose, V. Mani, T.G. Robertazzi, Scheduling divisible loads in parallel and distributed systems, IEEE Computer Society Press, Los Almitos, California, 1996] for processing loads that are computationally intensive, we design and analyze a scheduler that optimally partitions the CVIP data and assigns it to the processors in the network in such a way that the total processing time is a minimum. In addition to the transmission delay in the network, we consider all the overhead components that penalize the time performance in the problem formulation. With this formulation, we derive closed-form solutions for the optimal processing time when the CVIP data distribution follows a fixed sequence. We then derive a necessary and sufficient condition for the existence of an optimal processing time. We then prove an optimal sequence theorem that identifies a sequence that gives rise to an optimal processing time among all possible load distribution sequences, whenever such a sequence of load distribution exists. The performance of the strategy proposed is also analyzed with respect to speed-up and processor utilization or efficiency metrics. Several illustrative examples are shown for the ease of understanding. |
| Author | Li, Xiaolin Ko, Chi Chung Bharadwaj, V. |
| Author_xml | – sequence: 1 givenname: V. surname: Bharadwaj fullname: Bharadwaj, V. – sequence: 2 givenname: Xiaolin surname: Li fullname: Li, Xiaolin – sequence: 3 givenname: Chi Chung surname: Ko fullname: Ko, Chi Chung |
| BookMark | eNqFkT1rHDEQhlVcwJ8_IaAqJMXGWu2HtLgIwTh2wJDCTi1mtaOL7L3VWaO1ceefbu1dSJHGlZDe9xmGR0dsNYUJGftYiq-lKNuzWyFbWWjdtJ-77osQQjeFXLHDf88H7IjoPgdKqO6QvV46563HKfEtxOSTD5Of1hymgZP9g8M8LtfguA2b7Zww8idPubRr-A2skW9jsEi09AZIwHPYz8QnTM8hPhCf95FfwH5EPgYYMg7jC3k6YR8cjISnf89j9vvH5d3FdXHz6-rnxfebwla6SYW2GnTdawGdtJ1yra5dpYYKVV2CLWuptBB9L6SC0mGtnbZdjbLFHnrQrqyO2af93Lzt44yUzMaTxXGECcNMRqpGiEqJXDzfF20MRBGdsT7B4iVF8KMphVlMm51psyg1XWd2po3MdPMfvY3ZUnx5l_u25zA7ePIYDS2_YnHwEW0yQ_DvTHgDMFedkA |
| CitedBy_id | crossref_primary_10_1016_S0378_4754_01_00329_9 crossref_primary_10_1016_j_procs_2017_12_119 crossref_primary_10_1002_cpe_5498 crossref_primary_10_1080_1206212X_2003_11441695 crossref_primary_10_1109_TPDS_2014_2362137 crossref_primary_10_1155_2014_460354 crossref_primary_10_1016_j_mcm_2004_01_004 crossref_primary_10_1016_j_future_2015_03_015 crossref_primary_10_1016_S0262_8856_02_00090_2 crossref_primary_10_1109_TVLSI_2006_884052 crossref_primary_10_1007_s10586_018_2207_y crossref_primary_10_1016_j_asoc_2014_07_021 crossref_primary_10_1007_s42044_020_00079_7 crossref_primary_10_1016_j_comnet_2022_109483 crossref_primary_10_1016_j_parco_2004_06_002 crossref_primary_10_1109_TAES_2011_5751227 crossref_primary_10_1016_j_jpdc_2005_05_016 |
| Cites_doi | 10.1109/2.121475 10.1137/0909037 10.1016/0167-8655(87)90002-X 10.1109/71.242154 10.1109/7.18637 10.1109/7.381944 10.1006/cviu.1998.0638 10.1109/TC.1982.1675976 10.1109/88.481664 10.1109/34.735814 |
| ContentType | Journal Article |
| Copyright | 2000 Elsevier Science B.V. |
| Copyright_xml | – notice: 2000 Elsevier Science B.V. |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/S0262-8856(99)00085-2 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Applied Sciences Engineering |
| EndPage | 938 |
| ExternalDocumentID | 10_1016_S0262_8856_99_00085_2 S0262885699000852 |
| GroupedDBID | --K --M .~1 0R~ 1B1 1~. 1~5 29I 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AABNK AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AATTM AAXKI AAXUO AAYFN AAYWO ABBOA ABDPE ABFNM ABFRF ABJNI ABMAC ABOCM ABWVN ABXDB ACDAQ ACGFO ACGFS ACNNM ACRLP ACRPL ACVFH ACZNC ADBBV ADCNI ADEZE ADJOM ADMUD ADNMO ADTZH AEBSH AECPX AEFWE AEIPS AEKER AENEX AEUPX AFJKZ AFPUW AFTJW AFXIZ AGCQF AGHFR AGQPQ AGRNS AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIGII AIIUN AIKHN AITUG AKBMS AKRWK AKYEP ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOUOD APXCP ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC BNPGV CS3 DU5 EBS EFJIC EFKBS EJD EO8 EO9 EP2 EP3 F0J F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HLZ HVGLF HZ~ IHE J1W JJJVA KOM LG9 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG RNS ROL RPZ SBC SDF SDG SDP SES SEW SPC SPCBC SSH SST SSV SSZ T5K TN5 UHS UNMZH VOH WUQ XPP ZMT ZY4 ~G- 9DU AAYXX ACLOT CITATION EFLBG ~HD 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c385t-8c8a84b80a92c97f684f37d3e741ac1427800bb027a1fe48f8c94e26ebaba8f13 |
| ISICitedReferencesCount | 31 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000088412200004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0262-8856 |
| IngestDate | Sat Sep 27 23:17:23 EDT 2025 Sat Nov 29 01:53:22 EST 2025 Tue Nov 18 22:19:36 EST 2025 Thu Jul 17 02:00:01 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 11 |
| Keywords | Computer vision data Data partitioning Bus networks Image processing Communication delays Divisible loads |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c385t-8c8a84b80a92c97f684f37d3e741ac1427800bb027a1fe48f8c94e26ebaba8f13 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| OpenAccessLink | http://scholarbank.nus.edu.sg/handle/10635/43012 |
| PQID | 27500370 |
| PQPubID | 23500 |
| PageCount | 20 |
| ParticipantIDs | proquest_miscellaneous_27500370 crossref_citationtrail_10_1016_S0262_8856_99_00085_2 crossref_primary_10_1016_S0262_8856_99_00085_2 elsevier_sciencedirect_doi_10_1016_S0262_8856_99_00085_2 |
| PublicationCentury | 2000 |
| PublicationDate | 2000-08-01 |
| PublicationDateYYYYMMDD | 2000-08-01 |
| PublicationDate_xml | – month: 08 year: 2000 text: 2000-08-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationTitle | Image and vision computing |
| PublicationYear | 2000 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Tsai, Horng, Tsai, Lee, Kao, Chen (BIB8) 1998; 71 C. Lee, Y.-F. Wang, T. Yang, Static global scheduling for optimal computer vision and image processing operations on distributed-memory multiprocessors, TRC 94-23, University of California, Santa Barbara, 1994. Bharadwaj, Ghose, Mani, Robertazzi (BIB9) 1996 Chung, Prasanna (BIB1) 1998; 20 T.H. Dunigan, Performance of a Second Generation Hypercube, ORNL/TM-10 881, Oak Ridge National Laboratory, TN, 1988. Siegel, Armstrong, Watson (BIB3) 1992; 25 Siegel, Siegel, Feather (BIB7) 1982; 31 Bertsekas, Tsitsiklis (BIB4) 1989 Gerasoulis, Yang (BIB10) 1993; 4 D.A. Bader, J. JáJá, D. Harwood, L.S. Davis, Parallel algorithms for image enhancement and segmentation by region growing with an experimental study, TR, University of Maryland, College Park, 1995. Cheng, Robertazzi (BIB14) 1988; 24 Koelbel, Loveman, Schreiber, Steele, Zosel (BIB16) 1994 Sahni, Thanvantri (BIB17) 1996; Spring Sarkar, Hennessy (BIB11) 1986 Bharadwaj, Ghose, Mani (BIB15) 1995; 31 Harwood, Subbarao, Hakalahti, Davis (BIB18) 1987; 6 C. Lee, Y.-F. Wang, T. Yang, Global optimization for mapping parallel image processing tasks on distributed-memory multiprocessors, TRCS 96-28, University of California, Santa Barbara, 1996. Heath, Romine (BIB13) 1988; 9 Chung (10.1016/S0262-8856(99)00085-2_BIB1) 1998; 20 Bertsekas (10.1016/S0262-8856(99)00085-2_BIB4) 1989 Gerasoulis (10.1016/S0262-8856(99)00085-2_BIB10) 1993; 4 Siegel (10.1016/S0262-8856(99)00085-2_BIB3) 1992; 25 10.1016/S0262-8856(99)00085-2_BIB12 10.1016/S0262-8856(99)00085-2_BIB2 Siegel (10.1016/S0262-8856(99)00085-2_BIB7) 1982; 31 Harwood (10.1016/S0262-8856(99)00085-2_BIB18) 1987; 6 Tsai (10.1016/S0262-8856(99)00085-2_BIB8) 1998; 71 Bharadwaj (10.1016/S0262-8856(99)00085-2_BIB9) 1996 Cheng (10.1016/S0262-8856(99)00085-2_BIB14) 1988; 24 Koelbel (10.1016/S0262-8856(99)00085-2_BIB16) 1994 10.1016/S0262-8856(99)00085-2_BIB5 Sarkar (10.1016/S0262-8856(99)00085-2_BIB11) 1986 Sahni (10.1016/S0262-8856(99)00085-2_BIB17) 1996; Spring 10.1016/S0262-8856(99)00085-2_BIB6 Heath (10.1016/S0262-8856(99)00085-2_BIB13) 1988; 9 Bharadwaj (10.1016/S0262-8856(99)00085-2_BIB15) 1995; 31 |
| References_xml | – volume: 4 start-page: 66 year: 1993 end-page: 701 ident: BIB10 article-title: On the granularity and clustering of directed acyclic task graphs publication-title: IEEE Transactions on Parallel and Distributed Systems – volume: 71 start-page: 393 year: 1998 end-page: 412 ident: BIB8 article-title: Optimal speed-up parallel image template matching algorithms on processor arrays with a reconfigurable bus system publication-title: Computer Vision and Image Understanding – year: 1996 ident: BIB9 publication-title: Scheduling Divisible Loads in Parallel and Distributed Systems – reference: C. Lee, Y.-F. Wang, T. Yang, Global optimization for mapping parallel image processing tasks on distributed-memory multiprocessors, TRCS 96-28, University of California, Santa Barbara, 1996. – year: 1989 ident: BIB4 publication-title: Parallel and Distributed Computation: Numerical Methods – reference: C. Lee, Y.-F. Wang, T. Yang, Static global scheduling for optimal computer vision and image processing operations on distributed-memory multiprocessors, TRC 94-23, University of California, Santa Barbara, 1994. – reference: T.H. Dunigan, Performance of a Second Generation Hypercube, ORNL/TM-10 881, Oak Ridge National Laboratory, TN, 1988. – year: 1994 ident: BIB16 publication-title: The High Performance Fortran Handbook – volume: 20 start-page: 1389 year: 1998 end-page: 1998 ident: BIB1 article-title: Parallelizing image feature extraction on coarse-grain machines publication-title: IEEE Transactions on Pattern Analysis and Machine Intelligence – volume: 31 start-page: 555 year: 1995 end-page: 567 ident: BIB15 article-title: Multi-installment load distribution in tree networks with delays publication-title: IEEE Transactions on Aerospace and Electronic Systems – reference: D.A. Bader, J. JáJá, D. Harwood, L.S. Davis, Parallel algorithms for image enhancement and segmentation by region growing with an experimental study, TR, University of Maryland, College Park, 1995. – year: 1986 ident: BIB11 publication-title: Compile-time partitioning and scheduling of parallel programs – volume: 6 start-page: 155 year: 1987 end-page: 162 ident: BIB18 article-title: A new class of edge-preserving smoothing filters publication-title: Pattern Recognition Letters – volume: 31 start-page: 208 year: 1982 end-page: 218 ident: BIB7 article-title: Parallel processing approaches to image correlation publication-title: IEEE Transactions on Computers – volume: Spring start-page: 43 year: 1996 end-page: 56 ident: BIB17 article-title: Performance metrics: keeping the focus on runtime publication-title: IEEE Parallel and Distributed Technology – volume: 25 start-page: 54 year: 1992 end-page: 63 ident: BIB3 article-title: Mapping computer-vision-related tasks onto reconfigurable parallel-processing systems publication-title: IEEE Computer – volume: 9 start-page: 558 year: 1988 end-page: 588 ident: BIB13 article-title: Parallel solution of triangular systems on distributed memory multiprocessors publication-title: SIAM Journal of Science, Statistics and Computers – volume: 24 start-page: 700 year: 1988 end-page: 712 ident: BIB14 article-title: Distributed computation with communication delays publication-title: IEEE Transactions on Aerospace and Electronic Systems – volume: 25 start-page: 54 issue: 2 year: 1992 ident: 10.1016/S0262-8856(99)00085-2_BIB3 article-title: Mapping computer-vision-related tasks onto reconfigurable parallel-processing systems publication-title: IEEE Computer doi: 10.1109/2.121475 – volume: 9 start-page: 558 year: 1988 ident: 10.1016/S0262-8856(99)00085-2_BIB13 article-title: Parallel solution of triangular systems on distributed memory multiprocessors publication-title: SIAM Journal of Science, Statistics and Computers doi: 10.1137/0909037 – volume: 6 start-page: 155 year: 1987 ident: 10.1016/S0262-8856(99)00085-2_BIB18 article-title: A new class of edge-preserving smoothing filters publication-title: Pattern Recognition Letters doi: 10.1016/0167-8655(87)90002-X – volume: 4 start-page: 66 issue: 6 year: 1993 ident: 10.1016/S0262-8856(99)00085-2_BIB10 article-title: On the granularity and clustering of directed acyclic task graphs publication-title: IEEE Transactions on Parallel and Distributed Systems doi: 10.1109/71.242154 – ident: 10.1016/S0262-8856(99)00085-2_BIB12 – volume: 24 start-page: 700 year: 1988 ident: 10.1016/S0262-8856(99)00085-2_BIB14 article-title: Distributed computation with communication delays publication-title: IEEE Transactions on Aerospace and Electronic Systems doi: 10.1109/7.18637 – year: 1996 ident: 10.1016/S0262-8856(99)00085-2_BIB9 – volume: 31 start-page: 555 year: 1995 ident: 10.1016/S0262-8856(99)00085-2_BIB15 article-title: Multi-installment load distribution in tree networks with delays publication-title: IEEE Transactions on Aerospace and Electronic Systems doi: 10.1109/7.381944 – volume: 71 start-page: 393 issue: 3 year: 1998 ident: 10.1016/S0262-8856(99)00085-2_BIB8 article-title: Optimal speed-up parallel image template matching algorithms on processor arrays with a reconfigurable bus system publication-title: Computer Vision and Image Understanding doi: 10.1006/cviu.1998.0638 – year: 1986 ident: 10.1016/S0262-8856(99)00085-2_BIB11 – volume: 31 start-page: 208 issue: 3 year: 1982 ident: 10.1016/S0262-8856(99)00085-2_BIB7 article-title: Parallel processing approaches to image correlation publication-title: IEEE Transactions on Computers doi: 10.1109/TC.1982.1675976 – year: 1989 ident: 10.1016/S0262-8856(99)00085-2_BIB4 – year: 1994 ident: 10.1016/S0262-8856(99)00085-2_BIB16 – volume: Spring start-page: 43 year: 1996 ident: 10.1016/S0262-8856(99)00085-2_BIB17 article-title: Performance metrics: keeping the focus on runtime publication-title: IEEE Parallel and Distributed Technology doi: 10.1109/88.481664 – ident: 10.1016/S0262-8856(99)00085-2_BIB2 – ident: 10.1016/S0262-8856(99)00085-2_BIB5 – volume: 20 start-page: 1389 issue: 12 year: 1998 ident: 10.1016/S0262-8856(99)00085-2_BIB1 article-title: Parallelizing image feature extraction on coarse-grain machines publication-title: IEEE Transactions on Pattern Analysis and Machine Intelligence doi: 10.1109/34.735814 – ident: 10.1016/S0262-8856(99)00085-2_BIB6 |
| SSID | ssj0007079 |
| Score | 1.7692689 |
| Snippet | We investigate the data partitioning, distribution, and scheduling problem for minimizing the total processing time of computer vision and image processing... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 919 |
| SubjectTerms | Bus networks Communication delays Computer vision data Data partitioning Divisible loads Image processing |
| Title | Efficient partitioning and scheduling of computer vision and image processing data on bus networks using divisible load analysis |
| URI | https://dx.doi.org/10.1016/S0262-8856(99)00085-2 https://www.proquest.com/docview/27500370 |
| Volume | 18 |
| WOSCitedRecordID | wos000088412200004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: ScienceDirect issn: 0262-8856 databaseCode: AIEXJ dateStart: 19950201 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0007079 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLZKxwM8cBkgxtUPDIGmgJtLYz9OqBNDVUGik_pm2Y6tFZU0rM3YI_-Av4xPbCcdEyo88NCoim9Svi_HJ8fngtALbcVimg9ZVGhColSZLGJS5Pa9UlIYFotcy6bYRD6Z0NmMfer1foZYmPNFXpb04oJV_xVqe8-CDaGz_wB3O6m9Yf9b0O3Vwm6vfwX8qEkKAUf8FbQGg2tjILcIFfXCOzorX9DhwMWXu2OEr-DDU7noAegHHqRwoCAhkatzGV8d1K5pDgMh8mqxFJDx1aU32VR3j5vpYGK_hlszbJdgBoCE0cV38eWSw-248TGYzQWUFGr3BGfVPZ3bX-1nCPaKzlsuiLV4aGUwdenEr8rgOsSheInKvER1mzNzqWCuyH1ngvjczr0P35H7MWtUSh9feSnX9uQjPzoZj_l0NJu-rL5FUIYMjut9TZZraCfOM0b7aOfweDT70G7ukFDQme3cQl1Q2Ntu9VeMvfYr_0nd-W3jb7SZ6R10y3-G4ENHn7uop8tddNt_kmAv8Fe76OZGvsp76EfLLbzJLWwBxh238NLgwC3scG96NNzCHbcwcAvbRsstHLiFa9cUuIWBWzhw6z46ORpN372PfAmPSCU0W0dUUUFTSYlgsWK5GdLUJHmRaKvICjWAOi-ESEniXAyMTqmhiqU6HmoppKBmkDxA_XJZ6ocIJybTaSKIpNR21BmDGYliklFjSJHuoTQ8aa58fnsos7LgnSOjBYgDQJwx3gDE4z30ph1WuQQv2wbQACP3WqrTPrkl47ahzwPs3EpxOJoTpV7WKw5VFkiSk0dbezxGN7q36gnqr89q_RRdV-fr-ersmafrL0vqvsU |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Efficient+partitioning+and+scheduling+of+computer+vision+and+image+processing+data+on+bus+networks+using+divisible+load+analysis&rft.jtitle=Image+and+vision+computing&rft.au=Bharadwaj%2C+V&rft.au=Li%2C+Xiaolin&rft.au=Ko%2C+Chi+Chung&rft.date=2000-08-01&rft.issn=0262-8856&rft.volume=18&rft.issue=11&rft.spage=919&rft.epage=938&rft_id=info:doi/10.1016%2FS0262-8856%2899%2900085-2&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0262-8856&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0262-8856&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0262-8856&client=summon |