Parallel database systems aim to process queries quickly and efficiently. Shared nothing systems are commonly used for this purpose. Previous studies on parallel query processing have assumed ideal conditions, but our research shows that dynamic load balancing strategies are needed for efficient join processing in multi-user mode. By considering current resource usage and intermediate result sizes, simple dynamic scheduling strategies outperform static ones significantly.