-
41 команда условного останова
1. conditional stop instruction2. optional halt instructionкнопка останова; кнопка "стоп" — halt key
3. optional stop instructionРусско-английский большой базовый словарь > команда условного останова
-
42 контрольная лента
Русско-английский большой базовый словарь > контрольная лента
-
43 кусок ленты
-
44 маркер ленты
-
45 метка конца ленты
Русско-английский большой базовый словарь > метка конца ленты
-
46 набор лент
-
47 накопитель на ленте
1. tape drive2. tape unitРусско-английский большой базовый словарь > накопитель на ленте
-
48 натяжение ленты
-
49 начальный заправочный конец ленты
Русско-английский большой базовый словарь > начальный заправочный конец ленты
-
50 недоперфорированная лента
Русско-английский большой базовый словарь > недоперфорированная лента
-
51 номер ленты
-
52 обмен с магнитной лентой
Русско-английский большой базовый словарь > обмен с магнитной лентой
-
53 обращение к магнитной ленте
Русско-английский большой базовый словарь > обращение к магнитной ленте
-
54 оперирование с лентой
Русско-английский большой базовый словарь > оперирование с лентой
-
55 останов
м. stop, shut-down, outage -
56 останов при обрыве ленты
1. tape breakage cutoff2. tape-break stopРусско-английский большой базовый словарь > останов при обрыве ленты
-
57 память на магнитных лентах
Русско-английский большой базовый словарь > память на магнитных лентах
-
58 петля ленты
-
59 пятидорожечная лента
Русско-английский большой базовый словарь > пятидорожечная лента
-
60 рабочая лента
См. также в других словарях:
Loop nest optimization — (LNO) is a special case of loop transformation, dealing with nested loops, that allows large reductions in the cache bandwidth necessary for some common algorithms.Example: Matrix multiplyMany large mathematical operations on computers end up… … Wikipedia
Loop unwinding — Loop unwinding, also known as loop unrolling, is a loop transformation technique that attempts optimize a program s execution speed at the expense of its size.The goal of loop unwinding is to increase the programs speed by reducing (or… … Wikipedia
Code coverage — is a measure used in software testing. It describes the degree to which the source code of a program has been tested. It is a form of testing that inspects the code directly and is therefore a form of white box testing.[1] Code coverage was among … Wikipedia
Loop inversion — is a compiler optimization, a loop transformation, which replaces a while loop by an if block containing a do..while loop. Example in C int i, a [100] ; i = 0; while (i < 100) { a [i] = 0; i++; }is equivalent to: int i, a [100] ; i = 0; if (i … Wikipedia
Loop-invariant code motion — Loop invariant code in an imperative programming language consists of statements which could be moved to before the loop (if the loop always terminates), or after the loop, without affecting the semantics of the program. As a result it is… … Wikipedia
Loop splitting — (or loop peeling) is a compiler optimization technique. It attempts to simplify a loop or eliminate dependencies by breaking it into multiple loops which have the same bodies but iterate over different contiguous portions of the index range. A… … Wikipedia
Loop unswitching — is a compiler optimization. It moves a conditional inside a loop outside of it by duplicating the loop s body, and placing a version of it inside each of the if and else clauses of the conditional. This can improve the parallelization of the loop … Wikipedia
Code bloat — is the production of code that is perceived as unnecessarily long, slow, or otherwise wasteful of resources. Code bloat can be caused by inadequacies in the language in which the code is written, inadequacies in the compiler used to compile the… … Wikipedia
Code-excited linear prediction — (CELP) is a speech coding algorithm originally proposed by M.R. Schroeder and B.S. Atal in 1985. At the time, it provided significantly better quality than existing low bit rate algorithms, such as residual excited linear prediction and linear… … Wikipedia
Code excited linear prediction — (CELP) is a speech coding algorithm originally proposed by M.R. Schroeder and B.S. Atal in 1985. At the time, it provided significantly better quality than existing low bit rate algorithms, such as RELP and LPC vocoders (e.g. FS 1015). Along with … Wikipedia
Loop optimization — In compiler theory, loop optimization plays an important role in improving cache performance, making effective use of parallel processing capabilities, and reducing overheads associated with executing loops. Most execution time of a scientific… … Wikipedia