CV, Teaching Evaluations, Annual Reports, Awards and Grant Proposals

Size: px

Start display at page:

Download "CV, Teaching Evaluations, Annual Reports, Awards and Grant Proposals"

Evan Benson
5 years ago
Views:

1 CV, Teaching Evaluations, Annual Reports, Awards and Grant Proposals Contents CV Teaching Evaluations Annual Evaluations Awards This category contains different awards including but not limited to: - TA awards - Best paper awards - College of Engineering 2008/2009 Best Teacher of the Year award Grant Proposals Submitted (Funded and Non-funded) Current Projects: - ProcessJ (formerly Joccam) a new process oriented language.

2 Curriculum Vitæ Jan Bækgaard Pedersen School of Computer Science Phone: (702) University of Nevada, Las Vegas Fax: (702) South Maryland Parkway Las Vegas, NV, Web: (Home address) 8399 Transvaal Blue Street Phone: (702) Las Vegas, NV Cell: (702) Area of Research Primary area of research is parallel programming. This includes tools for developing parallel programs, in particular message passing programs, tools for debugging message passing programs, parallel and distributed algorithms and language and compiler support for parallel and distributed programming. Other areas of interest include programming language design, compiler construction and optimization and runtime environments. In addition I am very interested in applying parallel programming techniques to the field of graphics, in particular, developing algorithms and programs for utilizing clusters for obtaining fast performance of time consuming tasks. Education Ph.D. student, Department of Computer Science, University of British Columbia. Supervisor: Dr. Alan Wagner M.Sc. (Cand. Scient.) degree in computer science, B.Sc. in computer science, B.Sc. in Mathematics, Department of Computer Science at the Institute of Mathematics, University of Århus, Denmark. Supervisor: Dr. Peter Møller-Nielsen Work Experience University of Nevada, Las Vegas Oct Present Assistant Professor, University of Nevada, Las Vegas. In charge of the area of programming language. CSC 326 Programming Languages (Fa04, Fa05, Sp08, Fa08, Sp09) CSC 460 Compilers (Sp04, Sp05, Sp06, Fa06, Sp07, Fa07, Sp08, Sp09) CSC 465 Networks (Sp05, Sp06) CSC 489 Network and Distributed Systems (Sp07) CSC 789 Multiprocessor Programming (Fa04, Fa06, Fa08) CSC 789 Multiparadigmatic Programming (Fa07)

3 University of British Columbia Summer 2000, Summer 2001, Summer 2002 Spring 2003 Lecturer in computer science, CPSC 124 Principles of Computer Science I Lecturer in computer science, CPSC 218 Computer Organization Lecturer in computer science, CPSC 124 Principles of Computer Science I Summer 2003 Lecturer in computer science, CPSC 128 Summer 2003 Lecturer in computer science, CPSC 126 Fall 2002 Fall Present Member of the curriculum development committee. Teaching assistant (Giving tutorials, marking, making assignments, etc.): CPSC 122 Principles of Computer Programming CPSC 124 Principles of Computer Science I CPSC 126 Principles of Computer Science II CPSC 128 Principles of Computer Science CPSC 152 Principles of Software Development CPSC 218 Computer Organization CPSC 311 Definition of Programming Languages CPSC 318 Machine Structures CPSC 411 Introduction to Compiler Construction CPSC 416 Distributed Systems CPSC 418 Advanced Computer Architectures CPSC 520 Language Translation and Analysis Twinsoft/Tele Danmark (TDC) Feb Aug System consultant (SQL, Databases, Scripting) University of Århus Sep Dec Teaching assistant in computer science (Giving labs and tutorials): Distributed systems (4th year), Introduction to programming (1st year), Algorithms and data structures (1st year) Contract Software Development. Sep Dec software). Midtjydsk Revisions Kontor (Time management and billing Herning Taxa (Taxi route planning software). Midtjydsk Autoophug (Inventory and accounting software). Midtjydsk Autokøler Værksted (Production planning software). Scholarships and Awards Spring 2009 Sep Aug Sep & Sep Jun Best teacher of the College of Engineering, UNLV. Tuition scholarship by the Danish Research Academy. Travel support by the World Transputer User Group (WOTUG) Travel support by the North American Transputer User Group

4 Sep Aug Jun Sep (NATUG) and by the PDPTA conference. Tuition scholarship by the Danish Research Academy. Travel support by the North American Transputer User Group (NATUG). Scholarship by Randers Reb & The Jensen Family Memorial Foundation. Refereed Journal Papers Santa Claus Formal Analysis of a Process Oriented Solution, Peter H. Welch, Jan B. Pedersen in Transactions of Programming Languages and Systems; accepted with minor revisions. Estimating the Free Region of a Sensor Node, Laxmi Gewali, Navin Rongratana, Jan B. Pedersen, in Journal of Combinatorical Mathematics and Combinatorical Computing. Random Number Generators: Metrics and Tests for Uniformity and Randomness, Angelo Yfantis and Jan B. Pedersen, in Journal of Combinatorial Mathematics and Combinatorial Computing. Free Regions of Sensor Nodes. Laxmi Gewali, Navin Rongatana, Henry Selveraj, Jan B. Pedersen, in Journal of Systems Science. Approximating the Buffer Allocation Problem Using Epochs. Jan B. Pedersen, Alex Brodsky, Jeffrey Sampson. in Journal of Parallel and Distributed Computing, Vol. 68, No. 9 (September 2008), pages On the Complexity of Buffer Allocation in Parallel Message Passing Systems. Alex Brodsky, Jan B. Pedersen and Alan Wagner, Journal of Parallel and Distributed Computing, Vol. 65, No. 5. (June 2005) pp Refereed Conference Papers Resumable Java Bytecode Process Mobility in ProcessJ for the JVM, Jan B. Pedersen, Brian Kauke, to appear in proceedings of Communicating Process Architectures (CPA 09), Eindhoven, Holland, November 1-4, Asynchronous Active Objects in Java. George Oprean and Jan B. Pedersen in the proceedings of Communicating Processes Architectures 2008 (CPA'08), York, United Kingdom, September 7-10, pp Solving the Santa Claus Problem: A Comparison of Various Concurrent Programming Techniques. Jason L. Hurt and Jan B. Pedersen in the proceedings of Communicating Processes Architectures 2008 (CPA'08), York, United Kingdom, September 7-10, pp Approximating the Buffer Allocation Problem Using Epochs, Jan B. Pedersen and Alex Brodsky. To appear in proceedings of Parallel and Distributed Computing and Systems (PDC 2006), Dallas, Texas, USA, November [Best paper in the algorithms category] Classification of Programming Errors in Parallel Message Passing Systems, Jan B. Pedersen, Proceedings of Communicating Process Architectures (CPA 2006), Edinburgh, Scotland, September , pp IDLI: An Interactive Message Debugger for Parallel Programs using LAM-MPI, Hoimonti Basu and Jan B. Pedersen, in Proceedings of the International Conference on Parallel and Distributed Techniques and Applications (PDPTA 2006), Las Vegas, Nevada, USA, June Millipede: A Multilevel Debugging Environment for Distributed Systems. Erik H. Tribou and Jan B. Pedersen, Proceedings of the International Conference on Parallel and Distributed Processing Techniques (PDPTA 2005), Las Vegas, Nevada, June 2005, pp

5 A Parallel Framework For Simplification of Massive Meshes. Dmitry Brodsky and Jan B. Pedersen, Proceedings of IEEE Symposium of Parallel and Large-Data Visualization and Graphics. Seattle On the Complexity of Buffer Allocation in Message Passing Systems, Alex Brodsky, Jan B. Pedersen and Alan Wagner, in Proceedings of Communicating Process Architectures (CPA 2002), Reading, United Kingdom, September 2002, pp Parallel Model Simplification of Very Large Polygonal Meshes, Dmitry Brodsky and Jan B. Pedersen, in Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2002), Las Vegas, Nevada, June 24-27, Protocol Verification in Millipede, Jan B. Pedersen and Alan Wagner, in Proceedings of Communicating Process Architectures (CPA 2001), Bristol, United Kingdom, August 2001, pp Compiling, Assembling and Executing Java Using Java, Jan B. Pedersen and Alan Wagner, in Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2001), Las Vegas, Nevada, June 25-28, 2001, pp Correcting Errors in Message Passing Programs, Jan B. Pedersen and Alan Wagner, in Proceedings of the 6ht International Workshop on High Level Parallel Programming Models and Supportive Environments (HIPS 2001), San Francisco, California, April, 2001, pp Sequential Debugging of Parallel Message Passing Programs, Jan B. Pedersen and Alan Wagner, in Proceedings of the International Conference on Communications in Computing (CIC'2000), Las Vegas, Nevada, USA, June 26-29, 2000, pp PVM-Builder A Tool for Parallel Programming, Jan B. Pedersen and Alan Wagner, in Proceedings of the 5th International Euro-Par Conference, Toulouse, France, August/September 1999, pp Contract Software Development Sep Dec software). Midtjydsk Revisions Kontor (Time management and billing Herning Taxa (Taxi route planning software). Midtjydsk Autoophug (Inventory and accounting software). Midtjydsk Autokøler Værksted (Production planning software). Theses Multi Level Debugging of Parallel Message Passing Programs A Different Approach to Debugging Parallel Programs, Ph.D. Thesis, University of British Columbia. "PVMBuilder, et grafisk værktøj til parallel programmering" ( PVMBuilder, a Graphical Tool for Parallel Programming ), Masters Thesis, University of Aarhus, Presentations at Conferences Asynchronous Active Objects in Java. George Oprean and Jan B. Pedersen in the proceedings of Communicating Processes Architectures 2008 (CPA'08), York, United Kingdom, September 7-10, pp Approximating the Buffer Allocation Problem using Epochs, to be given at Parallel and Distributed Computing and Systems (PCDS 2006), Dallas, Texas, USA, November Classification of Programming Errors in Parallel Message Passing Systems, Communicating Process Architectures (CPA 2006), Edinburgh, Scotland, 2006.

6 IDLI: An Interactive Message Debugger for Parallel Message Passing Programs Using LAM_MPI, the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2006), Las Vegas, Nevada, June 26-29, Protocol Verification in Millipede, Communicating Process Architectures 2001, Bristol, United Kingdom, August Compiling, Assembling and Executing Java Using Java, the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2001), Las Vegas, Nevada, June 25-28, Correcting Errors in Message Passing Programs, the 6ht International Workshop on High Level Parallel Programming Models and Supportive Environments (HIPS 2001), San Francisco, California, April, Sequential Debugging of Parallel Message Passing Programs, the International Conference on Communications in Computing (CIC 2000), Las Vegas, Nevada, USA, June 26-29, PVM-Builder A Tool for Parallel Programming, the 5 th International Euro-Par Conference, August/September 1999, Toulouse, France. Misc. / Posters / Fringe Presentations Fringe: Santa Claus - with Mobile Reindeer and Elves, P. H. Welch and J. B. Pedersen, abstract published in in Communicating Process Architectures, 2008 (CPA'08), September 7-10, 2008, York, United Kingdom. Conferences Attended Communicating Process Architectures (CPA 2008), York, York, United Kingdom, September Communicating Process Architectures (CPA 2007), Guilford, Surry, United Kingdom, July 2007 Parallel and Distributed Computing and Systems (PDCS 2006), Dallas, Texas, USA, November 2006 Communicating Process Architectures (CPA 2006), Edinburgh, Scotland, September The International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2006), Las Vegas, Nevada, June, Communicating Process Architectures (CPA 2005), Eindhoven, Holland, September The International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2005), Las Vegas, Nevada, June, Communicating Process Architectures (CPA 2004), Oxford, United Kingdom, September The International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2004), Las Vegas, Nevada, June, Special Interest Group on Graphics (SIGGRAPH 2002), San Antonio, Texas, USA, July Communicating Process Architectures (CPA 2002), Reading, United Kingdom, September The International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2002), Las Vegas, Nevada, June 24-27, Communicating Process Architectures (CPA 2001), Bristol, United Kingdom, August 2001 The International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2001), Las Vegas, Nevada, June 25-28, 2001.

7 The 6ht International Workshop on High Level Parallel Programming Models and Supportive Environments (HIPS 2001), San Francisco, California, April, The International Conference on Communications in Computing (CIC 2000), Las Vegas, Nevada, USA, June 26-29, 2000 The 5 th International Euro-Par Conference, August/September 1999, Toulouse, France. Program Committees Communicating Process Architectures (CPA), 2004 (since 2007 member of the steering committee) Public Relations Officer for CPA (2008-) International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA), Referee The Journal of Supercomputing Journal of Parallel and Distributed Computing International Conference on Parallel and Distributed Processing Techniques and Applications Communicating Process Architectures Graduated Students Erik Tribou, M.Sc. Thesis. Millipede: A Graphical Tool for Debugging Distributed Systems With a Multilevel Approach (July 2005) Hoimonti Basu, M.Sc. Thesis. Interactive Message Debugger for Parallel Message Passing Programs Using MPI (November 2005) Kamesh Kanna, M.Sc. Thesis. Ubiquitous Health Monitoring System for Seniors, (May 2007) Jeffrey Sampson, M.Sc. Thesis. Implementation of the an approximation of the buffer allocation problem for MPI programs. (December 2007) George Oprean, M.Sc. Thesis. An Implementation of Active Objects in Java (May 2008) Research Grants Co-PI, college of Engineering Beowulf cluster grant ($500,000) 2008 Research Development Award ($10,000) Course Development During my time as untenured faculty at UNLV I have developed course material for 6 undergraduate and graduate courses. CSC 326 Programming Languages. Developed new curriculum including a 70 page assignment for developing a virtual machine for a Java like Language. CSC 460 Compiler Construction. Developed new curriculum including a 101 page assignment for developing a compiler for a Java like language using state of the art tools. CSC 465 Networks I. Developed new curriculum and assignments.

8 CSC 489 Networks and Distributed Systems. Develop curriculum and assignments as well as teaching it the first time it was offered. CSC 789 (Multiprocessor programming) CSC 789 (Multiparadigmatic programming) developed curriculum, handouts, and assignments for both of these courses, as well as taught them every time then have ever been taught.

85 Grant Applications (Funded and Unfunded) Funded 2008: TITLE FUNDING AGENCY AIMS / GOAL OF GRANT PI/CO-PI/ PI OTHER PERCENTAGE 100% OF YOUR TIME CONTRIBUTION TERM OF GRANT Beginning/ End Dates TOTAL AWARD $10,000 Language and Tool Development for Multi-core Architectures UNLV Research Development Award Develop and implement process oriented programming languages July 08/June : TITLE FUNDING AGENCY AIMS / GOAL OF GRANT PI/CO-PI/ CO-PI OTHER PERCENTAGE 33.33% OF YOUR TIME CONTRIBUTION TERM OF GRANT Beginning/ End Dates TOTAL AWARD ~$500,000 College of Engineering Beowulf Cluster Federal Appropriations Build the College of Engineering Beowulf Cluster

86 Unfunded TITLE FUNDING AGENCY AIMS / GOAL OF GRANT PI/CO-PI/ OTHER PERCENTAGE 50% OF YOUR TIME CONTRIBUTION TERM OF GRANT Beginning/ End Dates TOTAL AWARD $1,135,818 Affectively Intelligent Computing Federal Appropriation 2009 This project s main objective is to develop Affectively Intelligent Computer Applications that will measure its user s (i.e. a driver, student, or patient) physiological signals with non-invasive wearable computers and employ pattern recognition and neural network algorithms to analyze and classify those physiological signals into an emotional state. CO-PI Submitted in 2009 but prepared in 2008 TITLE FUNDING AGENCY AIMS / GOAL OF GRANT PI/CO-PI/ CO-PI OTHER PERCENTAGE 10-15% OF YOUR TIME CONTRIBUTION TERM OF GRANT Beginning/ End Dates TOTAL AWARD $568,000 Opportunities and Challenges in Broadband Technology Federal Appropriation 2009 TITLE FUNDING AGENCY AIMS / GOAL OF GRANT NSF PI/CO-PI/ OTHER PERCENTAGE 50% OF YOUR TIME CONTRIBUTION TERM OF GRANT Beginning/ End Dates TOTAL AWARD $378,559 Research Infrastructure for Multi-processor Beowulf Clusters Develop programming methodologies for multi-processor computers on a cluster. CO-PI TITLE FUNDING AGENCY AIMS / GOAL OF GRANT A Software Testing, Systems and Programming Languages Lab UNLV Research Infrastructure Program

87 CO-PI PI/CO-PI/ OTHER PERCENTAGE 33% OF YOUR TIME CONTRIBUTION TERM OF GRANT Beginning/ End Dates TOTAL AWARD $53,867 Unfunded TITLE Microsoft FUNDING AGENCY AIMS / GOAL OF GRANT PI/CO-PI/ PI OTHER PERCENTAGE 25% OF YOUR TIME CONTRIBUTION TERM OF GRANT Beginning/ End Dates TOTAL AWARD $307,674 An Acute Care Health Information System Smart health care information system and diagnosis. TITLE FUNDING AGENCY AIMS / GOAL OF GRANT PI/CO-PI/ OTHER PERCENTAGE 50% OF YOUR TIME CONTRIBUTION TERM OF GRANT Beginning/ End Dates TOTAL AWARD $49,516 Cluster Computing with Multi-core Architectures UNLV Presidents Research Award Develop programming methodologies for multi-processor computers on a cluster. CO-PI 2007: TITLE FUNDING AGENCY AIMS / GOAL OF GRANT PI/CO-PI/ OTHER PERCENTAGE 100% OF YOUR TIME CONTRIBUTION TERM OF GRANT Beginning/ End Dates TOTAL AWARD $10,000 New Debugging Techniques for State of the Art Message Passing Libraries New Investigator Award (UNLV) To support the development of new debugging techniques in message passing programming PI

88 TITLE FUNDING AGENCY AIMS / GOAL OF GRANT PI/CO-PI/ OTHER PERCENTAGE OF YOUR TIME CONTRIBUTION TERM OF GRANT Beginning/ End Dates TOTAL AWARD TITLE FUNDING AGENCY AIMS / GOAL OF GRANT PI/CO-PI/ OTHER PERCENTAGE OF YOUR TIME CONTRIBUTION TERM OF GRANT Beginning/ End Dates TOTAL AWARD New Debugging Techniques for State of the Art Message Passing Libraries Research and Development Award (UNLV) To support the development of new debugging techniques in message passing programming PI 100% $10,000 Unfunded A Software Testing and Usability Lab Presidents Research Awards (UNLV) Setup a software testing and usability lab in the school of computer science. CO-PI 25% $48, Unfunded TITLE FUNDING AGENCY AIMS / GOAL OF GRANT PI/CO-PI/ OTHER PERCENTAGE 33.33% OF YOUR TIME CONTRIBUTION TERM OF GRANT Beginning/ End Dates TOTAL AWARD $53, A Software Testing, Systems, and Programming Languages Lab RIA (UNLV) Develop a lab focusing on research issues in software engineering, systems and programming languages. CO-PI 2006: TITLE FUNDING AGENCY AIMS / GOAL OF GRANT PI/CO-PI/ OTHER PERCENTAGE OF YOUR TIME CONTRIBUTION Multilevel debugging for state of the art message passing libraries UNLV New Investigator Award Develop new and novel debugging approaches in message passing programming. 100%

89 TERM OF GRANT Beginning/ End Dates TOTAL AWARD $15,000 TITLE FUNDING AGENCY AIMS / GOAL OF GRANT PI/CO-PI/ OTHER PERCENTAGE 50% OF YOUR TIME CONTRIBUTION TERM OF GRANT Beginning/ End Dates TOTAL AWARD $100,000 Teaching Without Board(er)s: A proof of concept classroom for the Nevada State University System Microsoft Tablet PC Grant Develop new and innovative methods for teaching using a high tech class room setup centered around the use of projectors and Tablet PCs Rene Bryce TITLE FUNDING AGENCY AIMS / GOAL OF GRANT PI/CO-PI/ OTHER PERCENTAGE OF YOUR TIME CONTRIBUTION TERM OF GRANT Beginning/ End Dates CAREER: Development and Debugging Methodologies for Message Passing Programming NSF Develop new and novel debugging approaches in message passing programming. 100%? TOTAL AWARD Requested $654,000 Received $0

90 Back to my main page The Joccam Language Joccam (Java-style Occam) is a brand new language which fuses two very important features from two existing programming languages: The process orientated design methodology (including channels, barriers, mobile processes etc.) from occam [] and the well known syntax of Java []. The reason for the development of Joccam is mainly to try to push process oriented development. We believe that process orientation is the best way to program fine graine parallelism; especially when dealing with multi-core architectures, which are becoming increasingly popular. The design of Joccam follows the following simple thesis: Attempt to provide the functionality of occam-pi but use a Java style (i.e., 100% match java if possible, else ado the Java style for new constructs). With the popularity of multi-core architectures this naturally remains a target for a proc oriented language like Joccam, but in addition, we intend to provide multiple back-ends the compiler; in particular, we are working on a C with MPI code generator, which lets y take advantage of process oriented design principles and language features as well as a distributed runtime environment. Other targets that are planned include java bytecode f portability reasons. Please check back regularly as we will be updating this page as we progress. This work is supported by the UNLV Research Development Award Joccam Examples Although the development of Joccam is still in its early stages, the syntax is more or less determined. Here is an example of a piece of occam code with an ALT and an extended rendez-vous: PROC foo(chan OF INT in1?, CHAN OF INT in2?, CHAN OF INT out!) SEQ ALT INT y: in1? y out! y INT y: in2? y out! y INT y: in1?? y out! y : which in Joccam would look like this:

91 proc void foo(chan<int>.read in1, chan<int>.read in2, chan<int>.write out int y; alt { y = in1.read() : { out.write(y); } y = in2.read() : { out.write(y); } } y = in1.read({ out.write(y); }); } The Joccam code is much closer to the well-known Java syntax, and in addition to havin } constructs, the keywords are no longer set in capitals, and indentation no longer matte We believe that this will prove to be a good motivator for learning process oriented desi and programming. 2 The building blocks of Joccam 2.1 Data Types In the spirit of keeping Joccam close to Java with respect to syntax, we have chosed to u the Java atomic type system, rather than that of occam Atomic Types In Java, the atomic types are: boolean, byte, short, char, int, float, long, double. Joccam uses the same names, but in addition, string is an atomic type (Joccam does not have the notion of objects, and since Java implements strings as an object, this seemed necessary). In addition to the regular atomic types, Joccam has an additional number (currently 2) o atomic types inherited from occam. The first is a timer type, which in reality is the read end of a timing process that is always willing to engage in communication. The second is barrier type, which is a special construct that defines a full barrier. Processes enrolled (using the keyword enroll, which can be prefixed by a par or a for-loop, if needed) on a barrier can synchronize on it by using the sync keyword Type constructors Java has but two type constructors, namely classes and arrays. Since Joccam is not objec oriented we do not have the notion of classes or objects, but we do have arrays; arrays i Joccam look and behave similarly to their Java cousins. Only a few differences exist: The syntax for declaring a Joccam array requires the [..] to be placed on the type an not on the name of the variable/parameter. Empty dimensions are allowed only on parameters or on variables if assigned an arra value whose dimensions can be determined at compile time. Java only allows for array constants at variable declaration time. Joccam treats arra

92 constants like any other constant. A number of useful array operations like size must be made available; we haven't determined if a size of an array should be accessed as s = array.size or as s = size(array) At the moment the first one is favoured. occam implements array slicing, we have not yet determined if we are going to supp this in Joccam. Eecordsare not found in Java (Records can be implemented as classes without any methods), but since we do not have classes in Joccam, it is necessary to have at least records available. An example of a record ld be: type record myrecord { int a; double d; } Like arrays, records constant values. An example of a constant value of the above record could be myrecord{4, 5.7} An additional two type constructors exist, namely protocol and process types. A protocol determines which types a channel can carry; We have not determined the exact syntax f protocols as of yet. a process type, or a proc type looks like this: type proc is (...); where... is a list of formal parameters of a process definition. A process definition is needed when implementing mobile processes, not only for specifying that a mobile proce declarations 'implements' this process type, but also for specifying the type that travels across the channels that will carry the mobile when it is in its suspended state (i.e., not executing). Room for discussion: arrays are not declared using the type word array, whereas record are. 2.2 Declarations Constants In Java the concept 'constant' does not exist explicitly; instead, a final field cannot be assigned to, so in effect, it behaves like a constant; However, it is not possible to declar local constants within a method. In occam a constant is prefixed the keyword VAL; VAL constants can be local as well as parameters.

93 In Joccam we have decided to call a spade a spade and simply use the word const. Constants can be declared at the top level, along with the type declarations; as well as b formal parameters, and local. If a constant is defined locally or globally it must be intialized at declaration time: const int WORKING_TIME = ; whereas when used as a formal we could have: proc void foo(const int i) {... } Local and Parameters A local or a parameter in Joccam is declared in the exact same was as in Java: [<modifiers>] <type> [<array_dims>] name [ = initializer] where currently the only two modifiers we have are const, used for declaring a constant (which then requires the initializer to be present), and mobile used to declare the variab as holding a mobile type Channel Declarations Channels are a new concept not found in Java, but plays an integral role in occam, and f that matter, in any process oriented design. A channel carries values of a certain type in one direction, from or or more senders to one or more receivers (channels can be one-to one, one-to-many, many-to-one, or many-to-many). If a channel is has many senders or many receivers (or both) was say that it is shared. When declaring channels we must declare which end of it is shared, and also specify the type that it carries. For example: shared write chan<agent_message> report declares a channel called report, which carries values of the Agent_message type, and is shared on the writing end (i.e., it can have multiple writers. When a channel is declared shared, it must be claimed by a process before it can be written to/read from. (More abo claim later) In addtion, we have channel-end types and expressions as well. A channel-end type is simply a channel type followed by a.read or a.write, indicating which end of a channel type we are interested in. Likewise, if a variable contains a whole channel, and not just channel-end,.read and.write can be specified. If a read() operation is applied to a wh channel, the read end is automatically picked. The same holds for the write() operation 2.3 Statements In the tradition of keeping the syntax as close to Java as possible, the majority of statements in Joccam have the same syntactical structure as statements in Java. Assignment

94 Java alows assignment like a = b = c = 6;, and occam allows assignments like a,b,c 7,5,d. Either type can cause aliasing problems, but at the moment Joccam only supports a single assignment per =, though we will probably end up supporting both types of assignment, but not a mixture (That would probably not be syntactically via anyhow!). Choice Joccam will support Java-style if statements, both with and without an else clause. Whether a ternary exspression will be supported has not yet been determined. We might introduce an elseif keyword, but that is only a thought at the moment. Java-style switch/case statements will be implemented in Joccam, and in addition w might implement the case statement of occam that allows to switch on a channel re The extension to Java's switch statement then would require that the case labels can be not only integral constants, but also union constants. Repetition Java currently has standard for, do, and while loops, in addition to iterators. Joccam will implement do and while loops according to the standard Java syntax; for loops a a little more difficult as the occam equivalent is somewhat different in that a for lo can be prefixed with the par construct, allowing for the body of the loop to be done parallel. This would ultimately require some analysis of the body of the loop, or a pr execution of the loop to determine the index set. This is only possible if the body of the loop cannot change the variables that are used in the loop condition. Since we d not allow global variables, and use a call-by-value call semantics, it should be reasonbly simple analyze the assignments of the body to assure that if the loop is to executed in parallel no loop variables may be re-assigned. An example of how to do this has been provided by Neil Brown and works as follows: par for (i=,j=0;i<100;i+=2,j=j+2*i) statements would require the index set (i,j) = [(0,0), (2,4), (4,12)...] to be pre-computed, and then the statements executed in parallel over this index se As far as iterators, we have not made any decissions at all. Blocks and par occam provides both a PAR and a SEQ construct. Examples are: SEQ a := 5 b := 7 and PAR a := 5 b := 7

95 whe the assignments in the SEQ block are done in sequence (i.e., sequentially), and assignments in the PAR block are done in parallel. In Joccam there is no need for the SEQ construct, as by default, everything is done sequentially, so a simple Java block using { and } is sufficient. In Joccam a block prefixed by the par keyword will be a parallel block. Communication The notion of channel communication does not exist in Java; this is 100% inherited from occam. Thus this requires a brand new Java-like syntax. In occam a channel ca be read or written in the following way: in? x out! x The first statement reads a value from the in channel into x and the second writes t same value to the out channel. The suggested syntax for joccam is as follows: x = in.read(); out.write(x); Though Joccam does not have objects, we chose this 'method invocation' style to sta close to something Java programmers know. Extended rendez-vous in occam (a construct where the writer/sender is not released from the synchronous call until the code in the extended rendez-vous block has been executed) look like this (If more than one process must be executed in the rendez-v block a PAR or a SEQ block is needed): in?? x SEQ out! x out! x this, in Joccam, would look like this: x = in.read({out.write(x); out.write(x);}); Alternatively the rendez-vous block could be prefixed a par. Barriers A barrier in occam is an atomic typed, and also so in Joccam. Barriers are declared, enrolled on, synchronizes on and temporarily resigned from in he following way: barrier b;... enroll(b) { };... sync(b);...

96 resign(b) { }; Alternatively a par can be placed infront of the enroll statement. Barriers can also b passed as parameters to function. skip and stop Both skip (which is a no-operations process), and stop (which is a process that refus to engage in any action, thus deadlocking the process) exist only in occam. Typically skip can be replaced by a ; in Java, but both are statements in Joccam. Mobile invocation, suspension, and resumption The concept of mobiles does not exist in Java, but is the latest extension to occam- There are two classes of mobiles: mobile channels and mobile processes. For now we shall restrict Joccam to have mobile processes, and we will later return to the mobil channels (and mobile channel bundles, as well as issues with arrays of mobile). 2.4 Expressions Expressions in Joccam (except the addition of channel reads and timer reads) are similar Java expression. 3 Modularity 4 I/O For Joccam to be a proper language some sort of modularity and import/include mechanism must be provided. The Java package model is slightly complicated to implement, and relies somewhat on the object oriented aspects of the language. Occam uses an include statement on a per file basis; something is much easier to implement. Fo joccam we shall stick to the occam way and simply include files as needed. To come later 5 Java Call Backs To come later 6 Multiple Back-ends Currently we have a occam and a c with MPI back-end in the works.

Curriculum Vitæ. (Home address) 8399 Transvaal Blue Street Phone: (702) Las Vegas, NV Cell: (702)

Curriculum Vitæ. (Home address) 8399 Transvaal Blue Street Phone: (702) Las Vegas, NV Cell: (702) Curriculum Vitæ Jan Bækgaard Pedersen School of Computer Science Phone: (702) 895 2557 University of Nevada, Las Vegas Fax: (702) 895 2639 4505 South Maryland Parkway Email: matt@cs.unlv.edu Las Vegas,