Abstract
| Language | English |
|---|---|
| Title of host publication | Unknown Host Publication |
| Pages | 174-176 |
| Number of pages | 3 |
| DOIs | |
| Publication status | Published - 2001 |
| Event | Infrastructure for Agents, Multi-Agent Systems and Scalable Multi-Agent Systems - Barcelona, Spain Duration: 1 Jan 2001 → … |
Conference
| Conference | Infrastructure for Agents, Multi-Agent Systems and Scalable Multi-Agent Systems |
|---|---|
| Period | 1/01/01 → … |
Keywords
- n/a
Cite this
}
As strong as possible agent mobility. / Walsh, T; Nixon, Patrick; Dobson, S.
Unknown Host Publication. 2001. p. 174-176.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - As strong as possible agent mobility
AU - Walsh, T
AU - Nixon, Patrick
AU - Dobson, S
PY - 2001
Y1 - 2001
N2 - A major challenge for distributed applications working in mobile contexts is to provide application developers with a method of building stable systems whose elements may change across time. We introduce the concept of As Strong As Possible mobility that uses a combination of data space management and thread state capture so that objects and threads can migrate in a manner that has not been properly explored yet. The ultimate goal is to provide a mechanism for mobility where an object will be migrated using strong mobility techniques where possible and using rebinding mechanisms when it is not advantageous to simply ’grab’ a thread’s state.
AB - A major challenge for distributed applications working in mobile contexts is to provide application developers with a method of building stable systems whose elements may change across time. We introduce the concept of As Strong As Possible mobility that uses a combination of data space management and thread state capture so that objects and threads can migrate in a manner that has not been properly explored yet. The ultimate goal is to provide a mechanism for mobility where an object will be migrated using strong mobility techniques where possible and using rebinding mechanisms when it is not advantageous to simply ’grab’ a thread’s state.
KW - n/a
U2 - 10.1007/3-540-47772-1_16
DO - 10.1007/3-540-47772-1_16
M3 - Conference contribution
SN - 354042315X
SP - 174
EP - 176
BT - Unknown Host Publication
ER -