Randomizer@cup.portal.com (04/08/88)
Borland once sent me a disk containing files off of compuserve On the disk was a file called PAS2C.arc containing files for interfacing 'C' to pascal. One of the files was a task switcher ala modula-2 which allowed the user to switch between different procedures/functions very fast. Alas! the files were incomplete... I could not run the program..... MY QUESTIONS: Does anyone know how to implement this sort of "scheduler/tasker"? Does anyone have the complete code that I am talking about. Does anyone have other code that shows how to implement this sort of algorithm?? randomizer@cup.portal.com *or* aron_nelson@cup.portal.com
rbw@WILLIAMS.EDU (04/09/88)
In an old ('86, '87) issue of Byte there is a set of routines written by two people from RPI for TP3 that provide a limited form of coroutines. They allowed you to set up different "processes" running on stacks that were allocated from the heap. I am working on a different version of the idea using TP4 and a different method for switching stacks. -Richard Ward rbw@cs.williams.edu Williams College, Williamstown, MA
ralphw@IUS3.IUS.CS.CMU.EDU (Ralph Hyre) (04/20/88)
I recall seeing some in Dr. Dobbs and possibly Computer Language, sometime after '85 - perhaps one for MS/DOS and one for CP/M (which was my interest at the time). -- - Ralph W. Hyre, Jr. Internet: ralphw@ius2.cs.cmu.edu Phone:(412)268-{2847,3275} CMU-{BUGS,DARK} Amateur Packet Radio: N3FGW@W2XO, or c/o W3VC, CMU Radio Club, Pittsburgh, PA