cpursley

PostgreSQL is Enough

• Simplify: move code into database functions
• Just Use Postgres for Everything
• PostgreSQL is the worlds’ best database
• Postgres is eating the database world
• Hacker News discussion

Background and Cron Jobs

gkaerts

// This file should be compiled with DXC against shader model 6.6
// Change the TARGET_API define here to either D3D or VK and switch compiler output formats (DXIL or SPIR-V) to match
#define D3D 1
#define VK 2
#define TARGET_API D3D

// Begin macro magic
#if TARGET_API == D3D

    // No special root signature needed!

silvesthu

GPU Optimization for GameDev

Graphics Pipeline / GPU Architecture Overview

• 2011 - A trip through the Graphics Pipeline 2011
• 2015 - Life of a triangle - NVIDIA's logical pipeline
• 2015 - Render Hell 2.0
• 2016 - How bad are small triangles on GPU and why?
• 2017 - GPU Performance for Game Artists
• 2019 - Understanding the anatomy of GPUs using Pokémon
• 2020 - GPU ARCHITECTURE RESOURCES

rkbalgi

In your effort of implementing standalone-ha with keycloak postgresql using JDBC_PING you will stumble upon many sites that define 
the table structure for jgroupsping and the right one goes like this -

CREATE TABLE IF NOT EXISTS JGROUPSPING (
                   own_addr varchar(200) NOT NULL,
                   cluster_name varchar(200) NOT NULL,
                   ping_data BYTEA,
                   constraint PK_JGROUPSPING PRIMARY KEY (own_addr, cluster_name)
                   );

jFransham

Achieving warp speed with Rust

Contents:

• Number one optimization tip: don't
• Never optimize blindly
• Don't bother optimizing one-time costs
• Improve your algorithms
• CPU architecture primer
• Keep as much as possible in cache
• Keep as much as possible in registers

kottenator

// Implementation in ES6
function pagination(c, m) {
    var current = c,
        last = m,
        delta = 2,
        left = current - delta,
        right = current + delta + 1,
        range = [],
        rangeWithDots = [],
        l;

CMCDragonkai

Notes

It should be noted that:

1. Basic blocks in SSA can be identified at 3 points:

• Start of the program
• Labels
• Branches

2. Basic blocks are used in optimisation.

paniq

max(-x,-y) = -min(x,y)
min(-x,-y) = -max(x,y)

abs(x) = abs(-x)
abs(x) = max(x,-x) = -min(x,-x)
abs(x*a) = if (a >= 0) abs(x)*a
              (a <  0) -abs(x)*a

// basically any commutative operation
min(x,y) + max(x,y) = x + y