This case baffles me: using StructArrays n, s = 10^5, 100; llp = [rand(1:n,s) for _=1:n]; llw = [rand(-1:0.001:1,s) for _=1:n] function sort_vec!(pp::Vector{tp}, ww::Vector{tw}, by::Function=first) ::Nothing where {tp<:Integer, tw} sort!(StructArray((pp,ww)), by=by, alg=QuickSort) return noth…

If it’s the specialization heuristic, then the official workaround is to introduce a type parameter, say by::F=first and add F or F<:Function to the where clause.

How is it possible that parallelized code causes fewer allocations?

General Usage Performance

abraemer December 30, 2024, 3:12pm 19

Have you seen Finch.jl?

2 Likes

Topic		Replies	Views
Poor performance while multithreading (Julia 1.0) Performance multithreading	28	4013	February 11, 2019
Improving performance elegantly - type stability General Usage type-stability	20	1444	January 13, 2019
Reducing allocations to optimize (to match Java speed) Performance	22	1373	December 10, 2018
Can I make my code faster with parallelism, or just plain better coding? Performance	33	2834	February 19, 2019
Boltzmann Factor in a loop Performance	38	1850	April 3, 2018

How is it possible that parallelized code causes fewer allocations?

Related topics