Thanks With the concatenation seemed to go a lot quicker I could be wrong
> On Oct 6, 2020, at 3:19 PM, Charles Mills <charl...@mcn.org> wrote: > > Try kicking up BUFNO. I think QSAM is generally about 98% as good as it > gets. I could be wrong. > > Reading a big pile of big files is going to take some time no matter what > you do. > > Charles > > > -----Original Message----- > From: IBM Mainframe Discussion List [mailto:IBM-MAIN@LISTSERV.UA.EDU] On > Behalf Of Joseph Reichman > Sent: Tuesday, October 6, 2020 11:56 AM > To: IBM-MAIN@LISTSERV.UA.EDU > Subject: dataset allocation > > Hi > > > > I posted a problem last week regarding allocating a concatenated dataset a > few of you (Seymour,Paul Gilmartin) suggested that when processing the 4,608 > VB (huge) files > > > > That rather then concatenate them and when I reach the limit deco catenate > them > > I just process on file at a time > > > > Alloc > > Open > > Read > > Close > > Unalloc > > > > Well this process is taking forever. I initially ran the program under TEST > and it took 3 wall minutes to get to the 58th file > > > > I am wondering whether BSAM with above the bar option would be worth the > effort if it sped things up > > > > Thanks > > > ---------------------------------------------------------------------- > For IBM-MAIN subscribe / signoff / archive access instructions, > send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN > > ---------------------------------------------------------------------- > For IBM-MAIN subscribe / signoff / archive access instructions, > send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN ---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
