Ok, I now understand better.
To avoid the movement of the items, I would use a design much like the
DB2 data pages.
The items would be stored in a series of buffers of fixed size (say: 4k
or 8k or 16k).
The buffers are chained or addressed by a pointer vector ... if chained,
the number of bu
I had always thought that assembler was the language as well as the program
that translated the assembler code into machine language, and the process of
doing the translation was the assembly. But. I just dug out a book from my
ancient days (copyright 1976) called "assembly language and the
On Sat, 28 Dec 2024 10:53:31 -0600, Steve Beaver wrote:
>IBM moved thousands of people to IOWA 15 years ago. Does anyone know how many
>people actually worked in Dubuque?
Was it only 15? I thought it was 20 or more, back when I was in VM support.
¬R
---
Steve Beaver wrote:
> I have not used IPCS in years -- Does anyone have a useful and complete
> document on how to use IPCS
The good news is that it hasn't changed much ;)
Here's a good SHARE presentation from Jerry Ng that shows the basics of getting
started with IPCS:
https://share.confex.
(Cross-posted to IBM-MAIN, IBMVM, and the IBM assembler list)
I just finished a book, The Impossible Fortress by Jason Rekulak, which I quite
enjoyed. Part of the plot involves characters writing code on a Commodore 64,
including some "machine code". It seemed clear from the description that the
Interesting! If we didn't already have the term "assembler", the linkage
editor/binder might could have used that name...
-Original Message-
From: IBM Mainframe Discussion List On Behalf Of
Pommier, Rex
Sent: Monday, December 30, 2024 3:26 PM
To: IBM-MAIN@LISTSERV.UA.EDU
Subject: Re: [E
Yes.
The only accesses are the inserts and the periodic scans/deletes. No ad hoc
updates or deletes.
On Mon, 30 Dec 2024 13:34:02 +0100 Thomas Berg
<0619bfe39560-dmarc-requ...@listserv.ua.edu> wrote:
:>Is the main issue to avoid loss of storage space? That is, access time is
:>not that impor
I have (at least) two or three questions for this requirement, to
understand it better and to give a better advice:
1. is it necessary to access the individual items directly from outside,
that is: do they need a pointer or
a key or an ID or something, or is the sequential scan the only way to
A solution is maybe a table (etc) where every record is registered with
address and length and for every new record traverse that table for the
first empty (deleted) record area that fits the new record. And then reuse
it.
Here there are many possible optimizations depending on the needs and
pecula
1. Only access (other than INSERT) is the periodic scan.
2. Issue is that additional records are being inserted at the same time. So
may mover and move and move again. My thought was a header which had a pointer
to the next available area and using a synchronized instruction to take the
next slot
some more questions, sorry ...
if there are (many) records added and removed at the same time (removed
by scanning the existing records):
what is the condition that leads to the deletion of existing records?
Can it be computed on the existing records alone
or does it depend on the incoming reco
Is the main issue to avoid loss of storage space? That is, access time is
not that important?
Thomas
Den mån 30 dec. 2024 08:28Binyamin Dissen <
0662573e2c3a-dmarc-requ...@listserv.ua.edu> skrev:
> The issue with playing with pointers is that the storage would be lost.
> Blocks
> have quite
There is external data that determines if a record is no longer needed. The
records indicate a request sent to an external system that cannot reply.
Periodically the external system is queries as to completed items.
That is my reason for a second area where the incomplete requests are saved
while
Not sure, but I was offered a job at IBM in Dubuque in 2013. I'm not sure now
whether I would've been an IBM employee or a contractor, but there was a data
center where IBM managed outsourced z/OS data centers. Not sure what else (if
anything) went on there.
-Original Message-
From: IBM
The obvious question which comes to mind:
why not use DB2 global temp tables? They work exactly like I outlined it
before, but you don't have to code it.
They live in main storage, as long as the DB2 buffer pools are large
enough ...
Of course, we didn't talk about environments and programmin
Another solution, much simpler IMO:
you need an upper limit of active entries that your system can handle,
say MAX.
You define a vector of MAX elements, each element contains only a
pointer and a length.
The pointer is zero, if no item is allocated (never used or deleted) and
in the other ca
Hi Ed,
I'm hoping to hear from Mark or someone in XCF/CFRM (and/or someone in Heath
Checker development), but in the meantime, I'll ask a couple of pedantic
questions. What is your policy definition for this structure - InitSize, Size,
and MinSize? Just for G&G, what do your Logger definition
Some errors ... one line was erroneously doubled ... and some other
corrections ...
Feel free to ask if there are question remaining or doubts about how the
algorithm works ...
IMO this is much the same what DB2 does to keep the movement of data in
the buffers to a minimum ...
the records are
Oops, I sent too soon: that Wikipedia page also distinguishes "assemblY code"
from the "assemblER", which is the thing that processes the code to create
[what I'd call] machine code. That makes a wee bit more sense, though it's a
tiny distinction that I've never seen before. If so, then we write
Tandy TRS-80 Model 1 basic had POKE commands where you gave an address
and a value to store there. One published use I remember was to
generate certain graphic characters to turn on and off a part of the
character cell since the difference displayed between the two values
in the byte was one of si
Doubt that DB2 will provide efficiency for this case.
On Mon, 30 Dec 2024 16:09:56 +0100 Bernd Oppolzer
wrote:
:>The obvious question which comes to mind:
:>
:>why not use DB2 global temp tables? They work exactly like I outlined it
:>before, but you don't have to code it.
:>They live in main s
On Mon, 30 Dec 2024 13:43:36 -0500, Phil Smith III wrote:
>>
>So perhaps the two a-words aren't even really appropriate! Too late now, of
>course...
>
>What say ye? Does any of this conflict with your usage/thoughts?
> .
"If you know what it means, let's talk about it. If you don't know
what it
Yep, the coding in the book is full of PEEK and POKE!
-Original Message-
From: IBM Mainframe Discussion List On Behalf Of
Mike Schwab
Sent: Monday, December 30, 2024 2:00 PM
To: IBM-MAIN@LISTSERV.UA.EDU
Subject: Re: Assembler vs. assembly vs. machine code
Tandy TRS-80 Model 1 basic had
Hi List,
Here goes. Is there a way with TCP/IP on z/OS to set up a preferred interface
to use for outbound traffic - like FTP? In my case, I'm implementing 10 Gb
ethernet cards. My "go-to" interfaces are 1 Gb. I have a 1Gb and a 10 Gb
interface going to the same network subnet, example is I
Can we assume Policy Agent is available?
If so, you could require FTP to use the 1G.
I’m not sure the best way to have traffic default to 10G; OMPRoute might push
most traffic that way. There are other ways.
Sent from [Proton Mail](https://proton.me/mail/home) for iOS
On Mon, Dec 30, 2024 at 7:1
On 12/30/2024 11:33 AM, Art Gutowski wrote:
I'm hoping to hear from Mark or someone in XCF/CFRM (and/or someone in Heath
Checker development), but in the meantime, I'll ask a couple of pedantic questions.
What is your policy definition for this structure - InitSize, Size, and MinSize?
Just f
26 matches
Mail list logo
