labels.ignoreFailureType=Ignorierter Fehlertyp
labels.lastAccessTime=Letzte Zugriffszeit
labels.notificationTo=Benachrichtigung an
labels.num=Anzahl
labels.pn=Seitennummer
labels.protocolScheme=Schema
labels.purgeByBots=Bots löschen
labels.logLevel=Protokollebene
labels.purgeSearchLogDay=Suchprotokoll löschen
labels.query=Abfrage
labels.queryId=Abfrage-ID
labels.rt=rt
labels.searchLog=Suchprotokoll
labels.sort=Sortieren

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 :

* Traitements d'**audio** et d'**images**.

labels.ignoreFailureType=Ignored Failure Type
labels.lastAccessTime=Last Access Time
labels.notificationTo=Notification To
labels.num=Num
labels.pn=Page Number
labels.protocolScheme=Scheme
labels.purgeByBots=Purge Bots
labels.logLevel=Log Level
labels.purgeSearchLogDay=Purge Search Log
labels.query=Query
labels.queryId=Query ID
labels.rt=rt
labels.searchLog=Search Log
labels.sort=Sort
labels.start=Start

		if notFoundPartsErrs > dataBlocks {
			// Not using parity to ensure that we do not delete
			// any valid content, if any is recoverable. But if
			// notFoundDataDirs are already greater than the data
			// blocks all bets are off and it is safe to purge.
			//
			// This is purely a defensive code, ideally parityBlocks
			// is sufficient, however we can't know that since we
			// do have the FileInfo{}.
			return validMeta, true

a shared library, the combination of the two is legally speaking a
combined work, a derivative of the original library.  The ordinary
General Public License therefore permits such linking only if the
entire combination fits its criteria of freedom.  The Lesser General
Public License permits more lax criteria for linking other code with
the library.

  We call this license the "Lesser" General Public License because it

                    // don't have enough credits/space for the first request, block until available
                    // for space there is nothing we can do, callers need to make sure that a single message fits

                    try {
                        final long timeout = getResponseTimeout(chain);
                        if (params.contains(RequestParam.NO_TIMEOUT)) {

	Complete bool `json:"complete" msg:"cmp"`
	Failed   bool `json:"failed" msg:"fl"`
	Canceled bool `json:"canceled" msg:"cnl"`

	// Internal information.
	QueuedBuckets         []string `json:"-" msg:"bkts"`
	DecommissionedBuckets []string `json:"-" msg:"dbkts"`

	// Last bucket/object decommissioned.
	Bucket string `json:"-" msg:"bkt"`
	// Captures prefix that is currently being
	// decommissioned inside the 'Bucket'

{
  "took" : 40,
  "timed_out" : false,
  "_shards" : {
    "total" : 5,
    "successful" : 5,
    "failed" : 0
  },
  "hits" : {
    "total" : 1,
    "max_score" : 1.0,
    "hits" : [
      {
        "_index" : "minio_events",
        "_type" : "event",
        "_id" : "images/myphoto.jpg",
        "_score" : 1.0,
        "_source" : {

labels.ignoreFailureType=Tipos de fallo ignorados
labels.lastAccessTime=Fecha del último acceso
labels.notificationTo=Notificar a
labels.num=Número
labels.pn=Número de página
labels.protocolScheme=Esquema
labels.purgeByBots=Eliminar por Bots
labels.logLevel=Nivel de registro
labels.purgeSearchLogDay=Eliminar registros de búsqueda
labels.query=Consulta
labels.queryId=ID de consulta
labels.rt=rt
labels.searchLog=Registro de búsqueda
labels.sort=Ordenar

// This keeps the cache size at a reasonable size for all buckets.
//
// Whenever a branch is scanned, it is assumed that it will be un-compacted
// before it hits any of the above limits.
// This will make the branch rebalance itself when scanned if the distribution of objects has changed.

// scanDataFolder will scanner the basepath+cache.Info.Name and return an updated cache.