OLD AND NEW PUMPING STATION DESIGN FEATURES INTEGRATED FOR AN EFFICIENT PUMPING SYSTEMCombined sewer overflow (CSO) discharges at Berkshire Street (CSO #9) represented the largest single discharge by volume of untreated CSO into the Connecticut River within the Commonwealth of Massachusetts, and contributed greater than 55 percent of the untreated discharges from the City of Holyoke.The USEPA issued an Administrative Order to the City of Holyoke to begin the construction of the...Author(s)Paul W. MoultonScott ThibaultRobert McGuiganSourceProceedings of the Water Environment FederationSubjectSession 107: Pump Stations: Keeping Your Assets High and DryDocument typeConference PaperPublisherWater Environment FederationPrint publication date Jan, 2008ISSN1938-6478SICI1938-6478(20080101)2008:7L.7872;1-DOI10.2175/193864708788808924Volume / Issue2008 / 7Content sourceWEFTECFirst / last page(s)7872 - 7885Copyright2008Word count152
Interpretation and run-time compilation techniques are becoming increasingly important due to the need to support heterogeneous architectures, evolving programming languages, and dynamically downloaded code. Although interpreters are easy to write and maintain, they are inefficient. On the other hand, run-time compilation provides efficient execution, but is costly to implement. One way to get the best of both approaches is to apply program specialization to an interpreter in order to generate an efficient implementation automatical- ly. Recent advances in program specialization technology have resulted in important improvements in the performance of specialized interpreters. This paper presents and assesses experimental results for the application of program specialization to both bytecode and structured-language interpreter- s. The results show that for general-purpose bytecode, program specialization can yield speedups of up to a factor of four, while specializing certain structured-language interpreters can yield performance equivalent to code compiled by a general-purpose compiler.
Article A framework for application generator design Share on Authors: Scott Thibault University of Rennes/IRISA, Campus Universitaire de Beaulieu, 35042 Rennes Cedex, France University of Rennes/IRISA, Campus Universitaire de Beaulieu, 35042 Rennes Cedex, FranceView Profile , Charles Consel University of Rennes/IRISA, Campus Universitaire de Beaulieu, 35042 Rennes Cedex, France University of Rennes/IRISA, Campus Universitaire de Beaulieu, 35042 Rennes Cedex, FranceView Profile Authors Info & Claims SSR '97: Proceedings of the 1997 symposium on Software reusabilityMay 1997 Pages 131–135https://doi.org/10.1145/258366.258408Online:01 May 1997Publication History 26citation483DownloadsMetricsTotal Citations26Total Downloads483Last 12 Months5Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
article Free Access Share on A framework for application generator design Authors: Scott Thibault University of Rennes/IRISA, Campus Universitaire de Beaulieu, 35042 Rennes Cedex, France University of Rennes/IRISA, Campus Universitaire de Beaulieu, 35042 Rennes Cedex, FranceView Profile , Charles Consel University of Rennes/IRISA, Campus Universitaire de Beaulieu, 35042 Rennes Cedex, France University of Rennes/IRISA, Campus Universitaire de Beaulieu, 35042 Rennes Cedex, FranceView Profile Authors Info & Claims ACM SIGSOFT Software Engineering NotesVolume 22Issue 3May 1997 pp 131–135https://doi.org/10.1145/258368.258408Published:01 May 1997Publication History 26citation490DownloadsMetricsTotal Citations26Total Downloads490Last 12 Months7Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Domain-specific languages (DSL) have many potential advantages in terms of software engineering ranging from increased productivity to the application of formal methods. Although they have been used in practice for decades, there has been little study of methodology or implementation tools for the DSL approach. In this paper we present our DSL approach and its application to a realistic application: video display device drivers.
The presentation focuses on the validation of our proposed framework for domain-specific languages, which provides automatic generation of efficient implementations of DSL programs. Additionally, we describe an example of a complete DSL for video display adaptors and the benefits of the DSL approach in this application. This demonstrates some of the generally claimed benefits of using DSLs: increased productivity, higher-level abstraction, and easier verification. The DSL has been fully implemented with our approach and is available1.
Le developpement logiciel est une activite dont l'importance ne cesse de croitre. Cela est du au deploiement general de l'informatique, et plus particulierement a l'essor des technologies de l'information popularisees par internet. Dans beaucoup de domaines, le processus de developpement joue un role critique dans le temps de mise sur le marche d'un logiciel ; le developpement doit etre le plus rapide possible, tout en minimisant le nombre de defauts. Or, plus l'usage de l'informatique se repand, plus il est difficile de fournir des solutions specifiques aux besoins de chaque client. Cela explique la demande croissante de programmabilite qu'expriment les utilisateurs, qui desirent personnaliser les logiciels en fonction de leur besoins propres. Cette these etudie la construction de langages dedies et leur emploi en tant que technique de genie logiciel pour repondre a ces questions d'adaptabilite. Un langage dedie est un langage de programmation dont le domaine d'application est restreint a un petit nombre de problemes particuliers. Il offre une interface de programmation de haut niveau, permet la detection automatique d'erreurs liees au domaine, et conduit a la generation de code fiable. Ces caracteristiques fournissent une reponse aux questions precedentes en reduisant le temps de developpement et la maintenance du logiciel. La tache de programmation laissee a l'utilisateur final est facilitee par un niveau d'abstraction eleve et une securite des programmes accrue grace a des mecanismes de verification. Malgre ces avantages annonces, les langages dedies n'ont commence a etre etudies en profondeur que recemment. Nous presentons ici un cadre general pour le developpement de langages dedies, depuis la conception du langage jusqu'a son implementation. Nous illustrons egalement l'interet general des langages dedies et demontrons le bien fonde de notre approche a l'aide de deux applications realistes (les pilotes de cartes graphiques et les protocoles pour reseaux actifs). Ces deux applications montrent que, grace a notre approche, on obtient de hauts niveaux d'abstraction, des temps de developpement reduits et la verification automatique de proprietes de surete, sans compromettre la vitesse d'execution du logiciel.
