Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Mark Calleja

dblp:05/587 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2009
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1Computer networks · 1Software engineering, systems software and programming languages · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Optical networks · 56% Physical-layer communications · 44%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications › interference
crosstalk
0.011998
Crosstalk performance of coherent time-addressed photonic CDMA networks · IEEE Trans. Commun. 1998
Optical networks
optical code-division multiple access
0.011998
Crosstalk performance of coherent time-addressed photonic CDMA networks · IEEE Trans. Commun. 1998

Methods — techniques the papers use, named apart from their topics

bit error rate analysis · 0.0
YearPublicationVenuePosition
2009 Performance prediction for running workflows under role-based authorization mechanisms
abstract
When investigating the performance of running scientific/commercial workflows in parallel and distributed systems, we often take into account only the resources allocated to the tasks constituting the workflow, assuming that computational resources will accept the tasks and execute them to completion once the processors are available. In reality, and in particular in Grid or e-business environments, security policies may be implemented in the individual organisations in which the computational resources reside. It is therefore expedient to have methods to calculate the performance of executing workflows under security policies. Authorisation control, which specifies who is allowed to perform which tasks when, is one of the most fundamental security considerations in distributed systems such as Grids. Role-Based Access Control (RBAC), under which the users are assigned to certain roles while the roles are associated with prescribed permissions, remains one of the most popular authorisation control mechanisms. This paper presents a mechanism to theoretically compute the performance of running scientific workflows under RBAC authorisation control. Various performance metrics are calculated, including both system-oriented metrics, (such as system utilisation, throughput and mean response time) and user-oriented metrics (such as mean response time of the workflows submitted by a particular client). With this work, if a client informs an organisation of the workflows they are going to submit, the organisation is able to predict the performance of these workflows running in its local computational resources (e.g. a high-performance cluster) enforced with RBAC authorisation control, and can also report client-oriented performance to each individual user.
Ligang He, Mark Calleja, Mark Hayes, Stephen A. Jarvis
IPDPS2
2006 Computational Grids for Mid-Sized Collaborative Projects: The eMinerals Experience
abstract
Grid computing has the potential to revolutionise how small groups of simulation scientists work together to tackle new science problems. In this paper we report how the eMinerals project has developed a small scale integrated compute and data grid infrastructure - the eMinerals minigrid - and developed generic job submission tools that exploit this infrastructure and which enable the science users to also access other grid systems.
Martin T. Dove, Toby O. H. White, Andrew M. Walker, Richard Paul Bruin, Kat F. Austen, Emilio Artacho, L. A. Sullivan, Mark Calleja, Matthew G. Tucker, Rik P. Tyer, Philip A. Couch, Kerstin Kleese van Dam, R. J. Allan, Ilian T. Todorov, Clovis Chapman, Wolfgang Emmerich, Arnaud Marmier, Steve C. Parker, M. O. Blanchard, C. Richard A. Catlow, Z. Du, N. de Leeuw, Gareth J. Lewis, Vassil Alexandrov 0001, M. Alfredsson, J. P. Brodholt, Peter Murray-Rust
e-Science8
1998 Crosstalk performance of coherent time-addressed photonic CDMA networks
abstract
We report a theoretical investigation of the crosstalk performance of photonic code-division multiple access (CDMA) networks that are based on coherent matched filtering of optical pulses. We describe the importance of time gating in the reduction of noise in spread-time CDMA schemes. We give guidelines for the selection of codes in coherent matched filtering, and give a code set that produces low crosstalk. We present calculated bit-error rates (BERs) that show for individual user data rates in the gigabit per second range that crosstalk limits aggregate bit rates to the tens of gigabits per second range. This level of performance is a significant improvement over purely incoherent spread-time approaches. Such low crosstalk suggests that this scheme may be the first spread-time photonic CDMA scheme that is not crosstalk-limited.
David D. Sampson, Mark Calleja, Robert A. Griffin
IEEE Trans. Commun.2