HIGH LEVEL LANGUAGE PROGRAMMING AND AUTOMATED MAPPING TO MULTIPROCESSORS

CRYSTAL AND THE CRYSTAL RUN-TIME SYSTEM WILL MAKE THE USE OF LARGE-SCALE MULTIPROCESSORS PRACTICAL FOR REAL-WORLD PROBLEMS. CRYSTAL IS A VERY-HIGH-LEVEL LANGUAGE IN WHICH A USER PROGRAM RESEMBLES A CONCISE, FORMAL MATHEMATICAL DESCRIPTION. CRYSTAL IS EASY TO USE YET HAS THE MODULARITY AND FREEDOM FROM SIDE EFFECTS THAT IS CRITICAL FOR THE AUTOMATIC DETECTION OF PARALLELISM. MESSAGES NEED NOT BE PASSED EXPLICITLY, AND THE CRYSTAL COMPILER AUTOMATICALLY DOES TASK DECOMPOSITION. WHEN THE PATTERN OF COMPUTATIONS IN A SECTION OF THE PROGRAM IS KNOWN AT COMPILE TIME, A DIRECT MAPPING OF THE ALGORITHM IN QUESTION MAY BE PERFORMED. WHEN THE PATTERN OF COMPUTATIONS IS FULLY DETERMINED ONLY AT RUNTIME, THE COMPILER CONSTRUCTS A SYMBOLIC REPRESENTATION OF THE DATA DEPENDENCIES. THE RUNTIME SYSTEM WILL USE THIS SYMBOLIC REPRESENTATION TO AGGREGATE THE REQUIRED COMPUTATIONS. WHEN ENOUGH REGULARITYIS PRESENT IT WILL CREATE A PARAMETERIZED MAPPING SCHEME. USING KNOWLEDGE OF TARGET MACHINE CHARACTERISTICS, THE RUNTIME SYSTEM WILL CHOOSE THE APPROPRIATE INSTANCE OF THE MAPPING SCHEME AND DYNAMICALLY MAP THE COMPUTATIONS ONTO THETARGET ARCHITECTURE.