And as most of the execution time is taken by actual work (instead of waiting), and the work in a computer is done by a <abbr title="Central Processing Unit">CPU</abbr>, they call these problems "CPU bound".

---

Common examples of CPU bound operations are things that require complex math processing.

For example:

* **Audio** or **image processing**.

        DefaultProblemCollector collector = new DefaultProblemCollector(null);

        collector.add(null, "PROBLEM1", -1, -1, null);

        collector.setSource("SOURCE_PROBLEM2");
        collector.add(null, "PROBLEM2", -1, -1, null);

        collector.setSource("SOURCE_PROBLEM3");
        collector.add(null, "PROBLEM3", -1, -1, null);

        assertEquals("", collector.getProblems().get(0).getSource());

    Set<List<Integer>> degenerate = cartesianProduct();
    checkHashCode(degenerate);

    checkHashCode(cartesianProduct(set(1, 2)));

    int num = Integer.MAX_VALUE / 3 * 2; // tickle overflow-related problems
    checkHashCode(cartesianProduct(set(1, 2, num)));

    Set<Integer> mt = emptySet();
    checkHashCode(cartesianProduct(mt, mt));
    checkHashCode(cartesianProduct(mt, set(num)));

	})

	// Verify kernel release and version.
	if oldLinux() {
		warnings = append(warnings, color.YellowBold("Detected Linux kernel version older than 4.0 release, there are some known potential performance problems with this kernel version. MinIO recommends a minimum of 4.x linux kernel version for best performance"))
	}

	maxProcs := runtime.GOMAXPROCS(0)
	cpuProcs := runtime.NumCPU()
	if maxProcs < cpuProcs {

    /**
     * Cuts this string up into alternating parameter names and values. This divides a query string
     * like `subject=math&easy&problem=5-2=3` into the list `["subject", "math", "easy", null,
     * "problem", "5-2=3"]`. Note that values may be null and may contain '=' characters.
     */
    private fun String.toQueryNamesAndValues(): MutableList<String?> {

     */
    Exception getException();

    /**
     * Gets the message that describes this problem.
     *
     * @return The message describing this problem, never {@code null}.
     */
    String getMessage();

    /**
     * Gets the severity level of this problem.
     *
     * @return The severity level of this problem, never {@code null}.
     */

	// can easily eat into the internode bandwidth. This function would be mostly
	// TX saturating, however there are situations where a RX might also saturate.
	// To avoid these problems we must split the work at scale. With 1000 node
	// setup becoming a reality we must try to shard the work properly such as
	// pick 10 nodes that precisely can send those 100 requests the first node

    They may also be fired in cases where no event was published previously. In this release we did
    an internal rewrite of our event code to fix problems where events were lost or unbalanced.

 *  Fix: Don't leak a connection when a call is canceled immediately preceding the `onFailure()`
    callback.

      Class<X> exceptionType, ClosingFunction<? super X, ? extends V> fallback, Executor executor) {
    return catchingMoreGeneric(exceptionType, fallback, executor);
  }

  // Avoids generic type capture inconsistency problems where |? extends V| is incompatible with V.
  private <X extends Throwable, W extends V> ClosingFuture<V> catchingMoreGeneric(
      Class<X> exceptionType, ClosingFunction<? super X, W> fallback, Executor executor) {

* Jeśli nie rozumiesz pytania, poproś o więcej **szczegółów**.

### Odtwórz problem

W większości przypadków problem wynika z **autorskiego kodu** osoby pytającej.

Często pytający umieszczają tylko fragment kodu, niewystarczający do **odtworzenia problemu**.