Redesigning the Principles of Operations
Unfortunately, I missed the start of this thread. The poor design of the PoPs is one reason why I wrote my z/Architecture for application programmers book, not that I make any claims of providing an equivalent. The major difficulty that I find with the PoPs is the difficulty in finding the appropriate information for a particular variant of an instruction; for example, the appropriate details for a particular Translate One/Two instruction are located at various points of the description. To improve clarity, I made wide use of tables in my book that enabled me to keep the size of the book to less than 400 pages. Another weakness of the PoPs is the lack of examples for many of the more recent instructions. Anthony Rudd -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Re: Destination z -- Back to the Future -- Don't Reinvent Mainframe Wheels
It’s inexplicable that the 1990s saw new applications developed with Y2K doom built in. This is especially true that the first Y2K problem I know of occurred in 1970 (30-year contracts) -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Re: Following up on Rexx and Metal C
You mentioned in passing the problem with debugging Metal C by adding printf's. Unfortunately, Metal C does not offer I/O functions. I solved this problem by writing an extension library with basic I/O support. Tony -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Re: Easy way to check whether a job is still running (without using TSO)
Mark This seems to be just what I am looking for. Thanks and regards Tony -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Re: Linear search vs. Binary search
The UPT instruction would appear to be ideal for implementing search. Unfortunately, although I found a mention to such a possible implementation in a SHARE presentation, it was only very theoretical and because the UPT example in the Principle of Operations is incomplete and I have not beein able to fathom out what it does, I have not been able to implement an example. Does anyone have such an implementation? Regards Tony -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Re: Easy way to check whether a job is still running (without using TSO)
The latter - an unauthorised program. I would have thought (hoped) that there is a short sequence of control blocks accessible from an unauthorised program that can be processed to determine whether a known job is running (is know to the system, if not - it has completed). I can certainly use batch TSO IKTEFT01 (STATUS command), but this would seem to be an overkill. I do not want to use batch SDSF because I want to write solution does not require the presence of SDSF. Regards Tony -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Easy way to check whether a job is still running (without using TSO)
Is there an easy way to check whether a previously submitted job is still running (without using TSO)? Regards Tony -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Practical and understandable UPT instruction example
I am currently revising my z/Architecture book for application programmers with practical examples where appropriate. What I am still missing is a practical example for UPT (Update Tree). Although there have been a number of SHARE papers published on this topic, they discuss only limited aspects of using UPT (and CFC) for sort applications and ignore some critical considerations, as does the example in the Principles of Operations. Does anyone have a small complete example of UPT usage? I can imagine that a binary tree application would be a suitable candidate. I have also seen an old reference to a Burrows-Wheeler transformation implemented with UPT. Can anyone help. Regards Tony -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
