John McKown asked:
| Why do I need to know the number of 1 bits in
| each individual byte in a GPR? Is it _that_
| common a question in application or system
| code?
Say you were an operating system software developer.
Let's further say that you wanted to write a really
efficient cell
Martin Packer asks:
| Interesting that program numbers were so very different
| from when I started in the mid 1980s
| I wonder when they changed.
| Or is this yet another kind of numbering?
That style of program number was one already in use by IBM -- even before
the advent of the System/360 in
J R responds:
| I googled HASP FDP and find that Jack Schudel's
| History of JES2 also refers to it as such:
|
| http://www.share.org/p/bl/et/blogid=9blogaid=238
In Jack's defense, HASP was a field developed program (in the sense that
it was developed by IBM employees working in the field [as it
Don V Nielsen asks:
| Where might one one find good instruction on how to read a dump?
For the most part, everybody I know that's any good at it got that way all
on their own (they may have taken a class from IBM or Amdahl back when they
were young and green, however, but nobody ever told me
John McKown wrote:
This is a test of the Emergency Broadcast System.
If this had been an actual emergency, do you
really think we'd stick around to tell you?
I always get a great chuckle out of that every time
I see it.
Well, this is a similar test. But just delete this
message and move on.
your resume; I am not interested in reading it at this time. Instead, I will
tell you more about the positions, answer any questions you might then have,
and tell you how to formally indicate interest (i.e., begin the application
process).
wmhbl...@comcast.net
William H. Blair
MainView
Ian Worthington asks about this text he read:
New instructions must be assembled using the YOP
instruction set on LINUX HLASM. The rest of the
system is assembled against the ZOP instruction set
to avoid the use of long displacements.
Here's what I think the short answer is:
On the original
John R. Ehrman suggested:
consider donating kernels to IBM as examples of real-world workloads.
Has something changed? The last time (in fact, the last couple of dozen
times) anybody I know tried to give IBM some working code (for various
purposes), they were slapped down immediately, if not
G wrote:
this came up in a thread last year.
Yes, it did. The self-appointed experts were spouting
off as usual, so I had to step in.
HASP uses a word compare, and in a number of tests
I ran those tests (and others that folks sent to me)
and posted the results.
that came out faster than
Patrick Roehl asks:
The entries are short (4 bytes) and the key is the entire entry. My
understanding is that in this situation a hash table has no benefit.
Is this correct?
No, that is not correct. I would select a hash algorithm that would
yield a hash value in the range of 0 to (a power
10 matches
Mail list logo
