You're looking for indmax. Almost none of the algorithms in Base use parallelism, unless you create special data structures (SharedArrays, DArrays).
--Tim On Saturday, January 03, 2015 07:47:59 AM Pileas wrote: > This may be a very trivial question, but I was wondering if there is an > intrinsic Julia function that finds the location of the maximum in a > vector, something similar to maxloc. And if a function like that exists, is > it made with parallel programming in mind? > > For example find the maximum of v = [1, 25, 89, 6, 8, 63, 7, 569, 8, 55, > 4, 5, 64, 545, 5, 45, 5, 5, 55, 45, 454, 55, 578, 78, 7] > but do it in parallel mode, that is divide the vector in sub-vectors, find > the maximum location in each and eventually return the universal maximum > (because this parallel procedure is faster than searching in the whole > vector per se). > > Thanks
