Skip to content

Commit 11185c2

Browse files
committed
spellcheck
1 parent a83b455 commit 11185c2

1 file changed

Lines changed: 7 additions & 7 deletions

File tree

docs/src/tutorial.md

Lines changed: 7 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -54,7 +54,7 @@ UndefValError: x not defined
5454

5555
`DiDa` uses *quoting* to allow you to precisely specify the parts of the code
5656
that should be evaluated on the "main" Julia process (the one you interact
57-
with), and the code that shold be evaluated on the remote workers. Basically,
57+
with), and the code that should be evaluated on the remote workers. Basically,
5858
all quoted code is going to get to the workers without any evaluation; all
5959
other code is evaluated on the main node.
6060

@@ -144,7 +144,7 @@ The simplest way to prevent such data races is to `fetch` the future returned
144144
from `save_at`, which correctly waits until the result is properly available on
145145
the target worker.
146146

147-
This *synchronization is not performed by default*, because the non-syncronized
147+
This *synchronization is not performed by default*, because the non-synchronized
148148
behavior allows you to very easily implement parallelism. In particular, you
149149
may start multiple asynchronous computations at once, and then wait for all of
150150
them to complete to make sure all results are available. Because the operations
@@ -171,7 +171,7 @@ nothing
171171
172172
```
173173

174-
The same is applicable for retrieving the sub-results parallelly. This example
174+
The same is applicable for retrieving the sub-results in parallel. This example
175175
demonstrates that multiple workers can do some work at the same time:
176176

177177
```julia
@@ -186,7 +186,7 @@ julia> @time fetch.([get_from(i, :(begin sleep(1); myid(); end))
186186

187187
Notably, you can even send individual `Future`s to other workers, allowing the
188188
workers to synchronize and transfer the data among each other. This is
189-
beneficial for implementing advanced parallel algoritms.
189+
beneficial for implementing advanced parallel algorithms.
190190

191191
### `Dinfo` handles
192192

@@ -198,7 +198,7 @@ functions are able to work with `Dinfo` transparently, instead of the "raw"
198198
symbols and worker lists.
199199

200200
For example, you can use [`scatter_array`](@ref) to automatically separate the
201-
array-like dataset to roughly-same pieces scattered accross multiple workers,
201+
array-like dataset to roughly-same pieces scattered across multiple workers,
202202
and obtain the `Dinfo` object:
203203
```julia
204204
julia> dataset = scatter_array(:myData, randn(1000,3), workers())
@@ -394,13 +394,13 @@ are applicable in many other areas of data analysis:
394394
the same matrix, the data groups are specified by a distributed integer
395395
vector (This is useful e.g. for computing per-cluster statistics, in which
396396
case the integer vector should assign individual data entries to clusters.)
397-
- [`dcount`](@ref) counts the numbers of ocurrences of items in an integer
397+
- [`dcount`](@ref) counts the numbers of occurrences of items in an integer
398398
vector, similar to e.g. R function `tabulate`
399399
- [`dcount_buckets`](@ref) does the same per groups
400400
- [`dscale`](@ref) scales the selected columns to mean 0 and standard deviation
401401
1
402402
- [`dmedian`](@ref) computes a median of the selected columns of the dataset
403-
(The computation is done using an approximative iterative algorithm in time
403+
(The computation is done using an approximate iterative algorithm in time
404404
`O(n*iters)`, which scales even to really large datasets. The precision of
405405
the result increases by roughly 1 bit per iteration, the default is 20
406406
iterations.)

0 commit comments

Comments
 (0)