default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLen Freeman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[c10]Paul Slavin, Len Freeman:
Integrating Dynamic Memory Placement with Adaptive Load-Balancing for Parallel Codes on NUMA Multiprocessors. Euro-Par 2008: 274-284- 2006
- [c9]Anila Usman, Mikel Luján, Len Freeman, John R. Gurd:
Performance Evaluation of Storage Formats for Sparse Matrices in Fortran. HPCC 2006: 160-169 - [c8]Sabin Tabirca
, Tatiana Tabirca, Laurence Tianruo Yang, Len Freeman:
Feedback Guided Dynamic Integral Partition. ISPDC 2006: 317-322 - 2005
- [j5]Tatiana Tabirca, Len Freeman, Sabin Tabirca, Laurence Tianruo Yang:
Applying the Feedback Guided Dynamic Loop Scheduling Method for the Shortest Path Problem. Parallel Process. Lett. 15(4): 491-497 (2005) - 2004
- [j4]Sabin Tabirca, Tatiana Tabirca, Laurence Tianruo Yang, Len Freeman:
Evaluation of the Feedback Guided Dynamic Loop Scheduling (FGDLS) Algorithms. IEICE Trans. Inf. Syst. 87-D(7): 1829-1833 (2004) - [j3]Tatiana Tabirca, Len Freeman, Sabin Tabirca, Laurence Tianruo Yang:
Feedback Guided Dynamic Loop Scheduling: Convergence of the Continuous Case. J. Supercomput. 30(2): 151-178 (2004) - 2003
- [c7]Tatiana Tabirca, Sabin Tabirca, Len Freeman, Laurence Tianruo Yang:
An O(p + log p) Algorithm of Discrete FGDLS. ICPP Workshops 2003: 164- - [c6]Sabin Tabirca, Tatiana Tabirca, Len Freeman, Laurence Tianruo Yang:
Static Workload Balance Scheduling; Continuous Case. IPDPS 2003: 251 - 2002
- [j2]Tatiana Tabirca, Len Freeman, Sabin Tabirca:
A Convergence Proof of FGDLS when the Workload is Monotous. Sci. Ann. Cuza Univ. 11: 132-141 (2002) - [j1]Tatiana Tabirca, Len Freeman, Sabin Tabirca:
On O(log p) parallel implementation of feedback guided dynamic loop scheduling. Parallel Algorithms Appl. 17(2): 157-164 (2002) - [c5]Tatiana Tabirca, Sabin Tabirca, Len Freeman, Laurence Tianruo Yang:
A Static Workload Balance Scheduling Algorithm. ICPP Workshops 2002: 235-239 - [c4]Tatiana Tabirca, Len Freeman, Sabin Tabirca, Laurence Tianruo Yang:
An Application of Feedback Guided Dynamic Loop Scheduling to the Shortest Path Problem. PDPTA 2002: 1786-1789 - 2001
- [c3]Tatiana Tabirca, Len Freeman, Sabin Tabirca, Laurence Tianruo Yang:
Feedback Guided Dynamic Loop Scheduling; A Theoretical Approach. ICPP Workshops 2001: 115-121 - [c2]Tatiana Tabirca, Len Freeman, Sabin Tabirca:
A Theoretical Application of Feedback Guided Dynamic Loop Scheduling. IWCC 2001: 287-292 - [e1]Rizos Sakellariou, John A. Keane, John R. Gurd, Len Freeman:
Euro-Par 2001: Parallel Processing, 7th International Euro-Par Conference Manchester, UK August 28-31, 2001, Proceedings. Lecture Notes in Computer Science 2150, Springer 2001, ISBN 3-540-42495-4 [contents]
1990 – 1999
- 1999
- [c1]J. Mark Bull, Rupert W. Ford, Len Freeman, David J. Hancock:
A Theoretical Investigation of Feedback Guided Dynamic Loop Scheduling. PP 1999
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-04 22:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
