Anonymous user
Talk:Text processing/Max licenses in use: Difference between revisions
Talk:Text processing/Max licenses in use (view source)
Revision as of 09:28, 14 March 2012
, 12 years agoadded comments about times (should be through and inclusive). ~~~~
m (moved Talk:Text processing/3 to Talk:Text processing/Max licenses in use: More descriptive.) |
(added comments about times (should be through and inclusive). ~~~~) |
||
Line 17:
I agree that a serial-numbered name is bad. However, the old name has a problem; when I first saw it I assumed it was a task about ''implementing license restrictions'', i.e. tracking the number of copies of your program running on a network. So maybe something like Text processing/Max licenses in use. —[[User:Kevin Reid|Kevin Reid]] 16:01, 14 February 2010 (UTC)
==times THROUGH times==
I noticed that most programmers did not treat the time as steady-state, but discontinous with the times being descreet only at job INs and OUTs, that is, the times --between-- INs and OUTs also exist, but are never listed, nor are the times shown as THROUGH (start) to (end). The maximum is not just AT two times, but all times in between (inclusive) those times listed.
<br><br>
If one looks at the actual input file, you'll see job 1837 logging at OUT starting at 08:40:40, but the next job doesn come IN until 08_40_47 (records 3577 and 3578). [[User:Gerard Schildberger|Gerard Schildberger]] 09:28, 14 March 2012 (UTC)
| |||