- Decompiling a Program Originally Written for DOS - 2 Updates
- cmsg cancel <n3nl1n$6cf$2@dont-email.me> - 2 Updates
- My efficient Threadpool engine was updated to version 2.6 - 2 Updates
| vladtheimpaler1134@gmail.com: Dec 02 02:41PM -0800 Hello, My name is Adam Morrissette, and I work as a CAD Designer for a monument company in western United States. I am in a bit of a pickle. We regularly use a program called fill.exe to batch fill any of our drafts to print out. We have never found any replacement of this program and it is key to our development. What it does it takes a line vector drawing and automatically fills in our closed lines. As to how it decides what lines get filled and which ones don't, is beyond me. A little background on this program, it was originally written in 1992 by our original software developer, who completely dropped our software support after they released a new program which we were not happy with. We have not received any assistance from them in regards to their program since 1997, so we found a new CAD program to use, which our FILL.exe hooks into. However since this program was originally written for DOS, none of our 64 bit computers can run it, we are upgrading all of our pc's as they are outdated, but we do not want to lose the use of FILL.exe. I have gotten it to run in a DOSBOX Enviro, but it is monumentally slow. (no pun intended) It takes hours to do what it used to in a matter of seconds or minutes. SO my question to you is this A: Is there any way to decompile this exe to it's source code, and recompile it into a version that will run on the latest windows. B:If we cannot, is there a way to decompile it, so it can be read by someone who understands the language it was written in so they can rebuild a program from the ground up based off of how this one works. C: Does anyone know of any pre existing software that will automatically fill line vector drawings. (This might as well be questions number 1) Thank you |
| Jacob Sparre Andersen <sparre@nbi.dk>: Dec 03 12:07PM +0100 > What it does it takes a line vector drawing and automatically fills in > our closed lines. As to how it decides what lines get filled and > which ones don't, is beyond me. The most efficient solution will probably be to figure out the algorithms used from the output of the program, rather than by trying to decompile it. Greetings, Jacob -- »Verbing weirds language.« -- Calvin |
| bleachbot <bleachbot@httrack.com>: Dec 02 09:43PM +0100 |
| bleachbot <bleachbot@httrack.com>: Dec 02 10:24PM +0100 |
| Ramine <ramine@1.1>: Dec 02 03:47PM -0800 Hello, I have updated my efficient Threadpool engines with priorities and without priorities to version 2.6, i was thinking more and i have come with another more efficient and more scalable concurrent FIFO Queue, please look at it inside the zipfile, its name is FIFOQueue_mpmc.pas, i have also corrected some logic inside my algorithm of my Threadpool engines and now they are correct, i have tested them thouroughly and you can be confident because i think they are stable and fast now, so be happy with them. One last note: if you look at the microsoft TPL library it's using a Threadpool engine with many queues and i think it's work stealing with a round robin mechanism , but i think this is not good for critical systems if the number of queues are higher and higher... i have avoided this problem in my Threadpool engine. You can download my Threadpool engines with priorities and without priorities version 2.6 from: https://sites.google.com/site/aminer68/threadpool-with-priorities and from: https://sites.google.com/site/aminer68/threadpool Thank you, Amine Moulay Ramdane. |
| Ramine <ramine@1.1>: Dec 02 04:24PM -0800 I wrote: > this is not good for critical systems if the number of queues > are higher and higher... i have avoided this problem in > my Threadpool engine. Please read this to understand more how works the Microsoft TPL "...Each worker thread has its own local task queue of work to be done. Each worker usually just pushes new tasks onto its own queue and pops work whenever a task is done. When its local queue is empty, a worker looks for work itself and tries to "steal" work from the queues of other workers." Read more here about Microsoft TPL: http://msdev.developer-works.com/article/30095952/Performance+of+TPL+and+explanation%3F Thank you, Amine Moulay Ramdane. On 12/2/2015 3:47 PM, Ramine wrote: |
| You received this digest because you're subscribed to updates for this group. You can change your settings on the group membership page. To unsubscribe from this group and stop receiving emails from it send an email to comp.programming.threads+unsubscribe@googlegroups.com. |
No comments:
Post a Comment