PARALLEL SIMULATION LANGUAGE FOR DISCRETE EVENT SYSTEMS

THAT DISCRETE EVENT DYNAMIC SYSTEMS (DEDS) CONSTITUTE AN IMPORTANT TOPIC OF SYSTEMS THEORY AND OPERATION RESEARCH IS NO LONGER IN QUESTION, AND WHILE EXAMPLES OF DEDS RANGING FROM AIRPORTS TO COMMUNICATION NETWORKS TO LOGISTICS, SERVICE, AND MANUFACTURING SYSTEMS ABOUND IN OUR DAILY LIVES, THE FACT REMAINS THAT PERFORMANCE OF ONLY A SMALL PERCENTAGE OF SUCH SYSTEMS CAN BE ANALYZED IN CLOSED FORM. SIMULATION REMAINS THE GENERAL PURPOSE PERFORMANCE EVALUATION TOOL OF CHOICE. HOWEVER, SIMULATION IS NOTORIOUSLY TIME CONSUMING, PARTICULARLY IF PARAMETRIC SYSTEM PERFORMANCE STUDIES ARE INVOLVED. FURTHERMORE, TRADITIONAL PERFORMANCE OPTIMIZATION ALGORITHMS ARE INHERENTLY ITERATIVE AND SEQUENTIAL. ATTEMPTS TO PARALLELIZE OR DISTRIBUTE THE COMPUTATION ON MODERN MASSIVELY PARALLEL COMPUTERS HAVE NOT BEEN SUCCESSFUL. THE RESULT IS THAT SIMULATION IN PRACTICE HAS NOT BEEN USED EFFECTIVELY AS A DESIGN TOOL AND OFTEN AS A LAST RESORT TO VALIDATE AD HOC DESIGNS. RESEARCHERS ADVOCATE A FUNDAMENTAL MIND SET CHANGE ON THE WAY DISCRETE EVENT SIMULATION LANGUAGES ARE CONSTRUCTED. THE APPROACH PARALLELIZES THE PERFORMANCE EVALUATION EXPERIMENTS INSTEAD OF THE ALGORITHMS. BY TAKING ADVANTAGES OF RECENT THEORETICAL DEVELOPMENTS IN PERFORMANCE SENSITIVITY ANALYSIS AND STOCHASTIC OPTIMIZATION TECHNIQUES, THE CREATION OF A GENERAL PURPOSE DISCRETE EVENT SIMULATION LANGUAGE THAT HAS THE POTENTIAL OF SEVERAL ORDERS OF MAGNITUDE IMPROVEMENT IN THE EFFICIENCY OF PERFORMANCE EVALUATION OF DISCRETE EVENT SYSTEMS IS VISUALIZED.