article · 2015

Massively Parallel Communication

Dan Suciu, Main Cost Disk I/o, Main Cost Communication, No Skew, Server Server P, Server Server P, Server Server P, Server Server P, Server Server P

Cited by 0Abstract and details only

Abstract

• How much communication is needed to solve a “problem ” on p servers? • This talk: define a parallel model (MPC) and analyze the communication cost for full conjunctive queries • Why Highlights of Logic? Queries + parallel processing + communication complexity References:

Cite this paper

APA 7

Suciu, D., I/o, M. C. D., Communication, M. C., Skew, N., P, S. S., P, S. S., P, S. S., P, S. S., & P, S. S. (2015). Massively Parallel Communication.

MLA 9

Suciu, Dan, et al. “Massively Parallel Communication.” 2015.

Chicago

Suciu, Dan, Main Cost Disk I/o, Main Cost Communication, No Skew, Server Server P, Server Server P, Server Server P, Server Server P, and Server Server P. 2015. “Massively Parallel Communication.”

Harvard

Suciu, D. et al. (2015) ‘Massively Parallel Communication’.

BibTeX

@article{suciu2015massively,
  title = {{Massively Parallel Communication}},
  author = {Suciu, Dan and I/o, Main Cost Disk and Communication, Main Cost and Skew, No and P, Server Server and P, Server Server and P, Server Server and P, Server Server and P, Server Server},
  year = {2015}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.