Re:Misleading Java/CORBA/SOAP Statement
on
Perl and .NET
·
· Score: 1
That's a good point; you're right in a sense. It's true that RMI operates over IIOP, but that doesn't mean that it's equivalent to CORBA. Because it's all Java, RMI has some features that CORBA doesn't. In particular, RMI uses Java's mobile code functionality to do stuff like enable transparent subclassing of RMI proxies. So if I write an RMI client to use a particular type of RMI service proxy, I can also use proxies that subclass that proxy. RMI will automatically download the new class files from the RMI server. This is where the platform independent code and security manager framwork of Java really allow you to do some cool stuff IMO. This is what gives Jini its power and potential.
Also, I should have noted that IBM gave its SOAP implementation to Apache. It's now at the Apache site.
Misleading Java/CORBA/SOAP Statement
on
Perl and .NET
·
· Score: 2
The article seems to imply that Sun has standardized on CORBA as the way to do distributed applications with Java. I don't really think that's true. Most distributed Java applications that Sun has created use RMI, which is not CORBA. CORBA just happens to map very easily to Java, which is why there are plenty of implementations for it.
People might also read this and get the impression that you can't do SOAP with Java. There's a couple of SOAP implementations for Java, most notably the one from IBM alphaWorks.
I think what they said was that the problem was checking to see if a set of clues (the numbers in the squares) was consistent, without knowing where the mines themselves are. Imagine a board that just had all of the squares with numbers in them. That seems like it would take a lot of work to verify. Sounds like it might be equivalent to one of those tiling problems that are common examples of problems in NP.
Also, I should have noted that IBM gave its SOAP implementation to Apache. It's now at the Apache site.
People might also read this and get the impression that you can't do SOAP with Java. There's a couple of SOAP implementations for Java, most notably the one from IBM alphaWorks.
I think what they said was that the problem was checking to see if a set of clues (the numbers in the squares) was consistent, without knowing where the mines themselves are. Imagine a board that just had all of the squares with numbers in them. That seems like it would take a lot of work to verify. Sounds like it might be equivalent to one of those tiling problems that are common examples of problems in NP.