Monoliths to Mashups: Increasing Opportunistic Assets

被引:12
作者
Gamble, M. Todd [1 ]
Gamble, Rose [1 ]
机构
[1] Univ Tulsa, Tulsa, OK 74104 USA
关键词
Companies; Connectors; Hybrid software systems; Internet; Interoperability; Mashups; Methodologies; Monoliths; Opportunistic development; Opportunities; Quality of service; Reusable software; Security; Servers; Software;
D O I
10.1109/MS.2008.152
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Opportunities are available resources that yield desired results. An opportunity's suitability depends on who seizes it and the context for its use. Opportunistic development builds hybrid software systems from reusable resources called opportunistic assets. Mashups are Web application hybrids that consume these assets. Monoliths are self-contained systems that can produce such opportunistic assets if they can expose key functions that are easy to mash. A major barrier to reusing legacy monoliths is integration. Elevating integration connectors to first-class opportunistic assets reduces this barrier by linking to and presenting monolith applications as opportunities for mashups. © 2008 IEEE.
引用
收藏
页码:71 / 79
页数:9
相关论文
共 15 条
[1]   Fuselets: Lightweight applications for information manipulation [J].
Ahmed, N ;
Milligan, JR .
Defense Transformation and Network-Centric Systems, 2005, 5820 :267-276
[2]  
Brandt J., 2008, P 4 INT WORKSHOP END, P1, DOI 10.1145/1370847.1370848
[3]  
Buschmann F. a., 2007, Pattern-oriented Software Architecture: A Pattern Language for Distributed Computing, V4
[4]  
Cherbakov L, 2007, IBM SYST J, V46, P743, DOI 10.1147/sj.464.0743
[5]  
ENNALS R, 2007, P ACM SIGPLAN INT C, P223
[6]  
GAMBLE MT, 2008, SOFTWARE PROCESS IMP, V13, P145
[7]  
Gamble R, 2008, PROCEEDINGS OF THE 2008 IEEE INTERNATIONAL CONFERENCE ON INFORMATION REUSE AND INTEGRATION, P380
[8]   Hacking, mashing, gluing: Understanding opportunistic design [J].
Hartmann, Bjoern ;
Doorley, Scott ;
Klemmer, Scott R. .
IEEE PERVASIVE COMPUTING, 2008, 7 (03) :46-54
[9]  
Hong Jason I., 2006, P CHI 06 C HUM FACT, P1541
[10]  
Jhingran A., 2006, P 32 INT C VER LARG, P3