oarust 0.8.6

GPU-first semantic computing engine written in Rust
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46

// Batched matrix multiplication with right-transposed storage:
// A[N,M,K] @ B[N,P,K]^T = output[N,M,P].

import storage;
import attributes;

struct PushConstants {
	uint left_index;
	uint right_index;
	uint output_index;
	uint batch;
	uint rows;
	uint inner;
	uint columns;
};

[[vk::push_constant]] PushConstants push;
[[vk::binding(0, 0)]] RWByteAddressBuffer storage_buffers[];

[kernel_name("bmm_nt")]
[domain("ml")]
[variant("generic")]
[dtype("f32")]
[status("experimental")]
[shader("compute")]
[numthreads(256, 1, 1)]
void main(uint3 dispatch_thread_id : SV_DispatchThreadID) {
	uint index = dispatch_thread_id.x;
	uint total = push.batch * push.rows * push.columns;
	if (index >= total) {
		return;
	}
	uint matrix_size = push.rows * push.columns;
	uint batch_index = index / matrix_size;
	uint remainder = index - batch_index * matrix_size;
	uint row = remainder / push.columns;
	uint column = remainder - row * push.columns;
	uint left_base = (batch_index * push.rows + row) * push.inner;
	uint right_base = (batch_index * push.columns + column) * push.inner;
	float accumulator = 0.0f;
	for (uint k = 0; k < push.inner; ++k) {
		accumulator += load_f32(storage_buffers[push.left_index], left_base + k)
			* load_f32(storage_buffers[push.right_index], right_base + k);
	}
	store_f32(storage_buffers[push.output_index], index, accumulator);
}