메뉴 건너뛰기




Volumn 6347 LNCS, Issue PART 2, 2010, Pages 75-86

Geometric algorithms for private-cache chip multiprocessors (extended abstract)

Author keywords

[No Author keywords available]

Indexed keywords

CACHE CHIPS; CONVEX HULL; EFFICIENT ALGORITHM; EXTENDED ABSTRACTS; GEOMETRIC ALGORITHM; GEOMETRIC PROBLEMS; LINE SEGMENT INTERSECTION; LOAD BALANCING STRATEGY; LOWER ENVELOPES; MERGE-SORT ALGORITHM; OPTIMAL ALGORITHM; PARALLEL DISTRIBUTION; PRAM ALGORITHMS; SECOND GROUP;

EID: 78349263882     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15781-3_7     Document Type: Conference Paper
Times cited : (13)

References (21)
  • 1
    • 0024082546 scopus 로고
    • INPUT/OUTPUT COMPLEXITY of SORTING and RELATED PROBLEMS
    • DOI 10.1145/48529.48535
    • Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Communications of the ACM 31(9), 1116-1127 (1988) (Pubitemid 18662481)
    • (1988) Communications of the ACM , vol.31 , Issue.9 , pp. 1116-1127
    • Aggarwal, A.1    Vitter, J.S.2
  • 2
    • 57349105595 scopus 로고    scopus 로고
    • Fundamental parallel algorithms for private-cache chip multiprocessors
    • Arge, L., Goodrich, M.T., Nelson, M.J., Sitchinava, N.: Fundamental parallel algorithms for private-cache chip multiprocessors. In: SPAA, pp. 197-206 (2008)
    • (2008) SPAA , pp. 197-206
    • Arge, L.1    Goodrich, M.T.2    Nelson, M.J.3    Sitchinava, N.4
  • 3
  • 4
    • 57749174818 scopus 로고    scopus 로고
    • Cache-oblivious red-blue line segment intersection
    • Halperin, D., Mehlhorn, K. (eds.) ESA 2008. Springer, Heidelberg
    • Arge, L., Mølhave, T., Zeh, N.: Cache-oblivious red-blue line segment intersection. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 88-99. Springer, Heidelberg (2008)
    • (2008) LNCS , vol.5193 , pp. 88-99
    • Arge, L.1    Mølhave, T.2    Zeh, N.3
  • 5
    • 0024681436 scopus 로고
    • Cascading divide-and-conquer: A technique for designing parallel algorithms
    • Atallah, M.J., Cole, R., Goodrich, M.T.: Cascading divide-and-conquer: A technique for designing parallel algorithms. SIAM J. Comp. 18(3), 499-532 (1989)
    • (1989) SIAM J. Comp. , vol.18 , Issue.3 , pp. 499-532
    • Atallah, M.J.1    Cole, R.2    Goodrich, M.T.3
  • 6
    • 78349257287 scopus 로고
    • Efficient plane sweeping in parallel
    • Atallah, M.J., Goodrich, M.T.: Efficient plane sweeping in parallel. In: SOCG, pp. 216-225 (1986)
    • (1986) SOCG , pp. 216-225
    • Atallah, M.J.1    Goodrich, M.T.2
  • 7
    • 0023833316 scopus 로고
    • Parallel algorithms for some functions of two convex polygons
    • Atallah, M.J., Goodrich, M.T.: Parallel algorithms for some functions of two convex polygons. Algorithmica 3, 535-548 (1988)
    • (1988) Algorithmica , vol.3 , pp. 535-548
    • Atallah, M.J.1    Goodrich, M.T.2
  • 10
    • 84869191441 scopus 로고    scopus 로고
    • Cache oblivious distribution sweeping
    • Widmayer, P., Ruiz, F.T., Bueno, R.M., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. Springer, Heidelberg
    • Brodal, G.S., Fagerberg, R.: Cache oblivious distribution sweeping. In: Widmayer, P., Ruiz, F.T., Bueno, R.M., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 426-438. Springer, Heidelberg (2002)
    • (2002) LNCS , vol.2380 , pp. 426-438
    • Brodal, G.S.1    Fagerberg, R.2
  • 11
    • 35248831668 scopus 로고    scopus 로고
    • The cache-oblivious gaussian elimination paradigm: Theoretical framework, parallelization and experimental evaluation
    • Chowdhury, R.A., Ramachandran, V.: The cache-oblivious gaussian elimination paradigm: Theoretical framework, parallelization and experimental evaluation. In: SPAA, pp. 71-80 (2007)
    • (2007) SPAA , pp. 71-80
    • Chowdhury, R.A.1    Ramachandran, V.2
  • 12
    • 57349161938 scopus 로고    scopus 로고
    • Cache-efficient dynamic programming for multicores
    • Chowdhury, R.A., Ramachandran, V.: Cache-efficient dynamic programming for multicores. In: SPAA, pp. 207-216 (2008)
    • (2008) SPAA , pp. 207-216
    • Chowdhury, R.A.1    Ramachandran, V.2
  • 14
    • 78349275590 scopus 로고
    • Efficient parallel algorithms for geometric partitioning problems through parallel range searching
    • Datta, A.: Efficient parallel algorithms for geometric partitioning problems through parallel range searching. In: ICPP, pp. 202-209 (1994)
    • (1994) ICPP , pp. 202-209
    • Datta, A.1
  • 15
    • 0027794853 scopus 로고
    • Scalable parallel geometric algorithms for coarse grained multicomputers
    • Dehne, F., Fabri, A., Rau-Chaplin, A.: Scalable parallel geometric algorithms for coarse grained multicomputers. In: SOCG, pp. 298-307 (1993)
    • (1993) SOCG , pp. 298-307
    • Dehne, F.1    Fabri, A.2    Rau-Chaplin, A.3
  • 18
    • 0026206952 scopus 로고
    • Intersecting line segments in parallel with an output-sensitive number of processors
    • Goodrich, M.T.: Intersecting line segments in parallel with an output-sensitive number of processors. SIAM J. Comp. 20(4), 737-755 (1991)
    • (1991) SIAM J. Comp. , vol.20 , Issue.4 , pp. 737-755
    • Goodrich, M.T.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.