Et comme la plupart du temps d'exécution est pris par du "vrai" travail (et non de l'attente), et que le travail dans un ordinateur est fait par un <abbr title="Central Processing Unit">CPU</abbr>, ce sont des problèmes dits "CPU bound".

---

Des exemples communs d'opérations "CPU bounds" sont les procédés qui requièrent des traitements mathématiques complexes.

Par exemple :

import org.junit.jupiter.params.ParameterizedTest;
import org.junit.jupiter.params.provider.ValueSource;

/**
 * Unit tests for {@link TransWaitNamedPipeResponse}.
 *
 * The implementation contains only trivial methods that return {@code 0}
 * or construct a string representation.  The tests focus on:
 *
 * <ul>
 *   <li>happy‑path behaviour</li>
 *   <li>boundary arguments (e.g., negative indices, large values)</li>

import org.junit.jupiter.api.DisplayName;
import org.junit.jupiter.api.Test;

import jcifs.smb1.util.Hexdump;

/**
 * Unit test for {@link Trans2QueryFSInformation}. The class contains mostly
 * trivial wire-format helpers and a custom {@code toString()} implementation.
 * All tests are pure unit tests – no network or file system access is
 * required.
 */
class Trans2QueryFSInformationTest {

        assertEquals(4, readLen, "Byte count returned should be 4");
    }

    /* ------------------------------------------------------------------ */
    /* 3. Writing methods - trivial behaviour                           */
    /* ------------------------------------------------------------------ */

    @Test
    @DisplayName("writeParameterWordsWireFormat returns zero bytes written")

     * guaranteed to be either exact or one less than the correct value. This follows from fact that
     * floor(floor(x)/i) == floor(x/i) for any real x and integer i != 0. The proof is not quite
     * trivial.
     */
    long quotient = ((dividend >>> 1) / divisor) << 1;
    long rem = dividend - quotient * divisor;
    return quotient + (compare(rem, divisor) >= 0 ? 1 : 0);
  }

  /**

 * result extraction, header encoding/decoding, and the round-trip of an
 * encode/decode operation.
 */
public class DcerpcMessageTest {

    /**
     * A trivial concrete subclass used for testing. It simply writes a
     * single small value in {@code encode_in} and reads it in
     * {@code decode_out}.
     */
    private static class TestMessage extends DcerpcMessage {

        @Override
        public byte[] calculateMIC(byte[] data) throws CIFSException {
            if (data == null) {
                throw new CIFSException("data is null");
            }
            // Trivial MIC: 1-byte sum of all unsigned bytes
            int sum = 0;
            for (byte b : data) {
                sum = (sum + (b & 0xFF)) & 0xFF;
            }
            return new byte[] { (byte) sum };
        }

	d.maxSleep = maxWait
	d.cycle = make(chan struct{})
	return nil
}

const (
	// ILMExpiry - audit trail for ILM expiry
	ILMExpiry = "ilm:expiry"
	// ILMFreeVersionDelete - audit trail for ILM free-version delete
	ILMFreeVersionDelete = "ilm:free-version-delete"
	// ILMTransition - audit trail for ILM transitioning.
	ILMTransition = " ilm:transition"
)

Nevertheless, as this would mean waiting for the response to travel through the network while unnecessarily holding a resource in a dependency with yield (for example a database connection), this was changed in FastAPI 0.106.0.

/// tip

	// ReplicateQueued - replication being queued trail
	ReplicateQueued = "replicate:queue"

	// ReplicateExisting - audit trail for existing objects replication
	ReplicateExisting = "replicate:existing"
	// ReplicateExistingDelete - audit trail for delete replication triggered for existing delete markers
	ReplicateExistingDelete = "replicate:existing:delete"