PLEASE NOTE: If your code does not compile and run the awarded mark is an automatic zero. Our expectation is that you are able to code and submit a tested and working copy of your code. There will not be any partial marks and you are expected to debug and fix errors and test that your code works on the Linux image at University (CATS machines or ssh remotely to uss.cs.adelaide.edu.au). For details on how to submit this exercise via websub, scroll to the bottom (see Handin).
To gain an understanding of how remote method invocation in Java works, synchronisation, and to develop a working example of a Java RMI system. This will be essential in developing future applications as you will quickly learn all of the pitfalls inherent in developing standards-based clients and multi-threaded servers.
To gain an understanding of how a distributed system works, this first assignment phase involves developing a simple Java RMI application. This will involve developing both the client and server side of a distributed application: a simple sorting server.
The sorting server operates a stack and clients push values and operations on to the stack. While, usually, each client should have its own stack, you may use a single stack on the server. You may also assume that operations are always sensible: that is, we will only push an operator after pushing at least on value and we will only pop when there is a value on the stack. You may also assume that the operator provided will only be one of the four displayed types and that the values are always integers.
Following the directions discussed in lectures, you should create a Java RMI Server that supports the following remote methods:
void pushValue(int val);
This method will take val and push it on to the top of the stack.
void pushOperator(String operator);
This method will push a String containing an operator (“ascending”, “descending”, “max”, “min”) to the stack, which will cause the server to pop all the values on the stack and: i) for ascending operation – push all the popped values in the descending order; ii) for descending – push all the popped values in ascending order; iii) for max – push the max value; and iv) for min – push the min value of all the popped values.
This method will pop the top of the stack and return it to the client.
This method will return true if the stack is empty, false otherwise.
int delayPop(int millis);
This method will wait millis milliseconds before carrying out the pop operation as above.
Importantly: Your implementation should use the following files:
Sorter.java – the interface that defines the remote operations implemented by your remote service.
SorterImplementation.java – the implementation class for the remote operations.
SorterServer.java – the server class.
SorterClient.java – a test client that should connect to the server, and test its operation.
You will need to create and add these files to your SVN repository.
本网站支持淘宝 支付宝 微信支付 paypal等等交易。如果不放心可以用淘宝交易！
E-mail: firstname.lastname@example.org 微信:itcsdx