Related articles |
---|
Register allocation patent stevec@pact.srf.ac.uk (1995-11-27) |
Re: Register allocation patent preston@tera.com (1995-11-28) |
Re: Register allocation patent burley@cygnus.com (1995-11-29) |
Re: Register allocation patent wilken@garlic.ece.ucdavis.edu (1995-11-29) |
Re: Register allocation patent wills@rchland.ibm.com (1995-11-30) |
Register allocation patent preston@tera.com (1995-12-09) |
Newsgroups: | comp.compilers |
From: | preston@tera.com (Preston Briggs) |
Keywords: | registers, optimize, question, legal |
Organization: | /etc/organization |
References: | 95-11-214 |
Date: | Tue, 28 Nov 1995 18:07:24 GMT |
stevec@pact.srf.ac.uk (Stephen Clarke) writes:
>What is the status of IBM's patent on register allocation and spilling
>via graph coloring? Most people seem to reference Chaitin's work when
>describing their register allocators, including numerous commercial
>companies; is the patent unenforceable?
Well, it's still a patent and I would imagine IBM can enforce it. But
recall that the existence of a patent doesn't prohibit anyone using
the technique; instead, it means that commercial users need to obtain
a license.
Also, technical papers have to include adequate bibliographies and
comparisons with other work. When I see a paper on register
allocation, a question I want answered is: "How does this compare to
Chaitin's work?" So you'll see lots of papers that reference Chaitin,
even if only to say "We're not at all like Chaitin!"
Preston Briggs
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.