× The internal search function is temporarily non-functional. The current search engine is no longer viable and we are researching alternatives.
As a stop gap measure, we are using Google's custom search engine service.
If you know of an easy to use, open source, search engine ... please contact support@midrange.com.


  • Subject: RE: This is a software design question - ILE related
  • From: Chris Bipes <chris.bipes@xxxxxxxxxxxxxxx>
  • Date: Wed, 2 Aug 2000 09:18:20 -0700

Nathan,

I was not suggesting that the C/S was faster than read from file or lookup
in a table.  In fact I do use the table lookups for small control files such
as A/R Codes in large batch jobs where the data cannot be sequenced by A/R
code.  What I was suggesting is for the interactive program where you have
hundreds of users using the same program, to use the C/S model instead of
having the program open the file itself.  This would save the hundreds of
Open Data Paths to the file.  Yes you do have to consider the problems with
data queues when there are not enough servers to handle the transaction
volume.  This is why we delete the data queues at IPL and program the client
and servers to create the data queue at startup if it does not exist.  The
servers also allocate the queue so it cannot be deleted while they are
sitting at data queue wait.
 

Christopher K. Bipes    mailto:ChrisB@Cross-Check.com
Sr. Programmer/Analyst  mailto:Chris_Bipes@Yahoo.com
CrossCheck, Inc.        http://www.cross-check.com
6119 State Farm Drive   Phone: 707 586-0551 x 1102
Rohnert Park CA  94928  Fax: 707 586-1884

If consistency is the hobgoblin of little minds, only geniuses work here.
Karen Herbelin - Readers Digest 3/2000

-----Original Message-----
From: Nathan M. Andelin [mailto:nathanma@haaga.com]
Sent: Tuesday, August 01, 2000 11:15 AM
To: MIDRANGE-L@midrange.com
Subject: Re: This is a software design question - ILE related


I wrote some code to test the performance of some of the suggestions you
folks have given me.

I wrote a little program to call the procedures repetitively to test their
speed.  Each procedure was called 76,800 times.  Following are the results.

getFromFile() - 29 seconds
getFromArray() - 10 seconds
getFromQueue() - 98 seconds.
+---
| This is the Midrange System Mailing List!
| To submit a new message, send your mail to MIDRANGE-L@midrange.com.
| To subscribe to this list send email to MIDRANGE-L-SUB@midrange.com.
| To unsubscribe from this list send email to MIDRANGE-L-UNSUB@midrange.com.
| Questions should be directed to the list owner/operator: david@midrange.com
+---

As an Amazon Associate we earn from qualifying purchases.

This thread ...


Follow On AppleNews
Return to Archive home page | Return to MIDRANGE.COM home page

This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].

Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.