io - Term for an algorithm that works in a distributed or sequential fashion -


i working on algorithm subdivides large data problem , performs work on across many nodes. local solution each subdivision of problem can modified match global solution if each subdivision knows limited amount of information subdivisions around it.

this can achieved through fixed number of communications between each subdivision, allowing embarrassingly parallel solution.

an up-shot, however, that, problem performed on single core, each piece of data need loaded fixed number of times, regardless of size of problem, reach solution.

thus, algorithm parallelizes nicely, allowing fast solutions on supercomputers there sufficient nodes hold of data in memory @ once, permits large datasets processed limited resources loading data disk fixed number of times.

is there standard word or phrase denotes such algorithm has property?

the theoretical description of problem might complexity lies in nc, , particularly very-low-order subset of nc c = 0 , k = 1


Comments

Popular posts from this blog

java - nested exception is org.hibernate.exception.SQLGrammarException: could not extract ResultSet Hibernate+SpringMVC -

sql - Postgresql tables exists, but getting "relation does not exist" when querying -

asp.net mvc - breakpoint on javascript in CSHTML? -